/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 PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure3.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 09:13:33,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 09:13:33,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 09:13:33,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 09:13:33,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 09:13:33,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 09:13:33,190 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 09:13:33,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 09:13:33,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 09:13:33,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 09:13:33,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 09:13:33,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 09:13:33,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 09:13:33,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 09:13:33,217 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 09:13:33,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 09:13:33,218 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 09:13:33,218 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 09:13:33,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 09:13:33,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 09:13:33,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 09:13:33,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 09:13:33,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 09:13:33,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 09:13:33,220 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 09:13:33,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 09:13:33,221 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 09:13:33,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 09:13:33,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 09:13:33,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 09:13:33,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 09:13:33,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 09:13:33,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 09:13:33,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 09:13:33,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 09:13:33,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 09:13:33,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 09:13:33,223 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 09:13:33,223 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 09:13:33,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 09:13:33,223 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 09:13:33,224 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 -> PROGRAM_FIRST [2023-08-04 09:13:33,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 09:13:33,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 09:13:33,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 09:13:33,432 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 09:13:33,433 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 09:13:33,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure3.wvr_bound2.c [2023-08-04 09:13:34,477 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 09:13:34,599 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 09:13:34,600 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure3.wvr_bound2.c [2023-08-04 09:13:34,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58ac766cd/ec028ded9ce1427d82f24ebc363958df/FLAGfa05e486e [2023-08-04 09:13:34,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58ac766cd/ec028ded9ce1427d82f24ebc363958df [2023-08-04 09:13:34,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 09:13:34,618 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 09:13:34,619 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 09:13:34,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 09:13:34,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 09:13:34,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 09:13:34" (1/1) ... [2023-08-04 09:13:34,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f63a079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:13:34, skipping insertion in model container [2023-08-04 09:13:34,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 09:13:34" (1/1) ... [2023-08-04 09:13:34,636 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 09:13:34,740 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-figure3.wvr_bound2.c[2283,2296] [2023-08-04 09:13:34,741 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 09:13:34,747 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 09:13:34,764 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-figure3.wvr_bound2.c[2283,2296] [2023-08-04 09:13:34,767 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 09:13:34,772 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 09:13:34,772 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 09:13:34,776 INFO L206 MainTranslator]: Completed translation [2023-08-04 09:13:34,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:13:34 WrapperNode [2023-08-04 09:13:34,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 09:13:34,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 09:13:34,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 09:13:34,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 09:13:34,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:13:34" (1/1) ... [2023-08-04 09:13:34,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:13:34" (1/1) ... [2023-08-04 09:13:34,801 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 106 [2023-08-04 09:13:34,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 09:13:34,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 09:13:34,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 09:13:34,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 09:13:34,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:13:34" (1/1) ... [2023-08-04 09:13:34,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:13:34" (1/1) ... [2023-08-04 09:13:34,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:13:34" (1/1) ... [2023-08-04 09:13:34,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:13:34" (1/1) ... [2023-08-04 09:13:34,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:13:34" (1/1) ... [2023-08-04 09:13:34,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:13:34" (1/1) ... [2023-08-04 09:13:34,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:13:34" (1/1) ... [2023-08-04 09:13:34,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:13:34" (1/1) ... [2023-08-04 09:13:34,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 09:13:34,820 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 09:13:34,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 09:13:34,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 09:13:34,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:13:34" (1/1) ... [2023-08-04 09:13:34,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 09:13:34,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:13:34,868 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 09:13:34,874 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 09:13:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 09:13:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 09:13:34,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 09:13:34,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 09:13:34,933 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 09:13:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 09:13:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 09:13:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 09:13:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 09:13:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 09:13:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 09:13:34,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 09:13:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 09:13:34,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 09:13:34,934 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 09:13:34,995 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 09:13:34,997 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 09:13:35,250 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 09:13:35,272 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 09:13:35,272 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-04 09:13:35,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:13:35 BoogieIcfgContainer [2023-08-04 09:13:35,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 09:13:35,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 09:13:35,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 09:13:35,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 09:13:35,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 09:13:34" (1/3) ... [2023-08-04 09:13:35,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbf8f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:13:35, skipping insertion in model container [2023-08-04 09:13:35,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:13:34" (2/3) ... [2023-08-04 09:13:35,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bbf8f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:13:35, skipping insertion in model container [2023-08-04 09:13:35,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:13:35" (3/3) ... [2023-08-04 09:13:35,284 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-figure3.wvr_bound2.c [2023-08-04 09:13:35,290 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 09:13:35,297 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 09:13:35,297 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 09:13:35,297 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 09:13:35,353 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 09:13:35,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 112 transitions, 246 flow [2023-08-04 09:13:35,504 INFO L124 PetriNetUnfolderBase]: 33/252 cut-off events. [2023-08-04 09:13:35,504 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:13:35,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 252 events. 33/252 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 849 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 137. Up to 8 conditions per place. [2023-08-04 09:13:35,522 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 112 transitions, 246 flow [2023-08-04 09:13:35,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 112 transitions, 246 flow [2023-08-04 09:13:35,528 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:13:35,534 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 112 transitions, 246 flow [2023-08-04 09:13:35,536 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 112 transitions, 246 flow [2023-08-04 09:13:35,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 112 transitions, 246 flow [2023-08-04 09:13:35,562 INFO L124 PetriNetUnfolderBase]: 33/252 cut-off events. [2023-08-04 09:13:35,562 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:13:35,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 252 events. 33/252 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 849 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 137. Up to 8 conditions per place. [2023-08-04 09:13:35,565 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2023-08-04 09:13:37,481 INFO L134 LiptonReduction]: Checked pairs total: 2943 [2023-08-04 09:13:37,482 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-04 09:13:37,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 09:13:37,496 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;@1f031a7f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:13:37,496 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 09:13:37,499 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:13:37,499 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-04 09:13:37,499 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:13:37,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:37,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 09:13:37,500 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:37,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:37,503 INFO L85 PathProgramCache]: Analyzing trace with hash 425187087, now seen corresponding path program 1 times [2023-08-04 09:13:37,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:37,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491967567] [2023-08-04 09:13:37,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:37,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:37,669 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 09:13:37,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:37,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491967567] [2023-08-04 09:13:37,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491967567] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:37,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:13:37,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 09:13:37,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381232671] [2023-08-04 09:13:37,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:37,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:13:37,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:37,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:13:37,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:13:37,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 208 [2023-08-04 09:13:37,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 30 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 09:13:37,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:37,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 208 [2023-08-04 09:13:37,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:37,825 INFO L124 PetriNetUnfolderBase]: 260/419 cut-off events. [2023-08-04 09:13:37,825 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-04 09:13:37,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 419 events. 260/419 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1593 event pairs, 119 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 692. Up to 390 conditions per place. [2023-08-04 09:13:37,829 INFO L140 encePairwiseOnDemand]: 204/208 looper letters, 23 selfloop transitions, 2 changer transitions 3/32 dead transitions. [2023-08-04 09:13:37,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 32 transitions, 138 flow [2023-08-04 09:13:37,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:13:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:13:37,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-08-04 09:13:37,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2023-08-04 09:13:37,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-08-04 09:13:37,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-08-04 09:13:37,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:37,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-08-04 09:13:37,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 09:13:37,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 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 09:13:37,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 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 09:13:37,853 INFO L175 Difference]: Start difference. First operand has 29 places, 30 transitions, 82 flow. Second operand 3 states and 304 transitions. [2023-08-04 09:13:37,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 32 transitions, 138 flow [2023-08-04 09:13:37,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 09:13:37,857 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 80 flow [2023-08-04 09:13:37,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2023-08-04 09:13:37,861 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-08-04 09:13:37,861 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 80 flow [2023-08-04 09:13:37,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 09:13:37,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:37,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:13:37,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 09:13:37,862 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:37,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:37,863 INFO L85 PathProgramCache]: Analyzing trace with hash -432153514, now seen corresponding path program 1 times [2023-08-04 09:13:37,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:37,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594642968] [2023-08-04 09:13:37,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:37,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:37,918 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 09:13:37,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:37,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594642968] [2023-08-04 09:13:37,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594642968] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:13:37,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764619400] [2023-08-04 09:13:37,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:37,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:13:37,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:13:37,927 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 09:13:37,934 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 09:13:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:37,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:13:37,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:13:37,997 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 09:13:37,997 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:13:37,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764619400] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:37,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:13:37,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 09:13:37,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072772910] [2023-08-04 09:13:37,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:37,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:13:37,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:37,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:13:37,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:13:38,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 208 [2023-08-04 09:13:38,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 09:13:38,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:38,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 208 [2023-08-04 09:13:38,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:38,054 INFO L124 PetriNetUnfolderBase]: 257/409 cut-off events. [2023-08-04 09:13:38,054 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-04 09:13:38,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 409 events. 257/409 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1488 event pairs, 85 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 681. Up to 361 conditions per place. [2023-08-04 09:13:38,056 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 25 selfloop transitions, 2 changer transitions 1/32 dead transitions. [2023-08-04 09:13:38,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 32 transitions, 146 flow [2023-08-04 09:13:38,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:13:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:13:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2023-08-04 09:13:38,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48878205128205127 [2023-08-04 09:13:38,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 305 transitions. [2023-08-04 09:13:38,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions. [2023-08-04 09:13:38,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:38,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions. [2023-08-04 09:13:38,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:13:38,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 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 09:13:38,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 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 09:13:38,061 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 80 flow. Second operand 3 states and 305 transitions. [2023-08-04 09:13:38,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 32 transitions, 146 flow [2023-08-04 09:13:38,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 32 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 09:13:38,063 INFO L231 Difference]: Finished difference. Result has 28 places, 27 transitions, 78 flow [2023-08-04 09:13:38,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=28, PETRI_TRANSITIONS=27} [2023-08-04 09:13:38,064 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2023-08-04 09:13:38,064 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 78 flow [2023-08-04 09:13:38,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 09:13:38,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:38,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:13:38,072 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 09:13:38,268 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 09:13:38,269 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:38,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:38,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1686789416, now seen corresponding path program 1 times [2023-08-04 09:13:38,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:38,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410075539] [2023-08-04 09:13:38,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:38,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:38,311 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 09:13:38,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:38,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410075539] [2023-08-04 09:13:38,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410075539] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:13:38,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37614828] [2023-08-04 09:13:38,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:38,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:13:38,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:13:38,313 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 09:13:38,315 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 09:13:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:38,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:13:38,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:13:38,362 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 09:13:38,362 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:13:38,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37614828] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:38,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:13:38,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 09:13:38,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238553948] [2023-08-04 09:13:38,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:38,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:13:38,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:38,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:13:38,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:13:38,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 208 [2023-08-04 09:13:38,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 09:13:38,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:38,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 208 [2023-08-04 09:13:38,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:38,431 INFO L124 PetriNetUnfolderBase]: 171/284 cut-off events. [2023-08-04 09:13:38,431 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-08-04 09:13:38,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 284 events. 171/284 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 914 event pairs, 52 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 347. Up to 193 conditions per place. [2023-08-04 09:13:38,433 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 29 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-08-04 09:13:38,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 35 transitions, 160 flow [2023-08-04 09:13:38,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:13:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:13:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2023-08-04 09:13:38,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935897435897436 [2023-08-04 09:13:38,434 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2023-08-04 09:13:38,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2023-08-04 09:13:38,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:38,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2023-08-04 09:13:38,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:13:38,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 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 09:13:38,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 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 09:13:38,437 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 78 flow. Second operand 3 states and 308 transitions. [2023-08-04 09:13:38,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 35 transitions, 160 flow [2023-08-04 09:13:38,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 35 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 09:13:38,438 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 86 flow [2023-08-04 09:13:38,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2023-08-04 09:13:38,439 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-08-04 09:13:38,439 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 86 flow [2023-08-04 09:13:38,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 09:13:38,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:38,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:13:38,455 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 09:13:38,644 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,SelfDestructingSolverStorable2 [2023-08-04 09:13:38,645 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:38,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:38,645 INFO L85 PathProgramCache]: Analyzing trace with hash 222439809, now seen corresponding path program 1 times [2023-08-04 09:13:38,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:38,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100316981] [2023-08-04 09:13:38,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:38,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:38,749 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 09:13:38,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:38,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100316981] [2023-08-04 09:13:38,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100316981] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:13:38,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295727483] [2023-08-04 09:13:38,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:38,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:13:38,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:13:38,755 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 09:13:38,757 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 09:13:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:38,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:13:38,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:13:38,810 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 09:13:38,811 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:13:38,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295727483] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:38,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:13:38,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 09:13:38,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012355559] [2023-08-04 09:13:38,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:38,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:13:38,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:38,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:13:38,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:13:38,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 208 [2023-08-04 09:13:38,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 09:13:38,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:38,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 208 [2023-08-04 09:13:38,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:38,871 INFO L124 PetriNetUnfolderBase]: 162/271 cut-off events. [2023-08-04 09:13:38,871 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-08-04 09:13:38,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 271 events. 162/271 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 848 event pairs, 69 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 343. Up to 228 conditions per place. [2023-08-04 09:13:38,872 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 25 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-08-04 09:13:38,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 154 flow [2023-08-04 09:13:38,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:13:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:13:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2023-08-04 09:13:38,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48878205128205127 [2023-08-04 09:13:38,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 305 transitions. [2023-08-04 09:13:38,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions. [2023-08-04 09:13:38,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:38,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions. [2023-08-04 09:13:38,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:13:38,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 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 09:13:38,883 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 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 09:13:38,883 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 86 flow. Second operand 3 states and 305 transitions. [2023-08-04 09:13:38,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 154 flow [2023-08-04 09:13:38,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:13:38,885 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 88 flow [2023-08-04 09:13:38,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2023-08-04 09:13:38,886 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-08-04 09:13:38,886 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 88 flow [2023-08-04 09:13:38,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 09:13:38,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:38,887 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] [2023-08-04 09:13:38,908 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 09:13:39,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:13:39,092 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:39,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:39,094 INFO L85 PathProgramCache]: Analyzing trace with hash -262512449, now seen corresponding path program 1 times [2023-08-04 09:13:39,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:39,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928116644] [2023-08-04 09:13:39,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:39,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:39,161 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 09:13:39,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:39,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928116644] [2023-08-04 09:13:39,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928116644] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:13:39,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901866428] [2023-08-04 09:13:39,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:39,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:13:39,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:13:39,163 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 09:13:39,165 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 09:13:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:39,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:13:39,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:13:39,234 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 09:13:39,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:13:39,254 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 09:13:39,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901866428] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:13:39,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:13:39,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 09:13:39,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096874144] [2023-08-04 09:13:39,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:13:39,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:13:39,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:39,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:13:39,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:13:39,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 208 [2023-08-04 09:13:39,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 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 09:13:39,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:39,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 208 [2023-08-04 09:13:39,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:39,293 INFO L124 PetriNetUnfolderBase]: 8/19 cut-off events. [2023-08-04 09:13:39,294 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 09:13:39,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 19 events. 8/19 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 28 event pairs, 1 based on Foata normal form. 3/17 useless extension candidates. Maximal degree in co-relation 40. Up to 13 conditions per place. [2023-08-04 09:13:39,294 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 0 selfloop transitions, 0 changer transitions 10/10 dead transitions. [2023-08-04 09:13:39,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 10 transitions, 42 flow [2023-08-04 09:13:39,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:13:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:13:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 374 transitions. [2023-08-04 09:13:39,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4495192307692308 [2023-08-04 09:13:39,295 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 374 transitions. [2023-08-04 09:13:39,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 374 transitions. [2023-08-04 09:13:39,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:39,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 374 transitions. [2023-08-04 09:13:39,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 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 09:13:39,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 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 09:13:39,298 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 0 states have call successors, (0), 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 09:13:39,298 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 88 flow. Second operand 4 states and 374 transitions. [2023-08-04 09:13:39,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 10 transitions, 42 flow [2023-08-04 09:13:39,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 10 transitions, 40 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:13:39,298 INFO L231 Difference]: Finished difference. Result has 16 places, 0 transitions, 0 flow [2023-08-04 09:13:39,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=16, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=16, PETRI_TRANSITIONS=0} [2023-08-04 09:13:39,299 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -13 predicate places. [2023-08-04 09:13:39,299 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 0 transitions, 0 flow [2023-08-04 09:13:39,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 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 09:13:39,301 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 09:13:39,315 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 09:13:39,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:13:39,506 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 09:13:39,508 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 09:13:39,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 112 transitions, 246 flow [2023-08-04 09:13:39,523 INFO L124 PetriNetUnfolderBase]: 33/252 cut-off events. [2023-08-04 09:13:39,524 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:13:39,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 252 events. 33/252 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 849 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 137. Up to 8 conditions per place. [2023-08-04 09:13:39,524 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 112 transitions, 246 flow [2023-08-04 09:13:39,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 112 transitions, 246 flow [2023-08-04 09:13:39,525 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:13:39,525 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 112 transitions, 246 flow [2023-08-04 09:13:39,526 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 112 transitions, 246 flow [2023-08-04 09:13:39,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 112 transitions, 246 flow [2023-08-04 09:13:39,538 INFO L124 PetriNetUnfolderBase]: 33/252 cut-off events. [2023-08-04 09:13:39,538 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:13:39,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 252 events. 33/252 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 849 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 137. Up to 8 conditions per place. [2023-08-04 09:13:39,540 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2023-08-04 09:13:40,909 INFO L134 LiptonReduction]: Checked pairs total: 2967 [2023-08-04 09:13:40,909 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-04 09:13:40,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 09:13:40,911 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;@1f031a7f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:13:40,911 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 09:13:40,913 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:13:40,913 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2023-08-04 09:13:40,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:13:40,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:40,913 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 09:13:40,913 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 09:13:40,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:40,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1189265935, now seen corresponding path program 1 times [2023-08-04 09:13:40,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:40,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991782978] [2023-08-04 09:13:40,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:40,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 09:13:40,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 09:13:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 09:13:40,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 09:13:40,979 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 09:13:40,980 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 09:13:40,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 09:13:40,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 09:13:40,983 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 09:13:40,983 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 09:13:40,984 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 09:13:40,984 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 09:13:40,998 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 09:13:41,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 138 transitions, 324 flow [2023-08-04 09:13:41,054 INFO L124 PetriNetUnfolderBase]: 134/827 cut-off events. [2023-08-04 09:13:41,054 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 09:13:41,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 827 events. 134/827 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4248 event pairs, 1 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 488. Up to 32 conditions per place. [2023-08-04 09:13:41,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 138 transitions, 324 flow [2023-08-04 09:13:41,059 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 138 transitions, 324 flow [2023-08-04 09:13:41,059 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:13:41,060 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 138 transitions, 324 flow [2023-08-04 09:13:41,060 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 138 transitions, 324 flow [2023-08-04 09:13:41,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 138 transitions, 324 flow [2023-08-04 09:13:41,105 INFO L124 PetriNetUnfolderBase]: 134/827 cut-off events. [2023-08-04 09:13:41,105 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 09:13:41,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 827 events. 134/827 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4248 event pairs, 1 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 488. Up to 32 conditions per place. [2023-08-04 09:13:41,117 INFO L119 LiptonReduction]: Number of co-enabled transitions 6000 [2023-08-04 09:13:43,305 INFO L134 LiptonReduction]: Checked pairs total: 8803 [2023-08-04 09:13:43,306 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-04 09:13:43,307 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 09:13:43,308 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;@1f031a7f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:13:43,308 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 09:13:43,309 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:13:43,309 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-08-04 09:13:43,310 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:13:43,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:43,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 09:13:43,310 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:43,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:43,310 INFO L85 PathProgramCache]: Analyzing trace with hash 780897516, now seen corresponding path program 1 times [2023-08-04 09:13:43,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:43,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522498159] [2023-08-04 09:13:43,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:43,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:43,324 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 09:13:43,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:43,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522498159] [2023-08-04 09:13:43,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522498159] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:43,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:13:43,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 09:13:43,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398680965] [2023-08-04 09:13:43,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:43,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:13:43,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:43,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:13:43,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:13:43,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-08-04 09:13:43,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:13:43,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:43,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-08-04 09:13:43,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:43,927 INFO L124 PetriNetUnfolderBase]: 8526/11037 cut-off events. [2023-08-04 09:13:43,927 INFO L125 PetriNetUnfolderBase]: For 1040/1040 co-relation queries the response was YES. [2023-08-04 09:13:43,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22380 conditions, 11037 events. 8526/11037 cut-off events. For 1040/1040 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 47512 event pairs, 3472 based on Foata normal form. 0/6248 useless extension candidates. Maximal degree in co-relation 6836. Up to 10600 conditions per place. [2023-08-04 09:13:43,977 INFO L140 encePairwiseOnDemand]: 247/251 looper letters, 35 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-08-04 09:13:43,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 216 flow [2023-08-04 09:13:43,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:13:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:13:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-08-04 09:13:43,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4860557768924303 [2023-08-04 09:13:43,978 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-08-04 09:13:43,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-08-04 09:13:43,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:43,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-08-04 09:13:43,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 09:13:43,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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 09:13:43,981 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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 09:13:43,981 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 136 flow. Second operand 3 states and 366 transitions. [2023-08-04 09:13:43,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 216 flow [2023-08-04 09:13:43,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 09:13:43,985 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 134 flow [2023-08-04 09:13:43,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2023-08-04 09:13:43,986 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-04 09:13:43,986 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 134 flow [2023-08-04 09:13:43,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:13:43,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:43,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:13:43,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 09:13:43,988 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:43,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:43,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1058721358, now seen corresponding path program 1 times [2023-08-04 09:13:43,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:43,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024158624] [2023-08-04 09:13:43,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:43,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:44,022 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 09:13:44,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:44,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024158624] [2023-08-04 09:13:44,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024158624] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:13:44,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235241965] [2023-08-04 09:13:44,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:44,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:13:44,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:13:44,045 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 09:13:44,079 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 09:13:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:44,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:13:44,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:13:44,126 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 09:13:44,126 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:13:44,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235241965] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:44,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:13:44,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 09:13:44,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565460923] [2023-08-04 09:13:44,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:44,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:13:44,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:44,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:13:44,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:13:44,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-08-04 09:13:44,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 09:13:44,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:44,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-08-04 09:13:44,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:44,668 INFO L124 PetriNetUnfolderBase]: 8488/11014 cut-off events. [2023-08-04 09:13:44,668 INFO L125 PetriNetUnfolderBase]: For 859/859 co-relation queries the response was YES. [2023-08-04 09:13:44,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22260 conditions, 11014 events. 8488/11014 cut-off events. For 859/859 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 49290 event pairs, 3438 based on Foata normal form. 0/6262 useless extension candidates. Maximal degree in co-relation 22230. Up to 10389 conditions per place. [2023-08-04 09:13:44,717 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 40 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-04 09:13:44,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 234 flow [2023-08-04 09:13:44,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:13:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:13:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-04 09:13:44,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4900398406374502 [2023-08-04 09:13:44,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-04 09:13:44,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-04 09:13:44,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:44,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-04 09:13:44,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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 09:13:44,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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 09:13:44,721 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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 09:13:44,721 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 134 flow. Second operand 3 states and 369 transitions. [2023-08-04 09:13:44,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 234 flow [2023-08-04 09:13:44,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 09:13:44,725 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 138 flow [2023-08-04 09:13:44,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2023-08-04 09:13:44,726 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-04 09:13:44,728 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 138 flow [2023-08-04 09:13:44,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 09:13:44,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:44,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:13:44,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 09:13:44,933 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 09:13:44,933 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:44,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:44,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2015690909, now seen corresponding path program 1 times [2023-08-04 09:13:44,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:44,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046617420] [2023-08-04 09:13:44,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:44,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:44,968 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 09:13:44,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046617420] [2023-08-04 09:13:44,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046617420] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:13:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670500730] [2023-08-04 09:13:44,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:44,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:13:44,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:13:44,989 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 09:13:45,007 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 09:13:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:45,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:13:45,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:13:45,068 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 09:13:45,069 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:13:45,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670500730] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:45,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:13:45,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 09:13:45,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142644746] [2023-08-04 09:13:45,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:45,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:13:45,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:45,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:13:45,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:13:45,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-08-04 09:13:45,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 09:13:45,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:45,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-08-04 09:13:45,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:45,507 INFO L124 PetriNetUnfolderBase]: 7283/9572 cut-off events. [2023-08-04 09:13:45,507 INFO L125 PetriNetUnfolderBase]: For 617/617 co-relation queries the response was YES. [2023-08-04 09:13:45,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19645 conditions, 9572 events. 7283/9572 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 43106 event pairs, 2490 based on Foata normal form. 0/5673 useless extension candidates. Maximal degree in co-relation 6727. Up to 6828 conditions per place. [2023-08-04 09:13:45,549 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 47 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-04 09:13:45,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 274 flow [2023-08-04 09:13:45,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:13:45,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:13:45,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-04 09:13:45,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49800796812749004 [2023-08-04 09:13:45,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-04 09:13:45,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-04 09:13:45,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:45,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-04 09:13:45,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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 09:13:45,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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 09:13:45,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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 09:13:45,552 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 138 flow. Second operand 3 states and 375 transitions. [2023-08-04 09:13:45,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 274 flow [2023-08-04 09:13:45,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:13:45,555 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 148 flow [2023-08-04 09:13:45,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2023-08-04 09:13:45,557 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-04 09:13:45,557 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 148 flow [2023-08-04 09:13:45,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 09:13:45,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:45,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:13:45,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-04 09:13:45,762 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 09:13:45,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:45,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:45,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1853720145, now seen corresponding path program 1 times [2023-08-04 09:13:45,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:45,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365030890] [2023-08-04 09:13:45,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:45,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:45,810 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 09:13:45,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:45,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365030890] [2023-08-04 09:13:45,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365030890] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:13:45,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917217069] [2023-08-04 09:13:45,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:45,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:13:45,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:13:45,820 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 09:13:45,821 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 09:13:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:45,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:13:45,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:13:45,875 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 09:13:45,875 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:13:45,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917217069] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:45,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:13:45,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 09:13:45,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071637247] [2023-08-04 09:13:45,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:45,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:13:45,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:45,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:13:45,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:13:45,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-08-04 09:13:45,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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 09:13:45,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:45,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-08-04 09:13:45,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:46,367 INFO L124 PetriNetUnfolderBase]: 7160/9501 cut-off events. [2023-08-04 09:13:46,367 INFO L125 PetriNetUnfolderBase]: For 1501/1501 co-relation queries the response was YES. [2023-08-04 09:13:46,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20205 conditions, 9501 events. 7160/9501 cut-off events. For 1501/1501 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 42854 event pairs, 2789 based on Foata normal form. 0/5933 useless extension candidates. Maximal degree in co-relation 7255. Up to 7262 conditions per place. [2023-08-04 09:13:46,406 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 48 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-04 09:13:46,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 286 flow [2023-08-04 09:13:46,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:13:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:13:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-04 09:13:46,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49800796812749004 [2023-08-04 09:13:46,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-04 09:13:46,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-04 09:13:46,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:46,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-04 09:13:46,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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 09:13:46,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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 09:13:46,410 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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 09:13:46,410 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 148 flow. Second operand 3 states and 375 transitions. [2023-08-04 09:13:46,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 286 flow [2023-08-04 09:13:46,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:13:46,417 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 158 flow [2023-08-04 09:13:46,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2023-08-04 09:13:46,417 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-04 09:13:46,418 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 158 flow [2023-08-04 09:13:46,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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 09:13:46,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:46,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:13:46,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-04 09:13:46,637 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 09:13:46,638 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:46,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:46,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1801104293, now seen corresponding path program 1 times [2023-08-04 09:13:46,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:46,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987533749] [2023-08-04 09:13:46,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:46,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:46,678 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 09:13:46,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:46,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987533749] [2023-08-04 09:13:46,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987533749] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:13:46,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336808808] [2023-08-04 09:13:46,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:46,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:13:46,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:13:46,701 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 09:13:46,751 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 09:13:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:46,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:13:46,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:13:46,827 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 09:13:46,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:13:46,841 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 09:13:46,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336808808] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:13:46,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:13:46,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-04 09:13:46,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483381189] [2023-08-04 09:13:46,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:13:46,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 09:13:46,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:46,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 09:13:46,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 09:13:46,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-08-04 09:13:46,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 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 09:13:46,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:46,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-08-04 09:13:46,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:47,366 INFO L124 PetriNetUnfolderBase]: 6453/8554 cut-off events. [2023-08-04 09:13:47,366 INFO L125 PetriNetUnfolderBase]: For 1161/1161 co-relation queries the response was YES. [2023-08-04 09:13:47,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18389 conditions, 8554 events. 6453/8554 cut-off events. For 1161/1161 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 38242 event pairs, 1919 based on Foata normal form. 3/5405 useless extension candidates. Maximal degree in co-relation 12362. Up to 8125 conditions per place. [2023-08-04 09:13:47,405 INFO L140 encePairwiseOnDemand]: 247/251 looper letters, 41 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2023-08-04 09:13:47,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 264 flow [2023-08-04 09:13:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:13:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:13:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-08-04 09:13:47,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47310756972111556 [2023-08-04 09:13:47,407 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-08-04 09:13:47,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-08-04 09:13:47,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:47,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-08-04 09:13:47,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 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 09:13:47,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 09:13:47,410 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 09:13:47,410 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 158 flow. Second operand 4 states and 475 transitions. [2023-08-04 09:13:47,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 264 flow [2023-08-04 09:13:47,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:13:47,436 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 170 flow [2023-08-04 09:13:47,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2023-08-04 09:13:47,437 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-04 09:13:47,437 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 170 flow [2023-08-04 09:13:47,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 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 09:13:47,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:47,437 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] [2023-08-04 09:13:47,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 09:13:47,642 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 09:13:47,643 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:47,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:47,643 INFO L85 PathProgramCache]: Analyzing trace with hash 843839270, now seen corresponding path program 1 times [2023-08-04 09:13:47,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:47,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255431163] [2023-08-04 09:13:47,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:47,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:47,673 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 09:13:47,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:47,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255431163] [2023-08-04 09:13:47,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255431163] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:13:47,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178139646] [2023-08-04 09:13:47,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:47,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:13:47,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:13:47,674 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 09:13:47,676 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 09:13:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:47,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:13:47,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:13:47,732 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 09:13:47,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:13:47,743 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 09:13:47,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178139646] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:13:47,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:13:47,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:13:47,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616655049] [2023-08-04 09:13:47,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:13:47,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:13:47,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:47,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:13:47,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:13:47,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-08-04 09:13:47,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 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 09:13:47,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:47,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-08-04 09:13:47,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:48,147 INFO L124 PetriNetUnfolderBase]: 6114/8098 cut-off events. [2023-08-04 09:13:48,147 INFO L125 PetriNetUnfolderBase]: For 795/795 co-relation queries the response was YES. [2023-08-04 09:13:48,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17359 conditions, 8098 events. 6114/8098 cut-off events. For 795/795 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 36593 event pairs, 1699 based on Foata normal form. 27/5129 useless extension candidates. Maximal degree in co-relation 11398. Up to 6552 conditions per place. [2023-08-04 09:13:48,174 INFO L140 encePairwiseOnDemand]: 247/251 looper letters, 49 selfloop transitions, 3 changer transitions 1/61 dead transitions. [2023-08-04 09:13:48,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 308 flow [2023-08-04 09:13:48,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:13:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:13:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-08-04 09:13:48,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810756972111554 [2023-08-04 09:13:48,176 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-08-04 09:13:48,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-08-04 09:13:48,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:48,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-08-04 09:13:48,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 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 09:13:48,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 09:13:48,178 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 09:13:48,178 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 170 flow. Second operand 4 states and 483 transitions. [2023-08-04 09:13:48,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 308 flow [2023-08-04 09:13:48,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 299 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 09:13:48,187 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 175 flow [2023-08-04 09:13:48,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2023-08-04 09:13:48,188 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2023-08-04 09:13:48,188 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 175 flow [2023-08-04 09:13:48,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 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 09:13:48,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:48,189 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] [2023-08-04 09:13:48,195 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 09:13:48,393 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 09:13:48,394 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:48,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:48,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2066118682, now seen corresponding path program 1 times [2023-08-04 09:13:48,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:48,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277079410] [2023-08-04 09:13:48,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:48,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:48,431 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 09:13:48,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:48,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277079410] [2023-08-04 09:13:48,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277079410] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:13:48,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499586263] [2023-08-04 09:13:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:48,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:13:48,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:13:48,437 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 09:13:48,438 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 09:13:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:48,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:13:48,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:13:48,509 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 09:13:48,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:13:48,526 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 09:13:48,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499586263] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:13:48,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:13:48,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:13:48,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112330085] [2023-08-04 09:13:48,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:13:48,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:13:48,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:48,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:13:48,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:13:48,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-08-04 09:13:48,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 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 09:13:48,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:48,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-08-04 09:13:48,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:48,838 INFO L124 PetriNetUnfolderBase]: 4136/5529 cut-off events. [2023-08-04 09:13:48,838 INFO L125 PetriNetUnfolderBase]: For 1273/1273 co-relation queries the response was YES. [2023-08-04 09:13:48,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11980 conditions, 5529 events. 4136/5529 cut-off events. For 1273/1273 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 22813 event pairs, 747 based on Foata normal form. 108/3585 useless extension candidates. Maximal degree in co-relation 10556. Up to 2080 conditions per place. [2023-08-04 09:13:48,854 INFO L140 encePairwiseOnDemand]: 247/251 looper letters, 55 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-04 09:13:48,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 67 transitions, 346 flow [2023-08-04 09:13:48,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:13:48,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:13:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-04 09:13:48,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48705179282868527 [2023-08-04 09:13:48,856 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-04 09:13:48,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-04 09:13:48,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:48,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-04 09:13:48,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 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 09:13:48,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 09:13:48,858 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 09:13:48,858 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 175 flow. Second operand 4 states and 489 transitions. [2023-08-04 09:13:48,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 67 transitions, 346 flow [2023-08-04 09:13:48,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 336 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 09:13:48,866 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 186 flow [2023-08-04 09:13:48,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-08-04 09:13:48,867 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-04 09:13:48,867 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 186 flow [2023-08-04 09:13:48,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 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 09:13:48,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:48,868 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] [2023-08-04 09:13:48,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-04 09:13:49,084 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 09:13:49,085 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:49,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:49,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1165661919, now seen corresponding path program 1 times [2023-08-04 09:13:49,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:49,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011445679] [2023-08-04 09:13:49,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:49,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:49,145 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 09:13:49,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:49,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011445679] [2023-08-04 09:13:49,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011445679] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:13:49,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107309132] [2023-08-04 09:13:49,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:49,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:13:49,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:13:49,153 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 09:13:49,155 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 09:13:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:49,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:13:49,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:13:49,220 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 09:13:49,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:13:49,234 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 09:13:49,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107309132] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:13:49,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:13:49,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 09:13:49,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872392111] [2023-08-04 09:13:49,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:13:49,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:13:49,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:49,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:13:49,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:13:49,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-08-04 09:13:49,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 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 09:13:49,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:49,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-08-04 09:13:49,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:49,582 INFO L124 PetriNetUnfolderBase]: 4120/5502 cut-off events. [2023-08-04 09:13:49,582 INFO L125 PetriNetUnfolderBase]: For 2154/2154 co-relation queries the response was YES. [2023-08-04 09:13:49,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12516 conditions, 5502 events. 4120/5502 cut-off events. For 2154/2154 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 22545 event pairs, 1861 based on Foata normal form. 13/3471 useless extension candidates. Maximal degree in co-relation 11102. Up to 4661 conditions per place. [2023-08-04 09:13:49,609 INFO L140 encePairwiseOnDemand]: 247/251 looper letters, 55 selfloop transitions, 3 changer transitions 2/68 dead transitions. [2023-08-04 09:13:49,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 358 flow [2023-08-04 09:13:49,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:13:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:13:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-04 09:13:49,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48705179282868527 [2023-08-04 09:13:49,612 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-04 09:13:49,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-04 09:13:49,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:49,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-04 09:13:49,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 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 09:13:49,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 09:13:49,615 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 09:13:49,615 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 186 flow. Second operand 4 states and 489 transitions. [2023-08-04 09:13:49,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 358 flow [2023-08-04 09:13:49,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 354 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 09:13:49,626 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 190 flow [2023-08-04 09:13:49,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-08-04 09:13:49,627 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-04 09:13:49,627 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 190 flow [2023-08-04 09:13:49,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 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 09:13:49,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:49,627 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] [2023-08-04 09:13:49,633 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 09:13:49,833 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,SelfDestructingSolverStorable13 [2023-08-04 09:13:49,833 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:49,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:49,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1705052316, now seen corresponding path program 1 times [2023-08-04 09:13:49,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:49,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077166881] [2023-08-04 09:13:49,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:49,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:50,085 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 09:13:50,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:50,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077166881] [2023-08-04 09:13:50,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077166881] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:50,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:13:50,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 09:13:50,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32003385] [2023-08-04 09:13:50,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:50,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:13:50,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:50,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:13:50,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:13:50,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251 [2023-08-04 09:13:50,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 09:13:50,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:50,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251 [2023-08-04 09:13:50,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:50,374 INFO L124 PetriNetUnfolderBase]: 4362/5806 cut-off events. [2023-08-04 09:13:50,374 INFO L125 PetriNetUnfolderBase]: For 3149/3149 co-relation queries the response was YES. [2023-08-04 09:13:50,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13540 conditions, 5806 events. 4362/5806 cut-off events. For 3149/3149 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 24250 event pairs, 733 based on Foata normal form. 1/3745 useless extension candidates. Maximal degree in co-relation 13262. Up to 4855 conditions per place. [2023-08-04 09:13:50,392 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 65 selfloop transitions, 3 changer transitions 1/77 dead transitions. [2023-08-04 09:13:50,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 77 transitions, 482 flow [2023-08-04 09:13:50,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:13:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:13:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-08-04 09:13:50,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5232403718459495 [2023-08-04 09:13:50,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-08-04 09:13:50,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-08-04 09:13:50,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:50,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-08-04 09:13:50,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 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 09:13:50,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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 09:13:50,396 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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 09:13:50,396 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 190 flow. Second operand 3 states and 394 transitions. [2023-08-04 09:13:50,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 77 transitions, 482 flow [2023-08-04 09:13:50,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 466 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 09:13:50,403 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 205 flow [2023-08-04 09:13:50,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-08-04 09:13:50,404 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-04 09:13:50,405 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 205 flow [2023-08-04 09:13:50,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 09:13:50,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:50,405 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 09:13:50,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 09:13:50,405 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:50,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:50,406 INFO L85 PathProgramCache]: Analyzing trace with hash 639523454, now seen corresponding path program 1 times [2023-08-04 09:13:50,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:50,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549393674] [2023-08-04 09:13:50,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:50,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 09:13:50,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:50,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549393674] [2023-08-04 09:13:50,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549393674] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:50,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:13:50,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:13:50,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295131659] [2023-08-04 09:13:50,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:50,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:13:50,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:50,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:13:50,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:13:50,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 251 [2023-08-04 09:13:50,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 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 09:13:50,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:50,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 251 [2023-08-04 09:13:50,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:51,179 INFO L124 PetriNetUnfolderBase]: 6015/8745 cut-off events. [2023-08-04 09:13:51,180 INFO L125 PetriNetUnfolderBase]: For 5958/5958 co-relation queries the response was YES. [2023-08-04 09:13:51,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22798 conditions, 8745 events. 6015/8745 cut-off events. For 5958/5958 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 46981 event pairs, 1856 based on Foata normal form. 619/9364 useless extension candidates. Maximal degree in co-relation 22303. Up to 4599 conditions per place. [2023-08-04 09:13:51,211 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 94 selfloop transitions, 4 changer transitions 27/131 dead transitions. [2023-08-04 09:13:51,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 131 transitions, 854 flow [2023-08-04 09:13:51,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:13:51,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:13:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2023-08-04 09:13:51,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49721115537848604 [2023-08-04 09:13:51,214 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2023-08-04 09:13:51,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2023-08-04 09:13:51,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:51,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2023-08-04 09:13:51,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 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 09:13:51,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 09:13:51,217 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 09:13:51,217 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 205 flow. Second operand 5 states and 624 transitions. [2023-08-04 09:13:51,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 131 transitions, 854 flow [2023-08-04 09:13:51,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 131 transitions, 850 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:13:51,238 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 237 flow [2023-08-04 09:13:51,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2023-08-04 09:13:51,239 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-08-04 09:13:51,239 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 237 flow [2023-08-04 09:13:51,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 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 09:13:51,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:51,240 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 09:13:51,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 09:13:51,240 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:51,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:51,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1724217918, now seen corresponding path program 1 times [2023-08-04 09:13:51,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:51,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109752691] [2023-08-04 09:13:51,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:51,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 09:13:51,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:51,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109752691] [2023-08-04 09:13:51,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109752691] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:51,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:13:51,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 09:13:51,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030445999] [2023-08-04 09:13:51,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:51,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 09:13:51,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:51,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 09:13:51,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 09:13:51,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 251 [2023-08-04 09:13:51,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 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 09:13:51,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:51,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 251 [2023-08-04 09:13:51,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:51,453 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 70#L41-4true, 79#L51-4true, 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1036#true, Black: 419#true, Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), 7#L71-6true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,453 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-04 09:13:51,453 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-04 09:13:51,454 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 09:13:51,454 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 09:13:51,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 24#thread1EXITtrue, Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1036#true, Black: 419#true, Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 7#L71-6true, Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,481 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-04 09:13:51,481 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 09:13:51,481 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 09:13:51,481 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 09:13:51,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 70#L41-4true, 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1036#true, 51#L71-11true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,512 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-04 09:13:51,512 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 09:13:51,512 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 09:13:51,512 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 09:13:51,542 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 24#thread1EXITtrue, Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1036#true, 51#L71-11true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,542 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-04 09:13:51,542 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 09:13:51,542 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 09:13:51,542 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 09:13:51,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, 33#L72-8true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 70#L41-4true, 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1036#true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,543 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-04 09:13:51,543 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 09:13:51,543 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 09:13:51,543 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 09:13:51,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 24#thread1EXITtrue, Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, 33#L72-8true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1036#true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,573 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 09:13:51,573 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 09:13:51,573 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 09:13:51,573 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 09:13:51,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 41#L72-3true, 79#L51-4true, 70#L41-4true, 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1036#true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,574 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 09:13:51,574 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 09:13:51,574 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 09:13:51,574 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 09:13:51,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 24#thread1EXITtrue, Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 41#L72-3true, 79#L51-4true, 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1036#true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,603 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 09:13:51,603 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:51,603 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 09:13:51,603 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:51,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 84#$Ultimate##0true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1036#true, 112#L72-4true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,603 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 09:13:51,603 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 09:13:51,603 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:51,603 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:51,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1036#true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 112#L72-4true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,630 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 09:13:51,630 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:51,630 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:51,630 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:51,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1036#true, 112#L72-4true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,631 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 09:13:51,631 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:51,631 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:51,631 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:51,659 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1036#true, 112#L72-4true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 595#true, 13#thread2EXITtrue, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,659 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 09:13:51,659 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:51,659 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:51,659 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:51,659 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 33#L72-8true, Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 84#$Ultimate##0true, Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1036#true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,659 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 09:13:51,660 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:51,660 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:51,660 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:51,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 33#L72-8true, 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1036#true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,686 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 09:13:51,686 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:51,686 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:51,686 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:51,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 33#L72-8true, Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1036#true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,687 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 09:13:51,687 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:51,687 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:51,687 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:51,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 41#L72-3true, 84#$Ultimate##0true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1036#true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,688 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 09:13:51,688 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:51,688 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:51,688 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:51,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 33#L72-8true, 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1036#true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 595#true, 13#thread2EXITtrue, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,716 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 09:13:51,716 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:51,716 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:51,716 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:51,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 41#L72-3true, 79#L51-4true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1036#true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,716 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 09:13:51,716 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:51,716 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:51,717 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:51,717 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][56], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 41#L72-3true, 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1036#true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,717 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 09:13:51,717 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:51,717 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:51,717 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:51,740 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 41#L72-3true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1036#true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), 13#thread2EXITtrue, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, thread2Thread1of2ForFork0InUse]) [2023-08-04 09:13:51,740 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 09:13:51,740 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:51,740 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:51,740 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:51,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1036#true, 112#L72-4true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, thread2Thread1of2ForFork0NotInUse]) [2023-08-04 09:13:51,798 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 09:13:51,798 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 09:13:51,798 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:51,798 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 09:13:51,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 33#L72-8true, 83#L41-4true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1036#true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, thread2Thread1of2ForFork0NotInUse]) [2023-08-04 09:13:51,831 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-04 09:13:51,831 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 09:13:51,831 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:13:51,831 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:13:51,850 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 795#true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 10#L73-8true, 1036#true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), thread2Thread1of2ForFork0NotInUse, 19#L51-4true, 797#(= 0 |ULTIMATE.start_main_~asdf~3#1|)]) [2023-08-04 09:13:51,850 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 09:13:51,850 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 09:13:51,850 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 09:13:51,850 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:13:51,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][52], [Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 83#L41-4true, Black: 795#true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 117#L73-3true, Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 1036#true, Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 1044#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0)), thread1Thread1of2ForFork1InUse, Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, thread2Thread1of2ForFork0NotInUse, 797#(= 0 |ULTIMATE.start_main_~asdf~3#1|)]) [2023-08-04 09:13:51,863 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 09:13:51,863 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 09:13:51,863 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 09:13:51,863 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 09:13:51,880 INFO L124 PetriNetUnfolderBase]: 5971/8431 cut-off events. [2023-08-04 09:13:51,880 INFO L125 PetriNetUnfolderBase]: For 10794/11708 co-relation queries the response was YES. [2023-08-04 09:13:51,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26446 conditions, 8431 events. 5971/8431 cut-off events. For 10794/11708 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 43589 event pairs, 1130 based on Foata normal form. 968/9175 useless extension candidates. Maximal degree in co-relation 25988. Up to 5362 conditions per place. [2023-08-04 09:13:51,910 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 90 selfloop transitions, 4 changer transitions 5/106 dead transitions. [2023-08-04 09:13:51,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 106 transitions, 713 flow [2023-08-04 09:13:51,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:13:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:13:51,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-08-04 09:13:51,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-04 09:13:51,912 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-08-04 09:13:51,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-08-04 09:13:51,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:51,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-08-04 09:13:51,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 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 09:13:51,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 09:13:51,914 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 09:13:51,914 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 237 flow. Second operand 4 states and 502 transitions. [2023-08-04 09:13:51,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 106 transitions, 713 flow [2023-08-04 09:13:51,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 106 transitions, 701 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-04 09:13:51,926 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 256 flow [2023-08-04 09:13:51,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=256, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2023-08-04 09:13:51,927 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2023-08-04 09:13:51,927 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 256 flow [2023-08-04 09:13:51,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 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 09:13:51,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:51,927 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 09:13:51,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-04 09:13:51,927 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:51,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:51,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1389556888, now seen corresponding path program 1 times [2023-08-04 09:13:51,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:51,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720459185] [2023-08-04 09:13:51,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:51,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 09:13:52,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:52,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720459185] [2023-08-04 09:13:52,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720459185] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:52,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:13:52,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:13:52,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404079823] [2023-08-04 09:13:52,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:52,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:13:52,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:52,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:13:52,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:13:52,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 251 [2023-08-04 09:13:52,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 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 09:13:52,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:52,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 251 [2023-08-04 09:13:52,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:52,830 INFO L124 PetriNetUnfolderBase]: 8284/12466 cut-off events. [2023-08-04 09:13:52,830 INFO L125 PetriNetUnfolderBase]: For 21818/22849 co-relation queries the response was YES. [2023-08-04 09:13:52,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39501 conditions, 12466 events. 8284/12466 cut-off events. For 21818/22849 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 76662 event pairs, 2477 based on Foata normal form. 2089/14537 useless extension candidates. Maximal degree in co-relation 38631. Up to 5530 conditions per place. [2023-08-04 09:13:52,895 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 119 selfloop transitions, 6 changer transitions 1/132 dead transitions. [2023-08-04 09:13:52,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 132 transitions, 909 flow [2023-08-04 09:13:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:13:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:13:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2023-08-04 09:13:52,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49243027888446217 [2023-08-04 09:13:52,897 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 618 transitions. [2023-08-04 09:13:52,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 618 transitions. [2023-08-04 09:13:52,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:52,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 618 transitions. [2023-08-04 09:13:52,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 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 09:13:52,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 09:13:52,901 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 09:13:52,901 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 256 flow. Second operand 5 states and 618 transitions. [2023-08-04 09:13:52,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 132 transitions, 909 flow [2023-08-04 09:13:52,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 132 transitions, 903 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 09:13:52,947 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 316 flow [2023-08-04 09:13:52,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2023-08-04 09:13:52,947 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2023-08-04 09:13:52,947 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 316 flow [2023-08-04 09:13:52,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 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 09:13:52,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:52,948 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 09:13:52,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-04 09:13:52,948 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:52,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash -527999901, now seen corresponding path program 1 times [2023-08-04 09:13:52,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:52,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221388014] [2023-08-04 09:13:52,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:52,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:13:53,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:53,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221388014] [2023-08-04 09:13:53,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221388014] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:53,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:13:53,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:13:53,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287320144] [2023-08-04 09:13:53,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:53,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:13:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:53,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:13:53,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:13:53,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 251 [2023-08-04 09:13:53,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 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 09:13:53,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:53,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 251 [2023-08-04 09:13:53,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:54,163 INFO L124 PetriNetUnfolderBase]: 10695/16642 cut-off events. [2023-08-04 09:13:54,163 INFO L125 PetriNetUnfolderBase]: For 56366/58439 co-relation queries the response was YES. [2023-08-04 09:13:54,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59679 conditions, 16642 events. 10695/16642 cut-off events. For 56366/58439 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 110320 event pairs, 4513 based on Foata normal form. 2713/19276 useless extension candidates. Maximal degree in co-relation 58359. Up to 9466 conditions per place. [2023-08-04 09:13:54,381 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 103 selfloop transitions, 5 changer transitions 35/150 dead transitions. [2023-08-04 09:13:54,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 150 transitions, 1132 flow [2023-08-04 09:13:54,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:13:54,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:13:54,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 628 transitions. [2023-08-04 09:13:54,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500398406374502 [2023-08-04 09:13:54,383 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 628 transitions. [2023-08-04 09:13:54,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 628 transitions. [2023-08-04 09:13:54,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:54,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 628 transitions. [2023-08-04 09:13:54,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 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 09:13:54,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 09:13:54,386 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 09:13:54,386 INFO L175 Difference]: Start difference. First operand has 71 places, 54 transitions, 316 flow. Second operand 5 states and 628 transitions. [2023-08-04 09:13:54,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 150 transitions, 1132 flow [2023-08-04 09:13:54,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 150 transitions, 1112 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-08-04 09:13:54,482 INFO L231 Difference]: Finished difference. Result has 77 places, 56 transitions, 354 flow [2023-08-04 09:13:54,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=354, PETRI_PLACES=77, PETRI_TRANSITIONS=56} [2023-08-04 09:13:54,483 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 36 predicate places. [2023-08-04 09:13:54,483 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 56 transitions, 354 flow [2023-08-04 09:13:54,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 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 09:13:54,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:54,483 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 09:13:54,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-04 09:13:54,484 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:54,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:54,484 INFO L85 PathProgramCache]: Analyzing trace with hash -204734369, now seen corresponding path program 1 times [2023-08-04 09:13:54,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:54,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063557801] [2023-08-04 09:13:54,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:54,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:13:54,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:54,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063557801] [2023-08-04 09:13:54,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063557801] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:54,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:13:54,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 09:13:54,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522113468] [2023-08-04 09:13:54,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:54,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 09:13:54,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:54,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 09:13:54,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 09:13:54,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 251 [2023-08-04 09:13:54,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 56 transitions, 354 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 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 09:13:54,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:54,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 251 [2023-08-04 09:13:54,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:54,978 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 84#$Ultimate##0true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, 41#L72-3true, 70#L41-4true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:54,978 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-04 09:13:54,978 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 09:13:54,979 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 09:13:54,979 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 09:13:55,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [24#thread1EXITtrue, Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 84#$Ultimate##0true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, 41#L72-3true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,059 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 09:13:55,059 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 09:13:55,059 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 09:13:55,059 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 09:13:55,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][64], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 1091#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 41#L72-3true, 70#L41-4true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 1075#(= thread1Thread1of2ForFork1_~i~0 0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,064 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 09:13:55,064 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 09:13:55,064 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 09:13:55,064 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 09:13:55,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 70#L41-4true, 41#L72-3true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,135 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,135 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 09:13:55,135 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,135 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 09:13:55,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][64], [24#thread1EXITtrue, Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1091#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 41#L72-3true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 1075#(= thread1Thread1of2ForFork1_~i~0 0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,142 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,142 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,142 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 09:13:55,142 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 09:13:55,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 84#$Ultimate##0true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 112#L72-4true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,143 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,143 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 09:13:55,143 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 09:13:55,143 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, 41#L72-3true, 70#L41-4true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,145 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,145 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 09:13:55,145 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 09:13:55,145 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 61#thread1EXITtrue, Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 41#L72-3true, 70#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,187 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,187 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,187 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,187 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 70#L41-4true, 41#L72-3true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,204 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,204 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,204 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,204 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,210 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [24#thread1EXITtrue, Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, 41#L72-3true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,210 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,210 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,210 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,210 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][64], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 1091#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 112#L72-4true, thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,212 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,212 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,212 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,212 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 41#L72-3true, 1088#true, 70#L41-4true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,214 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,214 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,214 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,214 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 09:13:55,260 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 61#thread1EXITtrue, Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 70#L41-4true, 41#L72-3true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,260 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,260 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,260 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,260 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,262 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 70#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 112#L72-4true, 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1NotInUse, thread2Thread1of2ForFork0InUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,262 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,262 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,262 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,262 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 70#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1073#true, 112#L72-4true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0NotInUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,280 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,280 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,280 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,280 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,284 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [24#thread1EXITtrue, Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 41#L72-3true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,284 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,284 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,284 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,284 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,285 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 112#L72-4true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,286 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,286 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,286 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,286 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 33#L72-8true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 84#$Ultimate##0true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,288 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,288 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,288 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,288 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, 70#L41-4true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 112#L72-4true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0NotInUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,289 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,289 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,290 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,290 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 09:13:55,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 70#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 112#L72-4true, 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1NotInUse, 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,464 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,464 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,464 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,464 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,465 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 61#thread1EXITtrue, Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 70#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 112#L72-4true, 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0NotInUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,465 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,465 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,465 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,465 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 112#L72-4true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,484 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,484 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,484 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,484 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [24#thread1EXITtrue, Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, 597#(= 0 |ULTIMATE.start_main_~asdf~2#1|), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 112#L72-4true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0NotInUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,484 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,484 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,484 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,484 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][64], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 33#L72-8true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 1091#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,487 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,487 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,487 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,487 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 84#$Ultimate##0true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, 41#L72-3true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,488 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,488 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,488 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 09:13:55,488 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), 33#L72-8true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 70#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0NotInUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,546 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,546 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,546 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,546 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][64], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 1091#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 41#L72-3true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,551 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,551 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,551 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,551 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,553 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [33#L72-8true, Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, 70#L41-4true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0NotInUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,553 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,553 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,553 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,553 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 09:13:55,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [33#L72-8true, Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 70#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1NotInUse, 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,593 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,593 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,593 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,593 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,593 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [33#L72-8true, Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 61#thread1EXITtrue, Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 70#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0NotInUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,593 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,593 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,593 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,593 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,595 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1088#true, 70#L41-4true, 41#L72-3true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1NotInUse, 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork0InUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,595 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,595 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,596 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,596 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,608 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 70#L41-4true, 1088#true, 41#L72-3true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0NotInUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,608 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,608 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,608 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,608 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [33#L72-8true, Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,610 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,610 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,610 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,610 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [24#thread1EXITtrue, 33#L72-8true, Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0NotInUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,610 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,610 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,610 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,610 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,612 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 79#L51-4true, Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, 41#L72-3true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,612 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,612 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,612 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,612 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 41#L72-3true, 1088#true, 70#L41-4true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0NotInUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,614 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,614 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,614 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,614 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 09:13:55,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 70#L41-4true, 41#L72-3true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1NotInUse, 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,645 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 09:13:55,645 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 09:13:55,645 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,645 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 61#thread1EXITtrue, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 70#L41-4true, 1088#true, 41#L72-3true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0NotInUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,646 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 09:13:55,646 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,646 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 09:13:55,646 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 41#L72-3true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, 13#thread2EXITtrue, thread2Thread1of2ForFork0InUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,656 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 09:13:55,656 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 09:13:55,656 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,656 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,657 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [24#thread1EXITtrue, Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), Black: 595#true, 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, 41#L72-3true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0NotInUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,657 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 09:13:55,657 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,657 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 09:13:55,657 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 09:13:55,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 70#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1073#true, 112#L72-4true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1NotInUse, 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread2Thread1of2ForFork0NotInUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,686 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-04 09:13:55,686 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 09:13:55,686 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 09:13:55,686 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 09:13:55,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 595#true, Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 112#L72-4true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0NotInUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,694 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-04 09:13:55,694 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 09:13:55,694 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 09:13:55,694 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 09:13:55,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [33#L72-8true, Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 70#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1NotInUse, thread2Thread1of2ForFork0NotInUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,758 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 09:13:55,758 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:13:55,758 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:13:55,758 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 09:13:55,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [33#L72-8true, Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 265#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0NotInUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,767 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 09:13:55,767 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 09:13:55,767 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:13:55,767 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 09:13:55,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 795#true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, 797#(= 0 |ULTIMATE.start_main_~asdf~3#1|), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 1088#true, 70#L41-4true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 10#L73-8true, Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1NotInUse, thread2Thread1of2ForFork0NotInUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,792 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 09:13:55,793 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 09:13:55,793 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 09:13:55,793 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 09:13:55,799 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 795#true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, 797#(= 0 |ULTIMATE.start_main_~asdf~3#1|), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), 10#L73-8true, Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0NotInUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,799 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 09:13:55,799 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 09:13:55,799 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 09:13:55,799 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 09:13:55,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 795#true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, 797#(= 0 |ULTIMATE.start_main_~asdf~3#1|), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 70#L41-4true, 1088#true, 117#L73-3true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1073#true, 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1NotInUse, thread2Thread1of2ForFork0NotInUse, Black: 1075#(= thread1Thread1of2ForFork1_~i~0 0), Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,819 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 09:13:55,819 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 09:13:55,819 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 09:13:55,819 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 09:13:55,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L51-4-->L51-4: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_28| 4294967296) (mod v_~N~0_131 4294967296)) (= v_~counter~0_163 (+ v_~counter~0_162 v_~c~0_118)) (not (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|) (= (+ |v_thread2Thread2of2ForFork0_~i~1#1_28| 1) |v_thread2Thread2of2ForFork0_~i~1#1_27|) (= (ite (< 0 (mod v_~counter~0_163 4294967296)) 1 0) |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|)) InVars {~counter~0=v_~counter~0_163, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_28|, ~c~0=v_~c~0_118, ~N~0=v_~N~0_131} OutVars{thread2Thread2of2ForFork0_#t~post2#1=|v_thread2Thread2of2ForFork0_#t~post2#1_13|, ~counter~0=v_~counter~0_162, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_27|, ~c~0=v_~c~0_118, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_131, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_9|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_#t~post2#1, ~counter~0, thread2Thread2of2ForFork0_~i~1#1, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][65], [Black: 130#(<= |ULTIMATE.start_main_~asdf~0#1| 0), Black: 795#true, Black: 798#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1033#(and (<= 0 ~counter~0) (<= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 201#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 422#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 598#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1038#(= thread1Thread2of2ForFork1_~i~0 0), Black: 1042#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread2of2ForFork1_~i~0 0)), 19#L51-4true, 797#(= 0 |ULTIMATE.start_main_~asdf~3#1|), Black: 271#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 1054#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 155#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 83#L41-4true, 1088#true, 117#L73-3true, Black: 1064#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296)))), Black: 1066#(and (= |thread2Thread1of2ForFork0_~i~1#1| 0) (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 1060#(= |thread2Thread1of2ForFork0_~i~1#1| 0), 1075#(= thread1Thread1of2ForFork1_~i~0 0), 1053#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), thread1Thread1of2ForFork1InUse, thread2Thread1of2ForFork0NotInUse, Black: 1079#(and (<= 0 (+ (div (* (- 1) ~N~0) 4294967296) (div ~N~0 4294967296))) (= thread1Thread1of2ForFork1_~i~0 0)), Black: 1082#(and (= thread1Thread1of2ForFork1_~i~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread2of2ForFork1_~i~0 0))]) [2023-08-04 09:13:55,823 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 09:13:55,823 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 09:13:55,823 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 09:13:55,823 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 09:13:55,859 INFO L124 PetriNetUnfolderBase]: 11304/16395 cut-off events. [2023-08-04 09:13:55,859 INFO L125 PetriNetUnfolderBase]: For 83791/87009 co-relation queries the response was YES. [2023-08-04 09:13:55,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69518 conditions, 16395 events. 11304/16395 cut-off events. For 83791/87009 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 97061 event pairs, 3854 based on Foata normal form. 1724/17361 useless extension candidates. Maximal degree in co-relation 68647. Up to 8905 conditions per place. [2023-08-04 09:13:55,956 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 88 selfloop transitions, 12 changer transitions 9/116 dead transitions. [2023-08-04 09:13:55,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 116 transitions, 950 flow [2023-08-04 09:13:55,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:13:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:13:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 498 transitions. [2023-08-04 09:13:55,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960159362549801 [2023-08-04 09:13:55,957 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 498 transitions. [2023-08-04 09:13:55,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 498 transitions. [2023-08-04 09:13:55,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:55,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 498 transitions. [2023-08-04 09:13:55,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 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 09:13:55,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 09:13:55,961 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 09:13:55,961 INFO L175 Difference]: Start difference. First operand has 77 places, 56 transitions, 354 flow. Second operand 4 states and 498 transitions. [2023-08-04 09:13:55,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 116 transitions, 950 flow [2023-08-04 09:13:56,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 116 transitions, 905 flow, removed 19 selfloop flow, removed 2 redundant places. [2023-08-04 09:13:56,046 INFO L231 Difference]: Finished difference. Result has 78 places, 62 transitions, 446 flow [2023-08-04 09:13:56,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=446, PETRI_PLACES=78, PETRI_TRANSITIONS=62} [2023-08-04 09:13:56,047 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2023-08-04 09:13:56,047 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 62 transitions, 446 flow [2023-08-04 09:13:56,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 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 09:13:56,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:56,047 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] [2023-08-04 09:13:56,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-04 09:13:56,047 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:56,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:56,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1459846530, now seen corresponding path program 1 times [2023-08-04 09:13:56,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:56,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670600145] [2023-08-04 09:13:56,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:56,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:13:56,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:56,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670600145] [2023-08-04 09:13:56,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670600145] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:13:56,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711943568] [2023-08-04 09:13:56,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:56,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:13:56,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:13:56,150 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 09:13:56,151 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 09:13:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:56,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 09:13:56,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:13:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:13:56,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:13:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:13:56,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711943568] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-04 09:13:56,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-04 09:13:56,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2023-08-04 09:13:56,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976338103] [2023-08-04 09:13:56,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:56,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 09:13:56,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:56,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 09:13:56,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-04 09:13:56,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 251 [2023-08-04 09:13:56,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 62 transitions, 446 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 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 09:13:56,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:56,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 251 [2023-08-04 09:13:56,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:57,348 INFO L124 PetriNetUnfolderBase]: 11071/15598 cut-off events. [2023-08-04 09:13:57,348 INFO L125 PetriNetUnfolderBase]: For 94767/99945 co-relation queries the response was YES. [2023-08-04 09:13:57,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71933 conditions, 15598 events. 11071/15598 cut-off events. For 94767/99945 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 85952 event pairs, 2546 based on Foata normal form. 2818/17387 useless extension candidates. Maximal degree in co-relation 71300. Up to 11614 conditions per place. [2023-08-04 09:13:57,429 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 94 selfloop transitions, 7 changer transitions 13/122 dead transitions. [2023-08-04 09:13:57,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 122 transitions, 1071 flow [2023-08-04 09:13:57,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:13:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:13:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 497 transitions. [2023-08-04 09:13:57,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4950199203187251 [2023-08-04 09:13:57,431 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 497 transitions. [2023-08-04 09:13:57,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 497 transitions. [2023-08-04 09:13:57,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:57,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 497 transitions. [2023-08-04 09:13:57,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 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 09:13:57,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 09:13:57,433 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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 09:13:57,433 INFO L175 Difference]: Start difference. First operand has 78 places, 62 transitions, 446 flow. Second operand 4 states and 497 transitions. [2023-08-04 09:13:57,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 122 transitions, 1071 flow [2023-08-04 09:13:57,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 122 transitions, 1047 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-04 09:13:57,480 INFO L231 Difference]: Finished difference. Result has 78 places, 65 transitions, 487 flow [2023-08-04 09:13:57,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=487, PETRI_PLACES=78, PETRI_TRANSITIONS=65} [2023-08-04 09:13:57,480 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2023-08-04 09:13:57,480 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 487 flow [2023-08-04 09:13:57,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 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 09:13:57,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:57,481 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] [2023-08-04 09:13:57,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-04 09:13:57,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-04 09:13:57,685 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:57,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:57,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1441615175, now seen corresponding path program 1 times [2023-08-04 09:13:57,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:57,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949596059] [2023-08-04 09:13:57,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:57,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 09:13:57,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:57,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949596059] [2023-08-04 09:13:57,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949596059] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:57,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:13:57,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:13:57,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509532316] [2023-08-04 09:13:57,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:57,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:13:57,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:57,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:13:57,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:13:57,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 251 [2023-08-04 09:13:57,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 487 flow. Second operand has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 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 09:13:57,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:57,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 251 [2023-08-04 09:13:57,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:13:59,319 INFO L124 PetriNetUnfolderBase]: 12256/17884 cut-off events. [2023-08-04 09:13:59,320 INFO L125 PetriNetUnfolderBase]: For 105098/108146 co-relation queries the response was YES. [2023-08-04 09:13:59,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81741 conditions, 17884 events. 12256/17884 cut-off events. For 105098/108146 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 106319 event pairs, 4331 based on Foata normal form. 2539/19977 useless extension candidates. Maximal degree in co-relation 80963. Up to 11266 conditions per place. [2023-08-04 09:13:59,514 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 152 selfloop transitions, 18 changer transitions 15/192 dead transitions. [2023-08-04 09:13:59,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 192 transitions, 1743 flow [2023-08-04 09:13:59,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 09:13:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 09:13:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 736 transitions. [2023-08-04 09:13:59,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48871181938911024 [2023-08-04 09:13:59,523 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 736 transitions. [2023-08-04 09:13:59,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 736 transitions. [2023-08-04 09:13:59,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:13:59,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 736 transitions. [2023-08-04 09:13:59,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 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 09:13:59,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 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 09:13:59,541 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 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 09:13:59,541 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 487 flow. Second operand 6 states and 736 transitions. [2023-08-04 09:13:59,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 192 transitions, 1743 flow [2023-08-04 09:13:59,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 192 transitions, 1721 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-04 09:13:59,657 INFO L231 Difference]: Finished difference. Result has 86 places, 78 transitions, 712 flow [2023-08-04 09:13:59,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=712, PETRI_PLACES=86, PETRI_TRANSITIONS=78} [2023-08-04 09:13:59,658 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places. [2023-08-04 09:13:59,658 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 78 transitions, 712 flow [2023-08-04 09:13:59,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 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 09:13:59,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:13:59,658 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] [2023-08-04 09:13:59,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-04 09:13:59,659 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:13:59,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:13:59,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1118852563, now seen corresponding path program 1 times [2023-08-04 09:13:59,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:13:59,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275350863] [2023-08-04 09:13:59,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:13:59,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:13:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:13:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:13:59,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:13:59,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275350863] [2023-08-04 09:13:59,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275350863] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:13:59,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:13:59,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:13:59,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470987380] [2023-08-04 09:13:59,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:13:59,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:13:59,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:13:59,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:13:59,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:13:59,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 251 [2023-08-04 09:13:59,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 78 transitions, 712 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 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 09:13:59,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:13:59,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 251 [2023-08-04 09:13:59,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:14:01,581 INFO L124 PetriNetUnfolderBase]: 10379/14736 cut-off events. [2023-08-04 09:14:01,581 INFO L125 PetriNetUnfolderBase]: For 136374/139486 co-relation queries the response was YES. [2023-08-04 09:14:01,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79276 conditions, 14736 events. 10379/14736 cut-off events. For 136374/139486 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 79494 event pairs, 2020 based on Foata normal form. 2981/17342 useless extension candidates. Maximal degree in co-relation 78729. Up to 9898 conditions per place. [2023-08-04 09:14:01,667 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 150 selfloop transitions, 17 changer transitions 20/197 dead transitions. [2023-08-04 09:14:01,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 197 transitions, 1939 flow [2023-08-04 09:14:01,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 09:14:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 09:14:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-08-04 09:14:01,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4946879150066401 [2023-08-04 09:14:01,670 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-08-04 09:14:01,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-08-04 09:14:01,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:14:01,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-08-04 09:14:01,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 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 09:14:01,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 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 09:14:01,673 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 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 09:14:01,673 INFO L175 Difference]: Start difference. First operand has 86 places, 78 transitions, 712 flow. Second operand 6 states and 745 transitions. [2023-08-04 09:14:01,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 197 transitions, 1939 flow [2023-08-04 09:14:01,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 197 transitions, 1923 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-04 09:14:01,739 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 786 flow [2023-08-04 09:14:01,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=786, PETRI_PLACES=92, PETRI_TRANSITIONS=80} [2023-08-04 09:14:01,739 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 51 predicate places. [2023-08-04 09:14:01,739 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 786 flow [2023-08-04 09:14:01,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 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 09:14:01,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:14:01,740 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] [2023-08-04 09:14:01,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-04 09:14:01,740 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:14:01,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:14:01,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1499344911, now seen corresponding path program 2 times [2023-08-04 09:14:01,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:14:01,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544505809] [2023-08-04 09:14:01,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:14:01,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:14:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:14:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 09:14:01,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:14:01,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544505809] [2023-08-04 09:14:01,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544505809] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:14:01,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:14:01,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 09:14:01,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210853311] [2023-08-04 09:14:01,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:14:01,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:14:01,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:14:01,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:14:01,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:14:01,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 251 [2023-08-04 09:14:01,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 786 flow. Second operand has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 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 09:14:01,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:14:01,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 251 [2023-08-04 09:14:01,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:14:03,889 INFO L124 PetriNetUnfolderBase]: 14696/21239 cut-off events. [2023-08-04 09:14:03,889 INFO L125 PetriNetUnfolderBase]: For 230056/234433 co-relation queries the response was YES. [2023-08-04 09:14:03,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113024 conditions, 21239 events. 14696/21239 cut-off events. For 230056/234433 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 124871 event pairs, 4022 based on Foata normal form. 5336/26128 useless extension candidates. Maximal degree in co-relation 112152. Up to 12005 conditions per place. [2023-08-04 09:14:04,032 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 124 selfloop transitions, 13 changer transitions 19/164 dead transitions. [2023-08-04 09:14:04,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 164 transitions, 1779 flow [2023-08-04 09:14:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:14:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:14:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-04 09:14:04,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48446215139442234 [2023-08-04 09:14:04,034 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-04 09:14:04,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-04 09:14:04,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:14:04,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-04 09:14:04,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 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 09:14:04,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 09:14:04,037 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 09:14:04,037 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 786 flow. Second operand 5 states and 608 transitions. [2023-08-04 09:14:04,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 164 transitions, 1779 flow [2023-08-04 09:14:04,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 164 transitions, 1685 flow, removed 38 selfloop flow, removed 3 redundant places. [2023-08-04 09:14:04,224 INFO L231 Difference]: Finished difference. Result has 93 places, 83 transitions, 889 flow [2023-08-04 09:14:04,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=889, PETRI_PLACES=93, PETRI_TRANSITIONS=83} [2023-08-04 09:14:04,224 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 52 predicate places. [2023-08-04 09:14:04,224 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 83 transitions, 889 flow [2023-08-04 09:14:04,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 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 09:14:04,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:14:04,225 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] [2023-08-04 09:14:04,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-04 09:14:04,225 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:14:04,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:14:04,225 INFO L85 PathProgramCache]: Analyzing trace with hash 684225451, now seen corresponding path program 2 times [2023-08-04 09:14:04,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:14:04,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660813451] [2023-08-04 09:14:04,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:14:04,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:14:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:14:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 09:14:04,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:14:04,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660813451] [2023-08-04 09:14:04,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660813451] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:14:04,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849137776] [2023-08-04 09:14:04,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 09:14:04,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:14:04,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:14:04,305 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:14:04,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-04 09:14:04,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 09:14:04,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:14:04,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 09:14:04,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:14:04,440 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:14:04,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:14:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:14:04,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849137776] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:14:04,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:14:04,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2023-08-04 09:14:04,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566330151] [2023-08-04 09:14:04,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:14:04,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-04 09:14:04,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:14:04,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-04 09:14:04,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-04 09:14:04,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 251 [2023-08-04 09:14:04,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 83 transitions, 889 flow. Second operand has 9 states, 9 states have (on average 105.0) internal successors, (945), 9 states have internal predecessors, (945), 0 states have call successors, (0), 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 09:14:04,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:14:04,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 251 [2023-08-04 09:14:04,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:14:08,468 INFO L124 PetriNetUnfolderBase]: 22410/31976 cut-off events. [2023-08-04 09:14:08,469 INFO L125 PetriNetUnfolderBase]: For 382710/385137 co-relation queries the response was YES. [2023-08-04 09:14:08,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194053 conditions, 31976 events. 22410/31976 cut-off events. For 382710/385137 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 191522 event pairs, 7055 based on Foata normal form. 3225/35102 useless extension candidates. Maximal degree in co-relation 192965. Up to 17350 conditions per place. [2023-08-04 09:14:08,911 INFO L140 encePairwiseOnDemand]: 242/251 looper letters, 291 selfloop transitions, 74 changer transitions 21/392 dead transitions. [2023-08-04 09:14:08,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 392 transitions, 4712 flow [2023-08-04 09:14:08,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-04 09:14:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-04 09:14:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1519 transitions. [2023-08-04 09:14:08,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4655225252834815 [2023-08-04 09:14:08,915 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1519 transitions. [2023-08-04 09:14:08,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1519 transitions. [2023-08-04 09:14:08,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:14:08,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1519 transitions. [2023-08-04 09:14:08,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.84615384615384) internal successors, (1519), 13 states have internal predecessors, (1519), 0 states have call successors, (0), 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 09:14:08,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 251.0) internal successors, (3514), 14 states have internal predecessors, (3514), 0 states have call successors, (0), 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 09:14:08,923 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 251.0) internal successors, (3514), 14 states have internal predecessors, (3514), 0 states have call successors, (0), 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 09:14:08,923 INFO L175 Difference]: Start difference. First operand has 93 places, 83 transitions, 889 flow. Second operand 13 states and 1519 transitions. [2023-08-04 09:14:08,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 392 transitions, 4712 flow [2023-08-04 09:14:09,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 392 transitions, 4478 flow, removed 98 selfloop flow, removed 2 redundant places. [2023-08-04 09:14:09,392 INFO L231 Difference]: Finished difference. Result has 110 places, 141 transitions, 2048 flow [2023-08-04 09:14:09,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2048, PETRI_PLACES=110, PETRI_TRANSITIONS=141} [2023-08-04 09:14:09,392 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 69 predicate places. [2023-08-04 09:14:09,393 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 141 transitions, 2048 flow [2023-08-04 09:14:09,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.0) internal successors, (945), 9 states have internal predecessors, (945), 0 states have call successors, (0), 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 09:14:09,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:14:09,393 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] [2023-08-04 09:14:09,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-04 09:14:09,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-04 09:14:09,599 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:14:09,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:14:09,599 INFO L85 PathProgramCache]: Analyzing trace with hash 849960239, now seen corresponding path program 1 times [2023-08-04 09:14:09,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:14:09,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081019486] [2023-08-04 09:14:09,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:14:09,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:14:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:14:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:14:09,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:14:09,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081019486] [2023-08-04 09:14:09,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081019486] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:14:09,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969724525] [2023-08-04 09:14:09,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:14:09,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:14:09,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:14:09,723 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:14:09,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-04 09:14:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:14:09,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 09:14:09,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:14:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:14:09,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:14:09,900 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:14:09,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969724525] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:14:09,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:14:09,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-04 09:14:09,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961685974] [2023-08-04 09:14:09,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:14:09,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 09:14:09,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:14:09,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 09:14:09,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-04 09:14:09,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 251 [2023-08-04 09:14:09,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 141 transitions, 2048 flow. Second operand has 8 states, 8 states have (on average 106.25) internal successors, (850), 8 states have internal predecessors, (850), 0 states have call successors, (0), 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 09:14:09,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:14:09,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 251 [2023-08-04 09:14:09,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:14:13,412 INFO L124 PetriNetUnfolderBase]: 20928/29137 cut-off events. [2023-08-04 09:14:13,413 INFO L125 PetriNetUnfolderBase]: For 553625/559592 co-relation queries the response was YES. [2023-08-04 09:14:13,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198964 conditions, 29137 events. 20928/29137 cut-off events. For 553625/559592 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 164729 event pairs, 5658 based on Foata normal form. 5687/34437 useless extension candidates. Maximal degree in co-relation 198100. Up to 18305 conditions per place. [2023-08-04 09:14:13,658 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 167 selfloop transitions, 64 changer transitions 12/255 dead transitions. [2023-08-04 09:14:13,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 255 transitions, 3805 flow [2023-08-04 09:14:13,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:14:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:14:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2023-08-04 09:14:13,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48685258964143424 [2023-08-04 09:14:13,660 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 611 transitions. [2023-08-04 09:14:13,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 611 transitions. [2023-08-04 09:14:13,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:14:13,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 611 transitions. [2023-08-04 09:14:13,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 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 09:14:13,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 09:14:13,662 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 09:14:13,662 INFO L175 Difference]: Start difference. First operand has 110 places, 141 transitions, 2048 flow. Second operand 5 states and 611 transitions. [2023-08-04 09:14:13,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 255 transitions, 3805 flow [2023-08-04 09:14:14,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 255 transitions, 3626 flow, removed 57 selfloop flow, removed 3 redundant places. [2023-08-04 09:14:14,300 INFO L231 Difference]: Finished difference. Result has 113 places, 170 transitions, 2655 flow [2023-08-04 09:14:14,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2655, PETRI_PLACES=113, PETRI_TRANSITIONS=170} [2023-08-04 09:14:14,300 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2023-08-04 09:14:14,300 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 170 transitions, 2655 flow [2023-08-04 09:14:14,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.25) internal successors, (850), 8 states have internal predecessors, (850), 0 states have call successors, (0), 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 09:14:14,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:14:14,301 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] [2023-08-04 09:14:14,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-04 09:14:14,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:14:14,505 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:14:14,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:14:14,506 INFO L85 PathProgramCache]: Analyzing trace with hash -853267238, now seen corresponding path program 1 times [2023-08-04 09:14:14,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:14:14,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442469686] [2023-08-04 09:14:14,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:14:14,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:14:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:14:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:14:14,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:14:14,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442469686] [2023-08-04 09:14:14,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442469686] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:14:14,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960921827] [2023-08-04 09:14:14,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:14:14,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:14:14,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:14:14,582 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:14:14,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-04 09:14:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:14:14,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 09:14:14,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:14:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:14:14,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:14:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:14:14,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960921827] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:14:14,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:14:14,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-04 09:14:14,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663570] [2023-08-04 09:14:14,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:14:14,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 09:14:14,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:14:14,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 09:14:14,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-04 09:14:14,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 251 [2023-08-04 09:14:14,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 170 transitions, 2655 flow. Second operand has 8 states, 8 states have (on average 106.125) internal successors, (849), 8 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 09:14:14,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:14:14,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 251 [2023-08-04 09:14:14,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:14:18,195 INFO L124 PetriNetUnfolderBase]: 21867/28993 cut-off events. [2023-08-04 09:14:18,195 INFO L125 PetriNetUnfolderBase]: For 597339/602900 co-relation queries the response was YES. [2023-08-04 09:14:18,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220952 conditions, 28993 events. 21867/28993 cut-off events. For 597339/602900 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 146673 event pairs, 3992 based on Foata normal form. 3614/32507 useless extension candidates. Maximal degree in co-relation 220227. Up to 16657 conditions per place. [2023-08-04 09:14:18,688 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 177 selfloop transitions, 119 changer transitions 4/312 dead transitions. [2023-08-04 09:14:18,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 312 transitions, 5168 flow [2023-08-04 09:14:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 09:14:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 09:14:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 717 transitions. [2023-08-04 09:14:18,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4760956175298805 [2023-08-04 09:14:18,691 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 717 transitions. [2023-08-04 09:14:18,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 717 transitions. [2023-08-04 09:14:18,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:14:18,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 717 transitions. [2023-08-04 09:14:18,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 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 09:14:18,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 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 09:14:18,707 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 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 09:14:18,708 INFO L175 Difference]: Start difference. First operand has 113 places, 170 transitions, 2655 flow. Second operand 6 states and 717 transitions. [2023-08-04 09:14:18,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 312 transitions, 5168 flow [2023-08-04 09:14:19,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 312 transitions, 4778 flow, removed 137 selfloop flow, removed 2 redundant places. [2023-08-04 09:14:19,612 INFO L231 Difference]: Finished difference. Result has 117 places, 224 transitions, 3803 flow [2023-08-04 09:14:19,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=2411, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3803, PETRI_PLACES=117, PETRI_TRANSITIONS=224} [2023-08-04 09:14:19,613 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places. [2023-08-04 09:14:19,613 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 224 transitions, 3803 flow [2023-08-04 09:14:19,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.125) internal successors, (849), 8 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 09:14:19,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:14:19,613 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] [2023-08-04 09:14:19,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-08-04 09:14:19,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-04 09:14:19,819 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:14:19,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:14:19,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1217080233, now seen corresponding path program 1 times [2023-08-04 09:14:19,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:14:19,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90734091] [2023-08-04 09:14:19,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:14:19,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:14:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:14:19,968 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:14:19,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:14:19,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90734091] [2023-08-04 09:14:19,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90734091] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:14:19,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192710209] [2023-08-04 09:14:19,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:14:19,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:14:19,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:14:19,970 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:14:19,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-04 09:14:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:14:20,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-04 09:14:20,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:14:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 09:14:20,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:14:20,324 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 09:14:20,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192710209] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:14:20,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:14:20,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 09:14:20,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024315126] [2023-08-04 09:14:20,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:14:20,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 09:14:20,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:14:20,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 09:14:20,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-04 09:14:20,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 251 [2023-08-04 09:14:20,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 224 transitions, 3803 flow. Second operand has 8 states, 8 states have (on average 113.625) internal successors, (909), 8 states have internal predecessors, (909), 0 states have call successors, (0), 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 09:14:20,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:14:20,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 251 [2023-08-04 09:14:20,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:14:28,480 INFO L124 PetriNetUnfolderBase]: 44282/60150 cut-off events. [2023-08-04 09:14:28,480 INFO L125 PetriNetUnfolderBase]: For 1458017/1470830 co-relation queries the response was YES. [2023-08-04 09:14:28,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465376 conditions, 60150 events. 44282/60150 cut-off events. For 1458017/1470830 co-relation queries the response was YES. Maximal size of possible extension queue 1643. Compared 361085 event pairs, 5616 based on Foata normal form. 11021/68625 useless extension candidates. Maximal degree in co-relation 463755. Up to 32758 conditions per place. [2023-08-04 09:14:29,122 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 256 selfloop transitions, 200 changer transitions 1/475 dead transitions. [2023-08-04 09:14:29,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 475 transitions, 8318 flow [2023-08-04 09:14:29,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:14:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:14:29,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2023-08-04 09:14:29,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5179282868525896 [2023-08-04 09:14:29,123 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2023-08-04 09:14:29,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2023-08-04 09:14:29,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:14:29,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2023-08-04 09:14:29,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 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 09:14:29,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 09:14:29,147 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 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 09:14:29,148 INFO L175 Difference]: Start difference. First operand has 117 places, 224 transitions, 3803 flow. Second operand 5 states and 650 transitions. [2023-08-04 09:14:29,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 475 transitions, 8318 flow [2023-08-04 09:14:32,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 475 transitions, 7620 flow, removed 306 selfloop flow, removed 1 redundant places. [2023-08-04 09:14:32,397 INFO L231 Difference]: Finished difference. Result has 122 places, 385 transitions, 7298 flow [2023-08-04 09:14:32,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=3438, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7298, PETRI_PLACES=122, PETRI_TRANSITIONS=385} [2023-08-04 09:14:32,397 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 81 predicate places. [2023-08-04 09:14:32,397 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 385 transitions, 7298 flow [2023-08-04 09:14:32,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.625) internal successors, (909), 8 states have internal predecessors, (909), 0 states have call successors, (0), 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 09:14:32,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:14:32,398 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] [2023-08-04 09:14:32,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-04 09:14:32,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-04 09:14:32,603 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:14:32,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:14:32,604 INFO L85 PathProgramCache]: Analyzing trace with hash -644541673, now seen corresponding path program 2 times [2023-08-04 09:14:32,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:14:32,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668767551] [2023-08-04 09:14:32,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:14:32,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:14:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:14:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:14:32,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:14:32,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668767551] [2023-08-04 09:14:32,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668767551] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:14:32,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273457936] [2023-08-04 09:14:32,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 09:14:32,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:14:32,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:14:32,779 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:14:32,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-04 09:14:32,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 09:14:32,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:14:32,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-04 09:14:32,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:14:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:14:33,022 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:14:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:14:33,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273457936] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:14:33,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:14:33,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-08-04 09:14:33,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802689726] [2023-08-04 09:14:33,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:14:33,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 09:14:33,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:14:33,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 09:14:33,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-08-04 09:14:33,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 251 [2023-08-04 09:14:33,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 385 transitions, 7298 flow. Second operand has 10 states, 10 states have (on average 111.7) internal successors, (1117), 10 states have internal predecessors, (1117), 0 states have call successors, (0), 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 09:14:33,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:14:33,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 251 [2023-08-04 09:14:33,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:14:50,032 INFO L124 PetriNetUnfolderBase]: 85390/116548 cut-off events. [2023-08-04 09:14:50,032 INFO L125 PetriNetUnfolderBase]: For 3351811/3374820 co-relation queries the response was YES. [2023-08-04 09:14:50,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978881 conditions, 116548 events. 85390/116548 cut-off events. For 3351811/3374820 co-relation queries the response was YES. Maximal size of possible extension queue 3148. Compared 768084 event pairs, 8551 based on Foata normal form. 16272/128210 useless extension candidates. Maximal degree in co-relation 976323. Up to 62639 conditions per place. [2023-08-04 09:14:52,075 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 290 selfloop transitions, 455 changer transitions 1/764 dead transitions. [2023-08-04 09:14:52,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 764 transitions, 14603 flow [2023-08-04 09:14:52,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 09:14:52,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 09:14:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 787 transitions. [2023-08-04 09:14:52,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225763612217795 [2023-08-04 09:14:52,077 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 787 transitions. [2023-08-04 09:14:52,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 787 transitions. [2023-08-04 09:14:52,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:14:52,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 787 transitions. [2023-08-04 09:14:52,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 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 09:14:52,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 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 09:14:52,080 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 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 09:14:52,080 INFO L175 Difference]: Start difference. First operand has 122 places, 385 transitions, 7298 flow. Second operand 6 states and 787 transitions. [2023-08-04 09:14:52,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 764 transitions, 14603 flow [2023-08-04 09:15:01,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 764 transitions, 14469 flow, removed 67 selfloop flow, removed 0 redundant places. [2023-08-04 09:15:01,021 INFO L231 Difference]: Finished difference. Result has 130 places, 640 transitions, 14244 flow [2023-08-04 09:15:01,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=7164, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=277, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14244, PETRI_PLACES=130, PETRI_TRANSITIONS=640} [2023-08-04 09:15:01,025 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 89 predicate places. [2023-08-04 09:15:01,025 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 640 transitions, 14244 flow [2023-08-04 09:15:01,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.7) internal successors, (1117), 10 states have internal predecessors, (1117), 0 states have call successors, (0), 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 09:15:01,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:15:01,026 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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] [2023-08-04 09:15:01,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-04 09:15:01,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-04 09:15:01,231 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:15:01,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:15:01,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1454220049, now seen corresponding path program 1 times [2023-08-04 09:15:01,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:15:01,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173418958] [2023-08-04 09:15:01,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:15:01,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:15:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:15:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:15:01,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:15:01,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173418958] [2023-08-04 09:15:01,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173418958] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:15:01,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983372290] [2023-08-04 09:15:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:15:01,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:15:01,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:15:01,345 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:15:01,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-04 09:15:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:15:01,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-04 09:15:01,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:15:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:15:01,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:15:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:15:01,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983372290] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:15:01,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:15:01,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2023-08-04 09:15:01,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107117926] [2023-08-04 09:15:01,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:15:01,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-04 09:15:01,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:15:01,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-04 09:15:01,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-08-04 09:15:01,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 251 [2023-08-04 09:15:01,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 640 transitions, 14244 flow. Second operand has 14 states, 14 states have (on average 105.21428571428571) internal successors, (1473), 14 states have internal predecessors, (1473), 0 states have call successors, (0), 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 09:15:01,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:15:01,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 251 [2023-08-04 09:15:01,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:16:37,984 INFO L124 PetriNetUnfolderBase]: 305942/435695 cut-off events. [2023-08-04 09:16:37,984 INFO L125 PetriNetUnfolderBase]: For 12698666/12752243 co-relation queries the response was YES. [2023-08-04 09:16:41,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3625895 conditions, 435695 events. 305942/435695 cut-off events. For 12698666/12752243 co-relation queries the response was YES. Maximal size of possible extension queue 11792. Compared 3646673 event pairs, 14698 based on Foata normal form. 41574/475318 useless extension candidates. Maximal degree in co-relation 3595989. Up to 199601 conditions per place. [2023-08-04 09:16:44,158 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 3664 selfloop transitions, 741 changer transitions 0/4421 dead transitions. [2023-08-04 09:16:44,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 4421 transitions, 103965 flow [2023-08-04 09:16:44,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-04 09:16:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-04 09:16:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3700 transitions. [2023-08-04 09:16:44,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4913678618857902 [2023-08-04 09:16:44,163 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3700 transitions. [2023-08-04 09:16:44,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3700 transitions. [2023-08-04 09:16:44,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:16:44,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3700 transitions. [2023-08-04 09:16:44,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 123.33333333333333) internal successors, (3700), 30 states have internal predecessors, (3700), 0 states have call successors, (0), 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 09:16:44,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 251.0) internal successors, (7781), 31 states have internal predecessors, (7781), 0 states have call successors, (0), 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 09:16:44,176 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 251.0) internal successors, (7781), 31 states have internal predecessors, (7781), 0 states have call successors, (0), 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 09:16:44,176 INFO L175 Difference]: Start difference. First operand has 130 places, 640 transitions, 14244 flow. Second operand 30 states and 3700 transitions. [2023-08-04 09:16:44,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 4421 transitions, 103965 flow [2023-08-04 09:21:11,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 4421 transitions, 100485 flow, removed 1706 selfloop flow, removed 1 redundant places. [2023-08-04 09:21:11,634 INFO L231 Difference]: Finished difference. Result has 173 places, 1365 transitions, 32836 flow [2023-08-04 09:21:11,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=13692, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=32836, PETRI_PLACES=173, PETRI_TRANSITIONS=1365} [2023-08-04 09:21:11,636 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 132 predicate places. [2023-08-04 09:21:11,636 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 1365 transitions, 32836 flow [2023-08-04 09:21:11,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 105.21428571428571) internal successors, (1473), 14 states have internal predecessors, (1473), 0 states have call successors, (0), 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 09:21:11,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:21:11,636 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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] [2023-08-04 09:21:11,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-04 09:21:11,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:21:11,838 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:21:11,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:21:11,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1216731592, now seen corresponding path program 3 times [2023-08-04 09:21:11,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:21:11,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538870432] [2023-08-04 09:21:11,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:21:11,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:21:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:21:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:21:11,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:21:11,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538870432] [2023-08-04 09:21:11,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538870432] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:21:11,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792449464] [2023-08-04 09:21:11,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 09:21:11,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:21:11,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:21:12,006 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:21:12,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-04 09:21:12,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 09:21:12,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:21:12,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-04 09:21:12,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:21:12,137 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-04 09:21:12,185 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-08-04 09:21:12,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-04 09:21:12,321 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-04 09:21:12,438 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:21:12,438 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 25 treesize of output 17 [2023-08-04 09:21:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 09:21:12,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:21:12,981 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_560 (Array Int Int)) (|ULTIMATE.start_main_~asdf~2#1| Int)) (let ((.cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| (* 4 |ULTIMATE.start_main_~asdf~2#1|))) 4294967296))) (or (not (= .cse0 (+ c_thread1Thread1of2ForFork1_thidvar0 4294967296))) (<= .cse0 2147483647) (<= |ULTIMATE.start_main_~asdf~2#1| 0) (<= 2 |ULTIMATE.start_main_~asdf~2#1|)))) (forall ((v_ArrVal_560 (Array Int Int)) (|ULTIMATE.start_main_~asdf~2#1| Int)) (let ((.cse1 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~#t1~0#1.base|) (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| (* 4 |ULTIMATE.start_main_~asdf~2#1|))) 4294967296))) (or (not (= .cse1 c_thread1Thread1of2ForFork1_thidvar0)) (< 2147483647 .cse1) (<= |ULTIMATE.start_main_~asdf~2#1| 0) (<= 2 |ULTIMATE.start_main_~asdf~2#1|))))) is different from false [2023-08-04 09:21:13,268 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:21:13,268 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 96 [2023-08-04 09:21:13,290 INFO L322 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-04 09:21:13,290 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 146 [2023-08-04 09:21:13,297 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 113 [2023-08-04 09:21:13,301 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 101 [2023-08-04 09:21:13,635 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 5 not checked. [2023-08-04 09:21:13,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792449464] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:21:13,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:21:13,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 25 [2023-08-04 09:21:13,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413775059] [2023-08-04 09:21:13,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:21:13,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-04 09:21:13,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:21:13,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-04 09:21:13,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=484, Unknown=1, NotChecked=44, Total=600 [2023-08-04 09:21:13,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 251 [2023-08-04 09:21:13,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 1365 transitions, 32836 flow. Second operand has 25 states, 25 states have (on average 69.2) internal successors, (1730), 25 states have internal predecessors, (1730), 0 states have call successors, (0), 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 09:21:13,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:21:13,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 251 [2023-08-04 09:21:13,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand