/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure1.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 02:54:37,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 02:54:38,105 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 02:54:38,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 02:54:38,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 02:54:38,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 02:54:38,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 02:54:38,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 02:54:38,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 02:54:38,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 02:54:38,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 02:54:38,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 02:54:38,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 02:54:38,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 02:54:38,129 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 02:54:38,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 02:54:38,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 02:54:38,129 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 02:54:38,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 02:54:38,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 02:54:38,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 02:54:38,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 02:54:38,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 02:54:38,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 02:54:38,132 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 02:54:38,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 02:54:38,132 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 02:54:38,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 02:54:38,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 02:54:38,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 02:54:38,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 02:54:38,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 02:54:38,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 02:54:38,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 02:54:38,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 02:54:38,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 02:54:38,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 02:54:38,135 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 02:54:38,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 02:54:38,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 02:54:38,136 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 02:54:38,137 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-04 02:54:38,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 02:54:38,378 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 02:54:38,380 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 02:54:38,382 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 02:54:38,382 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 02:54:38,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure1.wvr_bound2.c [2023-08-04 02:54:39,513 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 02:54:39,635 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 02:54:39,635 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-figure1.wvr_bound2.c [2023-08-04 02:54:39,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a4fdacf8/1630d58d771343edb0f31c48446cc0a9/FLAGdc69b57ee [2023-08-04 02:54:39,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a4fdacf8/1630d58d771343edb0f31c48446cc0a9 [2023-08-04 02:54:39,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 02:54:39,653 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 02:54:39,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 02:54:39,654 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 02:54:39,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 02:54:39,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 02:54:39" (1/1) ... [2023-08-04 02:54:39,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9122056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:39, skipping insertion in model container [2023-08-04 02:54:39,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 02:54:39" (1/1) ... [2023-08-04 02:54:39,672 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 02:54:39,825 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-figure1.wvr_bound2.c[2153,2166] [2023-08-04 02:54:39,826 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 02:54:39,836 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 02:54:39,850 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-figure1.wvr_bound2.c[2153,2166] [2023-08-04 02:54:39,853 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 02:54:39,858 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 02:54:39,858 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 02:54:39,863 INFO L206 MainTranslator]: Completed translation [2023-08-04 02:54:39,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:39 WrapperNode [2023-08-04 02:54:39,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 02:54:39,867 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 02:54:39,867 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 02:54:39,867 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 02:54:39,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:39" (1/1) ... [2023-08-04 02:54:39,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:39" (1/1) ... [2023-08-04 02:54:39,904 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2023-08-04 02:54:39,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 02:54:39,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 02:54:39,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 02:54:39,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 02:54:39,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:39" (1/1) ... [2023-08-04 02:54:39,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:39" (1/1) ... [2023-08-04 02:54:39,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:39" (1/1) ... [2023-08-04 02:54:39,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:39" (1/1) ... [2023-08-04 02:54:39,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:39" (1/1) ... [2023-08-04 02:54:39,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:39" (1/1) ... [2023-08-04 02:54:39,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:39" (1/1) ... [2023-08-04 02:54:39,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:39" (1/1) ... [2023-08-04 02:54:39,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 02:54:39,930 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 02:54:39,930 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 02:54:39,930 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 02:54:39,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:39" (1/1) ... [2023-08-04 02:54:39,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 02:54:39,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:39,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 02:54:39,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 02:54:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 02:54:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 02:54:40,006 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 02:54:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 02:54:40,006 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 02:54:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 02:54:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 02:54:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 02:54:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 02:54:40,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 02:54:40,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 02:54:40,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 02:54:40,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 02:54:40,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 02:54:40,010 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 02:54:40,097 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 02:54:40,106 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 02:54:40,260 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 02:54:40,281 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 02:54:40,281 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-04 02:54:40,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 02:54:40 BoogieIcfgContainer [2023-08-04 02:54:40,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 02:54:40,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 02:54:40,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 02:54:40,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 02:54:40,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 02:54:39" (1/3) ... [2023-08-04 02:54:40,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150a136a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 02:54:40, skipping insertion in model container [2023-08-04 02:54:40,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:54:39" (2/3) ... [2023-08-04 02:54:40,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150a136a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 02:54:40, skipping insertion in model container [2023-08-04 02:54:40,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 02:54:40" (3/3) ... [2023-08-04 02:54:40,290 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-figure1.wvr_bound2.c [2023-08-04 02:54:40,295 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 02:54:40,302 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 02:54:40,302 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 02:54:40,302 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 02:54:40,345 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 02:54:40,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 103 transitions, 228 flow [2023-08-04 02:54:40,449 INFO L124 PetriNetUnfolderBase]: 32/243 cut-off events. [2023-08-04 02:54:40,449 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 02:54:40,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 243 events. 32/243 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/201 useless extension candidates. Maximal degree in co-relation 121. Up to 8 conditions per place. [2023-08-04 02:54:40,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 103 transitions, 228 flow [2023-08-04 02:54:40,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 103 transitions, 228 flow [2023-08-04 02:54:40,466 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:54:40,476 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 103 transitions, 228 flow [2023-08-04 02:54:40,483 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 103 transitions, 228 flow [2023-08-04 02:54:40,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 103 transitions, 228 flow [2023-08-04 02:54:40,552 INFO L124 PetriNetUnfolderBase]: 32/243 cut-off events. [2023-08-04 02:54:40,552 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 02:54:40,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 243 events. 32/243 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/201 useless extension candidates. Maximal degree in co-relation 121. Up to 8 conditions per place. [2023-08-04 02:54:40,556 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2023-08-04 02:54:42,195 INFO L134 LiptonReduction]: Checked pairs total: 2862 [2023-08-04 02:54:42,195 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-08-04 02:54:42,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 02:54:42,209 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;@750e4691, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:54:42,209 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 02:54:42,213 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:54:42,213 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2023-08-04 02:54:42,213 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 02:54:42,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:42,214 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 02:54:42,214 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:54:42,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:42,217 INFO L85 PathProgramCache]: Analyzing trace with hash -438439530, now seen corresponding path program 1 times [2023-08-04 02:54:42,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:42,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768936892] [2023-08-04 02:54:42,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:42,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 02:54:42,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 02:54:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 02:54:42,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 02:54:42,325 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 02:54:42,326 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 02:54:42,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 02:54:42,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 02:54:42,328 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 02:54:42,333 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-04 02:54:42,335 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 02:54:42,335 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 02:54:42,367 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 02:54:42,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 129 transitions, 306 flow [2023-08-04 02:54:42,440 INFO L124 PetriNetUnfolderBase]: 133/818 cut-off events. [2023-08-04 02:54:42,440 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:54:42,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 818 events. 133/818 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4225 event pairs, 1 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 476. Up to 32 conditions per place. [2023-08-04 02:54:42,445 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 129 transitions, 306 flow [2023-08-04 02:54:42,449 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 129 transitions, 306 flow [2023-08-04 02:54:42,449 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:54:42,449 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 129 transitions, 306 flow [2023-08-04 02:54:42,450 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 129 transitions, 306 flow [2023-08-04 02:54:42,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 129 transitions, 306 flow [2023-08-04 02:54:42,537 INFO L124 PetriNetUnfolderBase]: 133/818 cut-off events. [2023-08-04 02:54:42,537 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:54:42,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 818 events. 133/818 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4225 event pairs, 1 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 476. Up to 32 conditions per place. [2023-08-04 02:54:42,550 INFO L119 LiptonReduction]: Number of co-enabled transitions 6000 [2023-08-04 02:54:44,206 INFO L134 LiptonReduction]: Checked pairs total: 8525 [2023-08-04 02:54:44,206 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-08-04 02:54:44,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 02:54:44,209 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;@750e4691, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:54:44,209 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 02:54:44,214 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:54:44,214 INFO L124 PetriNetUnfolderBase]: 7/67 cut-off events. [2023-08-04 02:54:44,214 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 02:54:44,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:44,215 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 02:54:44,215 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:54:44,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:44,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2005117216, now seen corresponding path program 1 times [2023-08-04 02:54:44,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:44,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077958436] [2023-08-04 02:54:44,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:44,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 02:54:44,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:44,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077958436] [2023-08-04 02:54:44,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077958436] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:44,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53666107] [2023-08-04 02:54:44,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:44,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:44,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:44,354 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:54:44,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 02:54:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:44,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:54:44,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:44,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 02:54:44,462 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:44,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53666107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:44,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:44,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 02:54:44,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131417519] [2023-08-04 02:54:44,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:44,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:44,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:44,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:44,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 02:54:44,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2023-08-04 02:54:44,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 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 02:54:44,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:44,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2023-08-04 02:54:44,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:45,134 INFO L124 PetriNetUnfolderBase]: 8553/11151 cut-off events. [2023-08-04 02:54:45,134 INFO L125 PetriNetUnfolderBase]: For 919/919 co-relation queries the response was YES. [2023-08-04 02:54:45,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22551 conditions, 11151 events. 8553/11151 cut-off events. For 919/919 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 50309 event pairs, 2448 based on Foata normal form. 0/6346 useless extension candidates. Maximal degree in co-relation 6846. Up to 10615 conditions per place. [2023-08-04 02:54:45,167 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 23 selfloop transitions, 5 changer transitions 17/52 dead transitions. [2023-08-04 02:54:45,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 234 flow [2023-08-04 02:54:45,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:54:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:54:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2023-08-04 02:54:45,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713656387665198 [2023-08-04 02:54:45,184 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 535 transitions. [2023-08-04 02:54:45,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 535 transitions. [2023-08-04 02:54:45,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:45,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 535 transitions. [2023-08-04 02:54:45,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:45,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:45,200 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:45,201 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 136 flow. Second operand 5 states and 535 transitions. [2023-08-04 02:54:45,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 234 flow [2023-08-04 02:54:45,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 02:54:45,212 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 91 flow [2023-08-04 02:54:45,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-04 02:54:45,217 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-04 02:54:45,217 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 91 flow [2023-08-04 02:54:45,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.6) internal successors, (498), 5 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 02:54:45,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:45,218 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-04 02:54:45,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 02:54:45,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:45,423 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:54:45,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:45,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2023462268, now seen corresponding path program 1 times [2023-08-04 02:54:45,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:45,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877249202] [2023-08-04 02:54:45,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:45,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:54:45,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:45,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877249202] [2023-08-04 02:54:45,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877249202] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:45,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:54:45,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 02:54:45,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509190271] [2023-08-04 02:54:45,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:45,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:45,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:45,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:45,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:54:45,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 227 [2023-08-04 02:54:45,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:45,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:45,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 227 [2023-08-04 02:54:45,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:45,684 INFO L124 PetriNetUnfolderBase]: 1760/2333 cut-off events. [2023-08-04 02:54:45,684 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2023-08-04 02:54:45,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 2333 events. 1760/2333 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8368 event pairs, 685 based on Foata normal form. 1/1402 useless extension candidates. Maximal degree in co-relation 1396. Up to 2189 conditions per place. [2023-08-04 02:54:45,696 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 21 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-04 02:54:45,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 140 flow [2023-08-04 02:54:45,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:54:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:54:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-08-04 02:54:45,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4698972099853157 [2023-08-04 02:54:45,698 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-08-04 02:54:45,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-08-04 02:54:45,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:45,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-08-04 02:54:45,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:45,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:45,701 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:45,701 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 91 flow. Second operand 3 states and 320 transitions. [2023-08-04 02:54:45,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 140 flow [2023-08-04 02:54:45,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 137 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 02:54:45,705 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 87 flow [2023-08-04 02:54:45,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=87, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2023-08-04 02:54:45,705 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-04 02:54:45,706 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 87 flow [2023-08-04 02:54:45,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:45,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:45,706 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:45,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 02:54:45,707 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:54:45,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:45,707 INFO L85 PathProgramCache]: Analyzing trace with hash -813497558, now seen corresponding path program 1 times [2023-08-04 02:54:45,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:45,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758928728] [2023-08-04 02:54:45,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:45,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:54:45,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:45,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758928728] [2023-08-04 02:54:45,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758928728] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:45,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453950687] [2023-08-04 02:54:45,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:45,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:45,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:45,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:54:45,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 02:54:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:45,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:54:45,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:45,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:54:45,867 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:54:45,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453950687] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:45,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:45,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 02:54:45,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082229074] [2023-08-04 02:54:45,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:45,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:45,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:45,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:45,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:45,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2023-08-04 02:54:45,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:45,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:45,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2023-08-04 02:54:45,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:46,069 INFO L124 PetriNetUnfolderBase]: 1432/1870 cut-off events. [2023-08-04 02:54:46,069 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-04 02:54:46,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3799 conditions, 1870 events. 1432/1870 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6199 event pairs, 357 based on Foata normal form. 3/1117 useless extension candidates. Maximal degree in co-relation 2803. Up to 1729 conditions per place. [2023-08-04 02:54:46,081 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 23 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-08-04 02:54:46,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 150 flow [2023-08-04 02:54:46,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:54:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:54:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2023-08-04 02:54:46,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46145374449339205 [2023-08-04 02:54:46,084 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 419 transitions. [2023-08-04 02:54:46,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 419 transitions. [2023-08-04 02:54:46,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:46,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 419 transitions. [2023-08-04 02:54:46,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:46,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:46,088 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:46,088 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 87 flow. Second operand 4 states and 419 transitions. [2023-08-04 02:54:46,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 150 flow [2023-08-04 02:54:46,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 02:54:46,091 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 84 flow [2023-08-04 02:54:46,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2023-08-04 02:54:46,093 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -6 predicate places. [2023-08-04 02:54:46,093 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 84 flow [2023-08-04 02:54:46,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:46,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:46,097 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:46,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-04 02:54:46,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-04 02:54:46,304 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:54:46,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:46,305 INFO L85 PathProgramCache]: Analyzing trace with hash 563520111, now seen corresponding path program 1 times [2023-08-04 02:54:46,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:46,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034521100] [2023-08-04 02:54:46,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:46,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:46,364 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 02:54:46,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:46,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034521100] [2023-08-04 02:54:46,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034521100] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:46,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771503236] [2023-08-04 02:54:46,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:46,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:46,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:46,367 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:54:46,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 02:54:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:46,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:54:46,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 02:54:46,449 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:46,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771503236] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:46,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:46,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 02:54:46,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437952200] [2023-08-04 02:54:46,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:46,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:46,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:46,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 02:54:46,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2023-08-04 02:54:46,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:46,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:46,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2023-08-04 02:54:46,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:46,577 INFO L124 PetriNetUnfolderBase]: 1000/1330 cut-off events. [2023-08-04 02:54:46,577 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-04 02:54:46,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 1330 events. 1000/1330 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4391 event pairs, 43 based on Foata normal form. 81/871 useless extension candidates. Maximal degree in co-relation 1017. Up to 558 conditions per place. [2023-08-04 02:54:46,580 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 0 selfloop transitions, 0 changer transitions 45/45 dead transitions. [2023-08-04 02:54:46,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 198 flow [2023-08-04 02:54:46,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:54:46,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:54:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2023-08-04 02:54:46,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466079295154185 [2023-08-04 02:54:46,582 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 529 transitions. [2023-08-04 02:54:46,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 529 transitions. [2023-08-04 02:54:46,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:46,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 529 transitions. [2023-08-04 02:54:46,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:46,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:46,585 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:46,585 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 84 flow. Second operand 5 states and 529 transitions. [2023-08-04 02:54:46,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 198 flow [2023-08-04 02:54:46,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 191 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 02:54:46,587 INFO L231 Difference]: Finished difference. Result has 34 places, 0 transitions, 0 flow [2023-08-04 02:54:46,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=34, PETRI_TRANSITIONS=0} [2023-08-04 02:54:46,588 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-04 02:54:46,589 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 0 transitions, 0 flow [2023-08-04 02:54:46,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:46,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 02:54:46,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 02:54:46,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 02:54:46,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:46,796 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 02:54:46,796 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-04 02:54:46,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 129 transitions, 306 flow [2023-08-04 02:54:46,852 INFO L124 PetriNetUnfolderBase]: 133/818 cut-off events. [2023-08-04 02:54:46,853 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:54:46,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 818 events. 133/818 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4225 event pairs, 1 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 476. Up to 32 conditions per place. [2023-08-04 02:54:46,855 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 129 transitions, 306 flow [2023-08-04 02:54:46,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 129 transitions, 306 flow [2023-08-04 02:54:46,857 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:54:46,858 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 129 transitions, 306 flow [2023-08-04 02:54:46,858 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 129 transitions, 306 flow [2023-08-04 02:54:46,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 129 transitions, 306 flow [2023-08-04 02:54:46,896 INFO L124 PetriNetUnfolderBase]: 133/818 cut-off events. [2023-08-04 02:54:46,896 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:54:46,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 818 events. 133/818 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4225 event pairs, 1 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 476. Up to 32 conditions per place. [2023-08-04 02:54:46,909 INFO L119 LiptonReduction]: Number of co-enabled transitions 6000 [2023-08-04 02:54:48,667 INFO L134 LiptonReduction]: Checked pairs total: 8453 [2023-08-04 02:54:48,668 INFO L136 LiptonReduction]: Total number of compositions: 98 [2023-08-04 02:54:48,669 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 02:54:48,669 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;@750e4691, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:54:48,669 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 02:54:48,671 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:54:48,671 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-08-04 02:54:48,671 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 02:54:48,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:48,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 02:54:48,671 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:48,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:48,671 INFO L85 PathProgramCache]: Analyzing trace with hash 735252726, now seen corresponding path program 1 times [2023-08-04 02:54:48,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:48,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682613931] [2023-08-04 02:54:48,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:48,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 02:54:48,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:48,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682613931] [2023-08-04 02:54:48,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682613931] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:48,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:54:48,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 02:54:48,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211290835] [2023-08-04 02:54:48,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:48,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:48,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:48,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:48,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:54:48,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 227 [2023-08-04 02:54:48,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:48,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:48,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 227 [2023-08-04 02:54:48,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:49,187 INFO L124 PetriNetUnfolderBase]: 8526/11037 cut-off events. [2023-08-04 02:54:49,187 INFO L125 PetriNetUnfolderBase]: For 996/996 co-relation queries the response was YES. [2023-08-04 02:54:49,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22380 conditions, 11037 events. 8526/11037 cut-off events. For 996/996 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 47952 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 02:54:49,248 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 35 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-08-04 02:54:49,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 216 flow [2023-08-04 02:54:49,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:54:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:54:49,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-04 02:54:49,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4933920704845815 [2023-08-04 02:54:49,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-04 02:54:49,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-04 02:54:49,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:49,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-04 02:54:49,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:49,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:49,252 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:49,253 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 136 flow. Second operand 3 states and 336 transitions. [2023-08-04 02:54:49,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 216 flow [2023-08-04 02:54:49,255 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 02:54:49,256 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 134 flow [2023-08-04 02:54:49,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, 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 02:54:49,258 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-04 02:54:49,258 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 134 flow [2023-08-04 02:54:49,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:49,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:49,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:49,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 02:54:49,258 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:49,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:49,259 INFO L85 PathProgramCache]: Analyzing trace with hash 790362868, now seen corresponding path program 1 times [2023-08-04 02:54:49,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:49,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732673234] [2023-08-04 02:54:49,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:49,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 02:54:49,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:49,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732673234] [2023-08-04 02:54:49,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732673234] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:49,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350203577] [2023-08-04 02:54:49,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:49,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:49,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:49,323 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:54:49,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 02:54:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:49,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:54:49,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 02:54:49,374 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:49,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350203577] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:49,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:49,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 02:54:49,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902232168] [2023-08-04 02:54:49,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:49,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:49,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:49,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:49,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:49,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 227 [2023-08-04 02:54:49,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 134 flow. Second operand has 3 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 02:54:49,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:49,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 227 [2023-08-04 02:54:49,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:49,882 INFO L124 PetriNetUnfolderBase]: 8488/11014 cut-off events. [2023-08-04 02:54:49,882 INFO L125 PetriNetUnfolderBase]: For 832/832 co-relation queries the response was YES. [2023-08-04 02:54:49,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22260 conditions, 11014 events. 8488/11014 cut-off events. For 832/832 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 13423. Up to 10389 conditions per place. [2023-08-04 02:54:49,941 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 40 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-04 02:54:49,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 234 flow [2023-08-04 02:54:49,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:54:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:54:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-08-04 02:54:49,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4977973568281938 [2023-08-04 02:54:49,943 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-08-04 02:54:49,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-08-04 02:54:49,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:49,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-08-04 02:54:49,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:49,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:49,945 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:49,945 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 134 flow. Second operand 3 states and 339 transitions. [2023-08-04 02:54:49,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 234 flow [2023-08-04 02:54:49,949 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 02:54:49,951 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 138 flow [2023-08-04 02:54:49,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, 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 02:54:49,952 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-04 02:54:49,952 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 138 flow [2023-08-04 02:54:49,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 02:54:49,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:49,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:49,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-04 02:54:50,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:50,158 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:50,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:50,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1560264688, now seen corresponding path program 1 times [2023-08-04 02:54:50,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:50,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094541298] [2023-08-04 02:54:50,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:50,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 02:54:50,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:50,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094541298] [2023-08-04 02:54:50,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094541298] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:50,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114656835] [2023-08-04 02:54:50,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:50,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:50,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:50,199 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:54:50,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 02:54:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:50,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:54:50,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 02:54:50,260 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:50,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114656835] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:50,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:50,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 02:54:50,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198435599] [2023-08-04 02:54:50,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:50,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:50,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:50,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:50,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:50,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 227 [2023-08-04 02:54:50,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:50,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:50,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 227 [2023-08-04 02:54:50,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:50,642 INFO L124 PetriNetUnfolderBase]: 7283/9572 cut-off events. [2023-08-04 02:54:50,642 INFO L125 PetriNetUnfolderBase]: For 574/574 co-relation queries the response was YES. [2023-08-04 02:54:50,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19645 conditions, 9572 events. 7283/9572 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 43233 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 02:54:50,672 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 47 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-04 02:54:50,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 274 flow [2023-08-04 02:54:50,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:54:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:54:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-08-04 02:54:50,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066079295154186 [2023-08-04 02:54:50,674 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-08-04 02:54:50,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-08-04 02:54:50,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:50,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-08-04 02:54:50,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:50,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:50,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:50,676 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 138 flow. Second operand 3 states and 345 transitions. [2023-08-04 02:54:50,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 274 flow [2023-08-04 02:54:50,677 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 02:54:50,678 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 148 flow [2023-08-04 02:54:50,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, 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 02:54:50,679 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-04 02:54:50,679 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 148 flow [2023-08-04 02:54:50,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:50,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:50,679 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 02:54:50,685 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 02:54:50,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:50,884 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:50,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:50,884 INFO L85 PathProgramCache]: Analyzing trace with hash 941320219, now seen corresponding path program 1 times [2023-08-04 02:54:50,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:50,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902516382] [2023-08-04 02:54:50,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:50,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 02:54:50,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:50,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902516382] [2023-08-04 02:54:50,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902516382] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:50,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728622132] [2023-08-04 02:54:50,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:50,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:50,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:50,959 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:54:50,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 02:54:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:51,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:54:51,019 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 02:54:51,025 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:54:51,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728622132] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:51,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:54:51,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 02:54:51,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371435581] [2023-08-04 02:54:51,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:51,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:51,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:51,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:51,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:51,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 227 [2023-08-04 02:54:51,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:51,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:51,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 227 [2023-08-04 02:54:51,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:51,527 INFO L124 PetriNetUnfolderBase]: 7160/9501 cut-off events. [2023-08-04 02:54:51,527 INFO L125 PetriNetUnfolderBase]: For 1412/1412 co-relation queries the response was YES. [2023-08-04 02:54:51,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20205 conditions, 9501 events. 7160/9501 cut-off events. For 1412/1412 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 43150 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 02:54:51,569 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 48 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-04 02:54:51,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 286 flow [2023-08-04 02:54:51,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:54:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:54:51,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-08-04 02:54:51,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066079295154186 [2023-08-04 02:54:51,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-08-04 02:54:51,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-08-04 02:54:51,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:51,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-08-04 02:54:51,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:51,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:51,573 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:51,574 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 148 flow. Second operand 3 states and 345 transitions. [2023-08-04 02:54:51,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 286 flow [2023-08-04 02:54:51,578 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 02:54:51,579 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 158 flow [2023-08-04 02:54:51,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, 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 02:54:51,581 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-04 02:54:51,581 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 158 flow [2023-08-04 02:54:51,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:51,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:51,581 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 02:54:51,593 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 02:54:51,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:51,787 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:51,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:51,787 INFO L85 PathProgramCache]: Analyzing trace with hash 38489274, now seen corresponding path program 1 times [2023-08-04 02:54:51,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:51,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628031508] [2023-08-04 02:54:51,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:51,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 02:54:51,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:51,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628031508] [2023-08-04 02:54:51,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628031508] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:51,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951730157] [2023-08-04 02:54:51,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:51,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:51,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:51,827 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:54:51,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-04 02:54:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:51,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:54:51,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 02:54:51,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 02:54:51,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951730157] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:51,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:51,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 02:54:51,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643473197] [2023-08-04 02:54:51,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:51,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:51,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:51,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:51,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:51,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2023-08-04 02:54:51,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:51,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:51,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2023-08-04 02:54:51,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:52,515 INFO L124 PetriNetUnfolderBase]: 6453/8554 cut-off events. [2023-08-04 02:54:52,515 INFO L125 PetriNetUnfolderBase]: For 1116/1116 co-relation queries the response was YES. [2023-08-04 02:54:52,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18389 conditions, 8554 events. 6453/8554 cut-off events. For 1116/1116 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 38295 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 02:54:52,549 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 41 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2023-08-04 02:54:52,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 264 flow [2023-08-04 02:54:52,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:54:52,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:54:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2023-08-04 02:54:52,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4790748898678414 [2023-08-04 02:54:52,551 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 435 transitions. [2023-08-04 02:54:52,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 435 transitions. [2023-08-04 02:54:52,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:52,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 435 transitions. [2023-08-04 02:54:52,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:52,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:52,555 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:52,555 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 158 flow. Second operand 4 states and 435 transitions. [2023-08-04 02:54:52,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 264 flow [2023-08-04 02:54:52,582 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 02:54:52,583 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 170 flow [2023-08-04 02:54:52,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, 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 02:54:52,583 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-04 02:54:52,583 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 170 flow [2023-08-04 02:54:52,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:52,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:52,584 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 02:54:52,589 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 02:54:52,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:52,789 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:52,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:52,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1664691159, now seen corresponding path program 1 times [2023-08-04 02:54:52,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:52,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845832436] [2023-08-04 02:54:52,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:52,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:52,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:54:52,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:52,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845832436] [2023-08-04 02:54:52,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845832436] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:52,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306106352] [2023-08-04 02:54:52,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:52,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:52,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:52,830 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:54:52,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 02:54:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:52,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:54:52,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:54:52,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:54:52,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306106352] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:52,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:52,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 02:54:52,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607620788] [2023-08-04 02:54:52,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:52,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:52,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:52,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:52,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:52,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2023-08-04 02:54:52,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:52,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:52,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2023-08-04 02:54:52,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:53,293 INFO L124 PetriNetUnfolderBase]: 6114/8098 cut-off events. [2023-08-04 02:54:53,293 INFO L125 PetriNetUnfolderBase]: For 774/774 co-relation queries the response was YES. [2023-08-04 02:54:53,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17359 conditions, 8098 events. 6114/8098 cut-off events. For 774/774 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 36535 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 02:54:53,414 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 49 selfloop transitions, 3 changer transitions 1/61 dead transitions. [2023-08-04 02:54:53,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 308 flow [2023-08-04 02:54:53,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:54:53,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:54:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 443 transitions. [2023-08-04 02:54:53,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4878854625550661 [2023-08-04 02:54:53,418 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 443 transitions. [2023-08-04 02:54:53,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 443 transitions. [2023-08-04 02:54:53,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:53,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 443 transitions. [2023-08-04 02:54:53,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:53,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:53,422 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:53,422 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 170 flow. Second operand 4 states and 443 transitions. [2023-08-04 02:54:53,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 308 flow [2023-08-04 02:54:53,431 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 02:54:53,432 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 175 flow [2023-08-04 02:54:53,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, 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 02:54:53,433 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2023-08-04 02:54:53,433 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 175 flow [2023-08-04 02:54:53,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:53,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:53,434 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 02:54:53,450 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 02:54:53,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-04 02:54:53,652 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:53,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:53,652 INFO L85 PathProgramCache]: Analyzing trace with hash -714149794, now seen corresponding path program 1 times [2023-08-04 02:54:53,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:53,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305204112] [2023-08-04 02:54:53,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:53,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:54:53,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:53,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305204112] [2023-08-04 02:54:53,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305204112] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:53,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323908220] [2023-08-04 02:54:53,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:53,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:53,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:53,697 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:54:53,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 02:54:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:53,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:54:53,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:54:53,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:54:53,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323908220] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:53,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:53,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 02:54:53,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72021624] [2023-08-04 02:54:53,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:53,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:53,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:53,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:53,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:53,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2023-08-04 02:54:53,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:53,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:53,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2023-08-04 02:54:53,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:54,102 INFO L124 PetriNetUnfolderBase]: 4136/5529 cut-off events. [2023-08-04 02:54:54,102 INFO L125 PetriNetUnfolderBase]: For 1244/1244 co-relation queries the response was YES. [2023-08-04 02:54:54,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11980 conditions, 5529 events. 4136/5529 cut-off events. For 1244/1244 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 22844 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 02:54:54,126 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 55 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-04 02:54:54,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 67 transitions, 346 flow [2023-08-04 02:54:54,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:54:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:54:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 449 transitions. [2023-08-04 02:54:54,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4944933920704846 [2023-08-04 02:54:54,128 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 449 transitions. [2023-08-04 02:54:54,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 449 transitions. [2023-08-04 02:54:54,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:54,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 449 transitions. [2023-08-04 02:54:54,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:54,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:54,130 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:54,130 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 175 flow. Second operand 4 states and 449 transitions. [2023-08-04 02:54:54,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 67 transitions, 346 flow [2023-08-04 02:54:54,136 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 02:54:54,137 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 186 flow [2023-08-04 02:54:54,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, 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 02:54:54,137 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-04 02:54:54,137 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 186 flow [2023-08-04 02:54:54,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:54,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:54,138 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 02:54:54,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 02:54:54,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:54,343 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:54,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:54,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1907988772, now seen corresponding path program 1 times [2023-08-04 02:54:54,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:54,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275009557] [2023-08-04 02:54:54,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:54,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:54:54,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:54,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275009557] [2023-08-04 02:54:54,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275009557] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:54,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776151106] [2023-08-04 02:54:54,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:54,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:54,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:54,419 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:54:54,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-04 02:54:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:54,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:54:54,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:54:54,478 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:54:54,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776151106] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:54,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:54,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 02:54:54,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836218824] [2023-08-04 02:54:54,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:54,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:54,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:54,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:54,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:54,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 227 [2023-08-04 02:54:54,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:54,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:54,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 227 [2023-08-04 02:54:54,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:54,827 INFO L124 PetriNetUnfolderBase]: 4120/5502 cut-off events. [2023-08-04 02:54:54,828 INFO L125 PetriNetUnfolderBase]: For 2134/2134 co-relation queries the response was YES. [2023-08-04 02:54:54,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12516 conditions, 5502 events. 4120/5502 cut-off events. For 2134/2134 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 22688 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 02:54:54,844 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 55 selfloop transitions, 3 changer transitions 2/68 dead transitions. [2023-08-04 02:54:54,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 358 flow [2023-08-04 02:54:54,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:54:54,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:54:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 449 transitions. [2023-08-04 02:54:54,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4944933920704846 [2023-08-04 02:54:54,846 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 449 transitions. [2023-08-04 02:54:54,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 449 transitions. [2023-08-04 02:54:54,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:54,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 449 transitions. [2023-08-04 02:54:54,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:54,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:54,848 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:54,848 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 186 flow. Second operand 4 states and 449 transitions. [2023-08-04 02:54:54,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 358 flow [2023-08-04 02:54:54,856 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 02:54:54,857 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 190 flow [2023-08-04 02:54:54,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, 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 02:54:54,857 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-04 02:54:54,857 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 190 flow [2023-08-04 02:54:54,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:54,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:54,858 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 02:54:54,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-04 02:54:55,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 02:54:55,063 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:55,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:55,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1193566240, now seen corresponding path program 1 times [2023-08-04 02:54:55,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:55,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713086532] [2023-08-04 02:54:55,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:55,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-04 02:54:55,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:55,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713086532] [2023-08-04 02:54:55,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713086532] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:55,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:54:55,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 02:54:55,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404084844] [2023-08-04 02:54:55,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:55,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:54:55,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:55,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:54:55,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:54:55,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 227 [2023-08-04 02:54:55,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:55,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:55,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 227 [2023-08-04 02:54:55,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:55,485 INFO L124 PetriNetUnfolderBase]: 4362/5806 cut-off events. [2023-08-04 02:54:55,485 INFO L125 PetriNetUnfolderBase]: For 3141/3141 co-relation queries the response was YES. [2023-08-04 02:54:55,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13540 conditions, 5806 events. 4362/5806 cut-off events. For 3141/3141 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 24178 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 02:54:55,513 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 65 selfloop transitions, 3 changer transitions 1/77 dead transitions. [2023-08-04 02:54:55,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 77 transitions, 482 flow [2023-08-04 02:54:55,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:54:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:54:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-04 02:54:55,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5433186490455213 [2023-08-04 02:54:55,515 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-04 02:54:55,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-04 02:54:55,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:55,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-04 02:54:55,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:55,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:55,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:55,517 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 190 flow. Second operand 3 states and 370 transitions. [2023-08-04 02:54:55,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 77 transitions, 482 flow [2023-08-04 02:54:55,525 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 02:54:55,526 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 205 flow [2023-08-04 02:54:55,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, 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 02:54:55,527 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-04 02:54:55,527 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 205 flow [2023-08-04 02:54:55,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:55,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:55,527 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:55,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-04 02:54:55,528 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:55,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:55,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1749529175, now seen corresponding path program 1 times [2023-08-04 02:54:55,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:55,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637210820] [2023-08-04 02:54:55,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:55,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:55,583 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 02:54:55,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:55,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637210820] [2023-08-04 02:54:55,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637210820] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:54:55,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:54:55,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:54:55,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657097209] [2023-08-04 02:54:55,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:54:55,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:54:55,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:55,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:54:55,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:54:55,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 227 [2023-08-04 02:54:55,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:55,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:55,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 227 [2023-08-04 02:54:55,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:56,218 INFO L124 PetriNetUnfolderBase]: 6561/9235 cut-off events. [2023-08-04 02:54:56,218 INFO L125 PetriNetUnfolderBase]: For 6017/6017 co-relation queries the response was YES. [2023-08-04 02:54:56,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24462 conditions, 9235 events. 6561/9235 cut-off events. For 6017/6017 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 48198 event pairs, 1914 based on Foata normal form. 73/9308 useless extension candidates. Maximal degree in co-relation 23929. Up to 4587 conditions per place. [2023-08-04 02:54:56,247 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 101 selfloop transitions, 4 changer transitions 30/141 dead transitions. [2023-08-04 02:54:56,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 141 transitions, 917 flow [2023-08-04 02:54:56,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:54:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:54:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2023-08-04 02:54:56,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224669603524229 [2023-08-04 02:54:56,249 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2023-08-04 02:54:56,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2023-08-04 02:54:56,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:56,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2023-08-04 02:54:56,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:56,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:56,252 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:56,252 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 205 flow. Second operand 5 states and 593 transitions. [2023-08-04 02:54:56,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 141 transitions, 917 flow [2023-08-04 02:54:56,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 141 transitions, 912 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:54:56,270 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 229 flow [2023-08-04 02:54:56,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, 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=229, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2023-08-04 02:54:56,270 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-08-04 02:54:56,270 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 229 flow [2023-08-04 02:54:56,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:56,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:56,271 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:56,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 02:54:56,271 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:56,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:56,271 INFO L85 PathProgramCache]: Analyzing trace with hash -742439215, now seen corresponding path program 1 times [2023-08-04 02:54:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:56,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548269566] [2023-08-04 02:54:56,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:54:56,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:56,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548269566] [2023-08-04 02:54:56,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548269566] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:56,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770238762] [2023-08-04 02:54:56,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:56,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:56,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:56,323 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:54:56,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-04 02:54:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:56,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:54:56,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:54:56,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:56,454 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:54:56,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770238762] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:56,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:56,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-04 02:54:56,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259408567] [2023-08-04 02:54:56,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:56,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 02:54:56,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:56,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 02:54:56,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-04 02:54:56,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2023-08-04 02:54:56,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 229 flow. Second operand has 8 states, 8 states have (on average 97.375) internal successors, (779), 8 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:56,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:56,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2023-08-04 02:54:56,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:57,248 INFO L124 PetriNetUnfolderBase]: 6994/9771 cut-off events. [2023-08-04 02:54:57,249 INFO L125 PetriNetUnfolderBase]: For 10234/10240 co-relation queries the response was YES. [2023-08-04 02:54:57,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28427 conditions, 9771 events. 6994/9771 cut-off events. For 10234/10240 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 48764 event pairs, 2522 based on Foata normal form. 202/9973 useless extension candidates. Maximal degree in co-relation 27933. Up to 3683 conditions per place. [2023-08-04 02:54:57,299 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 130 selfloop transitions, 5 changer transitions 0/141 dead transitions. [2023-08-04 02:54:57,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 141 transitions, 944 flow [2023-08-04 02:54:57,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:54:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:54:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2023-08-04 02:54:57,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154185022026432 [2023-08-04 02:54:57,301 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 585 transitions. [2023-08-04 02:54:57,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 585 transitions. [2023-08-04 02:54:57,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:57,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 585 transitions. [2023-08-04 02:54:57,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:57,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:57,304 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:57,304 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 229 flow. Second operand 5 states and 585 transitions. [2023-08-04 02:54:57,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 141 transitions, 944 flow [2023-08-04 02:54:57,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 141 transitions, 933 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-04 02:54:57,335 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 250 flow [2023-08-04 02:54:57,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=250, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2023-08-04 02:54:57,336 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2023-08-04 02:54:57,336 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 250 flow [2023-08-04 02:54:57,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.375) internal successors, (779), 8 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:57,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:57,336 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:57,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 02:54:57,541 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,SelfDestructingSolverStorable15 [2023-08-04 02:54:57,541 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:57,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:57,542 INFO L85 PathProgramCache]: Analyzing trace with hash -213344275, now seen corresponding path program 1 times [2023-08-04 02:54:57,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:57,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705875312] [2023-08-04 02:54:57,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:57,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:54:57,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:57,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705875312] [2023-08-04 02:54:57,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705875312] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:57,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769262909] [2023-08-04 02:54:57,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:57,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:57,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:57,607 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:54:57,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-04 02:54:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:57,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:54:57,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:54:57,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:54:57,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769262909] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:57,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:57,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-04 02:54:57,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195268636] [2023-08-04 02:54:57,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:57,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 02:54:57,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:57,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 02:54:57,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-04 02:54:57,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2023-08-04 02:54:57,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 250 flow. Second operand has 8 states, 8 states have (on average 97.375) internal successors, (779), 8 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:57,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:57,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2023-08-04 02:54:57,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:54:58,901 INFO L124 PetriNetUnfolderBase]: 9644/13130 cut-off events. [2023-08-04 02:54:58,901 INFO L125 PetriNetUnfolderBase]: For 16977/16977 co-relation queries the response was YES. [2023-08-04 02:54:58,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40673 conditions, 13130 events. 9644/13130 cut-off events. For 16977/16977 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 66060 event pairs, 2579 based on Foata normal form. 196/13326 useless extension candidates. Maximal degree in co-relation 39990. Up to 6301 conditions per place. [2023-08-04 02:54:58,965 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 127 selfloop transitions, 7 changer transitions 1/141 dead transitions. [2023-08-04 02:54:58,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 141 transitions, 973 flow [2023-08-04 02:54:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:54:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:54:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions. [2023-08-04 02:54:58,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5118942731277533 [2023-08-04 02:54:58,968 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 581 transitions. [2023-08-04 02:54:58,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 581 transitions. [2023-08-04 02:54:58,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:54:58,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 581 transitions. [2023-08-04 02:54:58,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:58,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:58,973 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:58,973 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 250 flow. Second operand 5 states and 581 transitions. [2023-08-04 02:54:58,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 141 transitions, 973 flow [2023-08-04 02:54:59,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 141 transitions, 959 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-04 02:54:59,025 INFO L231 Difference]: Finished difference. Result has 71 places, 54 transitions, 292 flow [2023-08-04 02:54:59,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=71, PETRI_TRANSITIONS=54} [2023-08-04 02:54:59,025 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2023-08-04 02:54:59,025 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 54 transitions, 292 flow [2023-08-04 02:54:59,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.375) internal successors, (779), 8 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:59,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:54:59,026 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:54:59,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-04 02:54:59,234 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,SelfDestructingSolverStorable16 [2023-08-04 02:54:59,234 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:54:59,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:54:59,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1951593701, now seen corresponding path program 2 times [2023-08-04 02:54:59,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:54:59,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107277966] [2023-08-04 02:54:59,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:54:59,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:54:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:54:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 02:54:59,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:54:59,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107277966] [2023-08-04 02:54:59,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107277966] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:54:59,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374655494] [2023-08-04 02:54:59,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:54:59,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:54:59,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:54:59,312 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 02:54:59,315 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 02:54:59,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:54:59,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:54:59,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:54:59,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:54:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 02:54:59,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:54:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 02:54:59,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374655494] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:54:59,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:54:59,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-04 02:54:59,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186278392] [2023-08-04 02:54:59,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:54:59,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 02:54:59,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:54:59,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 02:54:59,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-04 02:54:59,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2023-08-04 02:54:59,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 54 transitions, 292 flow. Second operand has 10 states, 10 states have (on average 98.9) internal successors, (989), 10 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:54:59,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:54:59,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2023-08-04 02:54:59,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:01,278 INFO L124 PetriNetUnfolderBase]: 13658/19035 cut-off events. [2023-08-04 02:55:01,279 INFO L125 PetriNetUnfolderBase]: For 35982/35982 co-relation queries the response was YES. [2023-08-04 02:55:01,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61062 conditions, 19035 events. 13658/19035 cut-off events. For 35982/35982 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 108041 event pairs, 2487 based on Foata normal form. 271/19301 useless extension candidates. Maximal degree in co-relation 59829. Up to 6204 conditions per place. [2023-08-04 02:55:01,385 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 245 selfloop transitions, 21 changer transitions 29/301 dead transitions. [2023-08-04 02:55:01,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 301 transitions, 2158 flow [2023-08-04 02:55:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 02:55:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 02:55:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1283 transitions. [2023-08-04 02:55:01,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.513816579895875 [2023-08-04 02:55:01,390 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1283 transitions. [2023-08-04 02:55:01,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1283 transitions. [2023-08-04 02:55:01,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:01,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1283 transitions. [2023-08-04 02:55:01,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 116.63636363636364) internal successors, (1283), 11 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:01,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 227.0) internal successors, (2724), 12 states have internal predecessors, (2724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:01,397 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 227.0) internal successors, (2724), 12 states have internal predecessors, (2724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:01,397 INFO L175 Difference]: Start difference. First operand has 71 places, 54 transitions, 292 flow. Second operand 11 states and 1283 transitions. [2023-08-04 02:55:01,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 301 transitions, 2158 flow [2023-08-04 02:55:01,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 301 transitions, 2155 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:55:01,539 INFO L231 Difference]: Finished difference. Result has 87 places, 70 transitions, 483 flow [2023-08-04 02:55:01,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=483, PETRI_PLACES=87, PETRI_TRANSITIONS=70} [2023-08-04 02:55:01,539 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 46 predicate places. [2023-08-04 02:55:01,539 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 70 transitions, 483 flow [2023-08-04 02:55:01,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 98.9) internal successors, (989), 10 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:01,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:01,540 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:55:01,548 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 02:55:01,746 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,SelfDestructingSolverStorable17 [2023-08-04 02:55:01,746 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:01,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:01,746 INFO L85 PathProgramCache]: Analyzing trace with hash 696916513, now seen corresponding path program 2 times [2023-08-04 02:55:01,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:01,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154195890] [2023-08-04 02:55:01,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:01,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 02:55:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:01,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154195890] [2023-08-04 02:55:01,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154195890] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:01,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203585111] [2023-08-04 02:55:01,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:55:01,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:01,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:01,790 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 02:55:01,830 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 02:55:01,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:55:01,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:55:01,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:55:01,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:01,889 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 02:55:01,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:55:01,906 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 02:55:01,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203585111] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:55:01,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:55:01,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-04 02:55:01,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263675194] [2023-08-04 02:55:01,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:55:01,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 02:55:01,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:01,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 02:55:01,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-04 02:55:01,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2023-08-04 02:55:01,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 70 transitions, 483 flow. Second operand has 8 states, 8 states have (on average 97.625) internal successors, (781), 8 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:01,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:01,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2023-08-04 02:55:01,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:03,430 INFO L124 PetriNetUnfolderBase]: 13842/19295 cut-off events. [2023-08-04 02:55:03,430 INFO L125 PetriNetUnfolderBase]: For 49089/49528 co-relation queries the response was YES. [2023-08-04 02:55:03,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70291 conditions, 19295 events. 13842/19295 cut-off events. For 49089/49528 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 108573 event pairs, 2172 based on Foata normal form. 922/20102 useless extension candidates. Maximal degree in co-relation 69067. Up to 8791 conditions per place. [2023-08-04 02:55:03,604 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 138 selfloop transitions, 15 changer transitions 0/161 dead transitions. [2023-08-04 02:55:03,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 161 transitions, 1270 flow [2023-08-04 02:55:03,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:55:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:55:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2023-08-04 02:55:03,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5127753303964758 [2023-08-04 02:55:03,606 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 582 transitions. [2023-08-04 02:55:03,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 582 transitions. [2023-08-04 02:55:03,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:03,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 582 transitions. [2023-08-04 02:55:03,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:03,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:03,608 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:03,608 INFO L175 Difference]: Start difference. First operand has 87 places, 70 transitions, 483 flow. Second operand 5 states and 582 transitions. [2023-08-04 02:55:03,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 161 transitions, 1270 flow [2023-08-04 02:55:04,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 161 transitions, 1252 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-04 02:55:04,161 INFO L231 Difference]: Finished difference. Result has 91 places, 72 transitions, 522 flow [2023-08-04 02:55:04,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=522, PETRI_PLACES=91, PETRI_TRANSITIONS=72} [2023-08-04 02:55:04,161 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 50 predicate places. [2023-08-04 02:55:04,162 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 72 transitions, 522 flow [2023-08-04 02:55:04,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.625) internal successors, (781), 8 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:04,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:04,162 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:55:04,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-04 02:55:04,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:04,363 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:04,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:04,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1595718327, now seen corresponding path program 1 times [2023-08-04 02:55:04,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:04,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159323971] [2023-08-04 02:55:04,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:04,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 02:55:04,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:04,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159323971] [2023-08-04 02:55:04,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159323971] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:04,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:04,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:55:04,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787314659] [2023-08-04 02:55:04,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:04,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:55:04,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:04,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:55:04,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:55:04,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 227 [2023-08-04 02:55:04,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 72 transitions, 522 flow. Second operand has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:04,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:04,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 227 [2023-08-04 02:55:04,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:07,461 INFO L124 PetriNetUnfolderBase]: 22696/32226 cut-off events. [2023-08-04 02:55:07,462 INFO L125 PetriNetUnfolderBase]: For 118489/119746 co-relation queries the response was YES. [2023-08-04 02:55:07,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123139 conditions, 32226 events. 22696/32226 cut-off events. For 118489/119746 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 201436 event pairs, 6292 based on Foata normal form. 1589/33707 useless extension candidates. Maximal degree in co-relation 120541. Up to 14926 conditions per place. [2023-08-04 02:55:07,681 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 187 selfloop transitions, 6 changer transitions 3/204 dead transitions. [2023-08-04 02:55:07,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 204 transitions, 1918 flow [2023-08-04 02:55:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:55:07,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:55:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2023-08-04 02:55:07,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136563876651983 [2023-08-04 02:55:07,683 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 583 transitions. [2023-08-04 02:55:07,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 583 transitions. [2023-08-04 02:55:07,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:07,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 583 transitions. [2023-08-04 02:55:07,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:07,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:07,687 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:07,687 INFO L175 Difference]: Start difference. First operand has 91 places, 72 transitions, 522 flow. Second operand 5 states and 583 transitions. [2023-08-04 02:55:07,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 204 transitions, 1918 flow [2023-08-04 02:55:08,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 204 transitions, 1865 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 02:55:08,093 INFO L231 Difference]: Finished difference. Result has 96 places, 75 transitions, 572 flow [2023-08-04 02:55:08,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=572, PETRI_PLACES=96, PETRI_TRANSITIONS=75} [2023-08-04 02:55:08,093 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places. [2023-08-04 02:55:08,094 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 75 transitions, 572 flow [2023-08-04 02:55:08,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:08,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:08,094 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:55:08,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-04 02:55:08,094 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:08,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:08,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1448602761, now seen corresponding path program 3 times [2023-08-04 02:55:08,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:08,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236989136] [2023-08-04 02:55:08,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:08,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:55:08,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:08,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236989136] [2023-08-04 02:55:08,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236989136] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:08,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:08,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:55:08,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147106626] [2023-08-04 02:55:08,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:08,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:55:08,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:08,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:55:08,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:55:08,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 227 [2023-08-04 02:55:08,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 75 transitions, 572 flow. Second operand has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:08,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:08,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 227 [2023-08-04 02:55:08,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:10,989 INFO L124 PetriNetUnfolderBase]: 20251/29223 cut-off events. [2023-08-04 02:55:10,990 INFO L125 PetriNetUnfolderBase]: For 116431/119327 co-relation queries the response was YES. [2023-08-04 02:55:11,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118016 conditions, 29223 events. 20251/29223 cut-off events. For 116431/119327 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 185549 event pairs, 7938 based on Foata normal form. 3087/32077 useless extension candidates. Maximal degree in co-relation 115457. Up to 18688 conditions per place. [2023-08-04 02:55:11,211 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 139 selfloop transitions, 12 changer transitions 30/188 dead transitions. [2023-08-04 02:55:11,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 188 transitions, 1601 flow [2023-08-04 02:55:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 02:55:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 02:55:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 699 transitions. [2023-08-04 02:55:11,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.513215859030837 [2023-08-04 02:55:11,213 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 699 transitions. [2023-08-04 02:55:11,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 699 transitions. [2023-08-04 02:55:11,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:11,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 699 transitions. [2023-08-04 02:55:11,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:11,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 227.0) internal successors, (1589), 7 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:11,217 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 227.0) internal successors, (1589), 7 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:11,218 INFO L175 Difference]: Start difference. First operand has 96 places, 75 transitions, 572 flow. Second operand 6 states and 699 transitions. [2023-08-04 02:55:11,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 188 transitions, 1601 flow [2023-08-04 02:55:11,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 188 transitions, 1571 flow, removed 11 selfloop flow, removed 1 redundant places. [2023-08-04 02:55:11,653 INFO L231 Difference]: Finished difference. Result has 102 places, 78 transitions, 640 flow [2023-08-04 02:55:11,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=640, PETRI_PLACES=102, PETRI_TRANSITIONS=78} [2023-08-04 02:55:11,654 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places. [2023-08-04 02:55:11,654 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 78 transitions, 640 flow [2023-08-04 02:55:11,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:11,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:11,654 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:55:11,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-04 02:55:11,654 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:11,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:11,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1236952443, now seen corresponding path program 3 times [2023-08-04 02:55:11,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:11,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912280122] [2023-08-04 02:55:11,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:11,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 02:55:11,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:11,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912280122] [2023-08-04 02:55:11,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912280122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:11,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:11,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:55:11,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967029411] [2023-08-04 02:55:11,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:11,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:55:11,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:11,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:55:11,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:55:11,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 227 [2023-08-04 02:55:11,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 78 transitions, 640 flow. Second operand has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:11,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:11,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 227 [2023-08-04 02:55:11,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:14,872 INFO L124 PetriNetUnfolderBase]: 23806/34086 cut-off events. [2023-08-04 02:55:14,872 INFO L125 PetriNetUnfolderBase]: For 154414/156358 co-relation queries the response was YES. [2023-08-04 02:55:15,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138303 conditions, 34086 events. 23806/34086 cut-off events. For 154414/156358 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 215646 event pairs, 8601 based on Foata normal form. 2251/36297 useless extension candidates. Maximal degree in co-relation 135603. Up to 18112 conditions per place. [2023-08-04 02:55:15,135 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 166 selfloop transitions, 34 changer transitions 3/211 dead transitions. [2023-08-04 02:55:15,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 211 transitions, 1924 flow [2023-08-04 02:55:15,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 02:55:15,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 02:55:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 702 transitions. [2023-08-04 02:55:15,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154185022026432 [2023-08-04 02:55:15,137 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 702 transitions. [2023-08-04 02:55:15,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 702 transitions. [2023-08-04 02:55:15,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:15,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 702 transitions. [2023-08-04 02:55:15,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:15,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 227.0) internal successors, (1589), 7 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:15,140 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 227.0) internal successors, (1589), 7 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:15,141 INFO L175 Difference]: Start difference. First operand has 102 places, 78 transitions, 640 flow. Second operand 6 states and 702 transitions. [2023-08-04 02:55:15,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 211 transitions, 1924 flow [2023-08-04 02:55:15,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 211 transitions, 1880 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-04 02:55:15,539 INFO L231 Difference]: Finished difference. Result has 106 places, 97 transitions, 941 flow [2023-08-04 02:55:15,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=106, PETRI_TRANSITIONS=97} [2023-08-04 02:55:15,540 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 65 predicate places. [2023-08-04 02:55:15,540 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 97 transitions, 941 flow [2023-08-04 02:55:15,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:15,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:15,541 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:55:15,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-04 02:55:15,541 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:15,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:15,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1235710403, now seen corresponding path program 4 times [2023-08-04 02:55:15,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:15,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240935339] [2023-08-04 02:55:15,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:15,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:55:15,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:15,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240935339] [2023-08-04 02:55:15,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240935339] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:15,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575942816] [2023-08-04 02:55:15,583 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 02:55:15,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:15,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:15,599 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 02:55:15,622 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 02:55:15,688 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 02:55:15,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:55:15,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:55:15,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:15,710 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:55:15,710 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:55:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:55:15,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575942816] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:55:15,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:55:15,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-04 02:55:15,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506472785] [2023-08-04 02:55:15,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:55:15,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 02:55:15,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:15,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 02:55:15,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-04 02:55:15,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2023-08-04 02:55:15,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 97 transitions, 941 flow. Second operand has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:15,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:15,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2023-08-04 02:55:15,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:19,728 INFO L124 PetriNetUnfolderBase]: 25476/36128 cut-off events. [2023-08-04 02:55:19,729 INFO L125 PetriNetUnfolderBase]: For 180845/184475 co-relation queries the response was YES. [2023-08-04 02:55:19,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153256 conditions, 36128 events. 25476/36128 cut-off events. For 180845/184475 co-relation queries the response was YES. Maximal size of possible extension queue 1165. Compared 228837 event pairs, 8408 based on Foata normal form. 3605/39572 useless extension candidates. Maximal degree in co-relation 150442. Up to 15595 conditions per place. [2023-08-04 02:55:20,071 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 229 selfloop transitions, 31 changer transitions 1/270 dead transitions. [2023-08-04 02:55:20,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 270 transitions, 2455 flow [2023-08-04 02:55:20,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 02:55:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 02:55:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 931 transitions. [2023-08-04 02:55:20,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126651982378855 [2023-08-04 02:55:20,074 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 931 transitions. [2023-08-04 02:55:20,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 931 transitions. [2023-08-04 02:55:20,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:20,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 931 transitions. [2023-08-04 02:55:20,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.375) internal successors, (931), 8 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:20,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 227.0) internal successors, (2043), 9 states have internal predecessors, (2043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:20,078 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 227.0) internal successors, (2043), 9 states have internal predecessors, (2043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:20,078 INFO L175 Difference]: Start difference. First operand has 106 places, 97 transitions, 941 flow. Second operand 8 states and 931 transitions. [2023-08-04 02:55:20,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 270 transitions, 2455 flow [2023-08-04 02:55:21,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 270 transitions, 2431 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-04 02:55:21,326 INFO L231 Difference]: Finished difference. Result has 115 places, 100 transitions, 1021 flow [2023-08-04 02:55:21,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1021, PETRI_PLACES=115, PETRI_TRANSITIONS=100} [2023-08-04 02:55:21,326 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2023-08-04 02:55:21,327 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 100 transitions, 1021 flow [2023-08-04 02:55:21,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:21,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:21,327 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:55:21,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-04 02:55:21,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:21,533 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:21,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:21,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1066632489, now seen corresponding path program 2 times [2023-08-04 02:55:21,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:21,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750148818] [2023-08-04 02:55:21,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:21,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:55:21,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:21,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750148818] [2023-08-04 02:55:21,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750148818] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:21,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141116758] [2023-08-04 02:55:21,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:55:21,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:21,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:21,631 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 02:55:21,653 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 02:55:21,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:55:21,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:55:21,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:55:21,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:21,753 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:55:21,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:55:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:55:21,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141116758] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:55:21,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:55:21,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-04 02:55:21,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6023193] [2023-08-04 02:55:21,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:55:21,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 02:55:21,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:21,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 02:55:21,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-04 02:55:21,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2023-08-04 02:55:21,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 100 transitions, 1021 flow. Second operand has 10 states, 10 states have (on average 96.8) internal successors, (968), 10 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:21,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:21,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2023-08-04 02:55:21,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:24,824 INFO L124 PetriNetUnfolderBase]: 22431/32040 cut-off events. [2023-08-04 02:55:24,824 INFO L125 PetriNetUnfolderBase]: For 200374/203894 co-relation queries the response was YES. [2023-08-04 02:55:25,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142018 conditions, 32040 events. 22431/32040 cut-off events. For 200374/203894 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 198089 event pairs, 10177 based on Foata normal form. 4081/36004 useless extension candidates. Maximal degree in co-relation 139669. Up to 20121 conditions per place. [2023-08-04 02:55:25,127 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 137 selfloop transitions, 25 changer transitions 3/174 dead transitions. [2023-08-04 02:55:25,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 174 transitions, 1732 flow [2023-08-04 02:55:25,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:55:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:55:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2023-08-04 02:55:25,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066079295154186 [2023-08-04 02:55:25,129 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 575 transitions. [2023-08-04 02:55:25,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 575 transitions. [2023-08-04 02:55:25,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:25,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 575 transitions. [2023-08-04 02:55:25,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:25,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:25,131 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:25,131 INFO L175 Difference]: Start difference. First operand has 115 places, 100 transitions, 1021 flow. Second operand 5 states and 575 transitions. [2023-08-04 02:55:25,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 174 transitions, 1732 flow [2023-08-04 02:55:25,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 174 transitions, 1664 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-08-04 02:55:25,842 INFO L231 Difference]: Finished difference. Result has 112 places, 92 transitions, 910 flow [2023-08-04 02:55:25,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=910, PETRI_PLACES=112, PETRI_TRANSITIONS=92} [2023-08-04 02:55:25,843 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2023-08-04 02:55:25,843 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 92 transitions, 910 flow [2023-08-04 02:55:25,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 96.8) internal successors, (968), 10 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:25,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:25,843 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:55:25,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-08-04 02:55:26,045 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,SelfDestructingSolverStorable23 [2023-08-04 02:55:26,045 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:26,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:26,046 INFO L85 PathProgramCache]: Analyzing trace with hash 504810671, now seen corresponding path program 3 times [2023-08-04 02:55:26,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:26,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356478505] [2023-08-04 02:55:26,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:26,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:26,154 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:55:26,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:26,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356478505] [2023-08-04 02:55:26,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356478505] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:26,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:26,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:55:26,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794290028] [2023-08-04 02:55:26,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:26,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:55:26,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:26,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:55:26,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:55:26,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 227 [2023-08-04 02:55:26,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 92 transitions, 910 flow. Second operand has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:26,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:26,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 227 [2023-08-04 02:55:26,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:28,695 INFO L124 PetriNetUnfolderBase]: 19409/27524 cut-off events. [2023-08-04 02:55:28,695 INFO L125 PetriNetUnfolderBase]: For 171726/174987 co-relation queries the response was YES. [2023-08-04 02:55:28,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118989 conditions, 27524 events. 19409/27524 cut-off events. For 171726/174987 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 163940 event pairs, 8164 based on Foata normal form. 3820/31230 useless extension candidates. Maximal degree in co-relation 117293. Up to 14145 conditions per place. [2023-08-04 02:55:28,948 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 141 selfloop transitions, 17 changer transitions 9/175 dead transitions. [2023-08-04 02:55:28,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 175 transitions, 1726 flow [2023-08-04 02:55:28,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:55:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:55:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2023-08-04 02:55:28,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092511013215859 [2023-08-04 02:55:28,949 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 578 transitions. [2023-08-04 02:55:28,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 578 transitions. [2023-08-04 02:55:28,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:28,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 578 transitions. [2023-08-04 02:55:28,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:28,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:28,952 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:28,952 INFO L175 Difference]: Start difference. First operand has 112 places, 92 transitions, 910 flow. Second operand 5 states and 578 transitions. [2023-08-04 02:55:28,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 175 transitions, 1726 flow [2023-08-04 02:55:29,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 175 transitions, 1668 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-04 02:55:29,448 INFO L231 Difference]: Finished difference. Result has 112 places, 86 transitions, 796 flow [2023-08-04 02:55:29,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=796, PETRI_PLACES=112, PETRI_TRANSITIONS=86} [2023-08-04 02:55:29,448 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places. [2023-08-04 02:55:29,448 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 86 transitions, 796 flow [2023-08-04 02:55:29,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:29,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:29,449 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:55:29,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-04 02:55:29,449 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:29,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:29,449 INFO L85 PathProgramCache]: Analyzing trace with hash 219084673, now seen corresponding path program 5 times [2023-08-04 02:55:29,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:29,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082001192] [2023-08-04 02:55:29,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:29,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:55:29,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:29,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082001192] [2023-08-04 02:55:29,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082001192] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:29,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:29,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:55:29,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424141222] [2023-08-04 02:55:29,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:29,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:55:29,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:29,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:55:29,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:55:29,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 227 [2023-08-04 02:55:29,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 86 transitions, 796 flow. Second operand has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:29,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:29,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 227 [2023-08-04 02:55:29,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:31,349 INFO L124 PetriNetUnfolderBase]: 14839/20704 cut-off events. [2023-08-04 02:55:31,349 INFO L125 PetriNetUnfolderBase]: For 125566/127963 co-relation queries the response was YES. [2023-08-04 02:55:31,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92722 conditions, 20704 events. 14839/20704 cut-off events. For 125566/127963 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 113541 event pairs, 5596 based on Foata normal form. 2728/23306 useless extension candidates. Maximal degree in co-relation 91652. Up to 14246 conditions per place. [2023-08-04 02:55:31,744 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 139 selfloop transitions, 13 changer transitions 3/163 dead transitions. [2023-08-04 02:55:31,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 163 transitions, 1540 flow [2023-08-04 02:55:31,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:55:31,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:55:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2023-08-04 02:55:31,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083700440528635 [2023-08-04 02:55:31,745 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 577 transitions. [2023-08-04 02:55:31,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 577 transitions. [2023-08-04 02:55:31,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:31,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 577 transitions. [2023-08-04 02:55:31,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:31,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:31,761 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:31,762 INFO L175 Difference]: Start difference. First operand has 112 places, 86 transitions, 796 flow. Second operand 5 states and 577 transitions. [2023-08-04 02:55:31,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 163 transitions, 1540 flow [2023-08-04 02:55:31,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 163 transitions, 1452 flow, removed 12 selfloop flow, removed 10 redundant places. [2023-08-04 02:55:31,998 INFO L231 Difference]: Finished difference. Result has 102 places, 85 transitions, 726 flow [2023-08-04 02:55:31,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=726, PETRI_PLACES=102, PETRI_TRANSITIONS=85} [2023-08-04 02:55:31,999 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 61 predicate places. [2023-08-04 02:55:31,999 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 85 transitions, 726 flow [2023-08-04 02:55:31,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:31,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:31,999 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 02:55:31,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-04 02:55:31,999 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:31,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:31,999 INFO L85 PathProgramCache]: Analyzing trace with hash -497083792, now seen corresponding path program 1 times [2023-08-04 02:55:32,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:32,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651019642] [2023-08-04 02:55:32,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:32,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 02:55:32,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:32,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651019642] [2023-08-04 02:55:32,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651019642] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:32,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6353665] [2023-08-04 02:55:32,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:32,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:32,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:32,058 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 02:55:32,095 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 02:55:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:32,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:55:32,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 02:55:32,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:55:32,202 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 02:55:32,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6353665] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:55:32,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:55:32,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-04 02:55:32,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825449689] [2023-08-04 02:55:32,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:55:32,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 02:55:32,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:32,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 02:55:32,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-04 02:55:32,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2023-08-04 02:55:32,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 85 transitions, 726 flow. Second operand has 10 states, 10 states have (on average 96.9) internal successors, (969), 10 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:32,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:32,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2023-08-04 02:55:32,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:34,739 INFO L124 PetriNetUnfolderBase]: 19041/26418 cut-off events. [2023-08-04 02:55:34,739 INFO L125 PetriNetUnfolderBase]: For 117775/118958 co-relation queries the response was YES. [2023-08-04 02:55:34,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113885 conditions, 26418 events. 19041/26418 cut-off events. For 117775/118958 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 149550 event pairs, 5805 based on Foata normal form. 1546/27919 useless extension candidates. Maximal degree in co-relation 112491. Up to 11401 conditions per place. [2023-08-04 02:55:34,921 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 167 selfloop transitions, 21 changer transitions 0/196 dead transitions. [2023-08-04 02:55:34,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 196 transitions, 1919 flow [2023-08-04 02:55:34,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:55:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:55:34,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2023-08-04 02:55:34,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066079295154186 [2023-08-04 02:55:34,923 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 575 transitions. [2023-08-04 02:55:34,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 575 transitions. [2023-08-04 02:55:34,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:34,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 575 transitions. [2023-08-04 02:55:34,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:34,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:34,925 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:34,925 INFO L175 Difference]: Start difference. First operand has 102 places, 85 transitions, 726 flow. Second operand 5 states and 575 transitions. [2023-08-04 02:55:34,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 196 transitions, 1919 flow [2023-08-04 02:55:35,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 196 transitions, 1845 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-04 02:55:35,180 INFO L231 Difference]: Finished difference. Result has 104 places, 100 transitions, 985 flow [2023-08-04 02:55:35,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=985, PETRI_PLACES=104, PETRI_TRANSITIONS=100} [2023-08-04 02:55:35,180 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 63 predicate places. [2023-08-04 02:55:35,180 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 100 transitions, 985 flow [2023-08-04 02:55:35,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 96.9) internal successors, (969), 10 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:35,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:35,181 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 02:55:35,188 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 02:55:35,385 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,SelfDestructingSolverStorable26 [2023-08-04 02:55:35,385 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:35,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:35,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1284469114, now seen corresponding path program 2 times [2023-08-04 02:55:35,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:35,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220669912] [2023-08-04 02:55:35,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:35,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 02:55:35,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:35,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220669912] [2023-08-04 02:55:35,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220669912] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:35,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092615048] [2023-08-04 02:55:35,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:55:35,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:35,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:35,424 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 02:55:35,426 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 02:55:35,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:55:35,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:55:35,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:55:35,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 02:55:35,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:55:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 02:55:35,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092615048] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:55:35,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:55:35,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-04 02:55:35,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733290413] [2023-08-04 02:55:35,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:55:35,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 02:55:35,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:35,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 02:55:35,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-04 02:55:35,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 227 [2023-08-04 02:55:35,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 100 transitions, 985 flow. Second operand has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:35,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:35,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 227 [2023-08-04 02:55:35,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:38,841 INFO L124 PetriNetUnfolderBase]: 25134/34918 cut-off events. [2023-08-04 02:55:38,842 INFO L125 PetriNetUnfolderBase]: For 160826/161222 co-relation queries the response was YES. [2023-08-04 02:55:39,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158365 conditions, 34918 events. 25134/34918 cut-off events. For 160826/161222 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 202923 event pairs, 2104 based on Foata normal form. 1780/36658 useless extension candidates. Maximal degree in co-relation 156758. Up to 17013 conditions per place. [2023-08-04 02:55:39,131 INFO L140 encePairwiseOnDemand]: 219/227 looper letters, 243 selfloop transitions, 30 changer transitions 0/285 dead transitions. [2023-08-04 02:55:39,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 285 transitions, 3017 flow [2023-08-04 02:55:39,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-04 02:55:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-04 02:55:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 781 transitions. [2023-08-04 02:55:39,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49150409062303335 [2023-08-04 02:55:39,133 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 781 transitions. [2023-08-04 02:55:39,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 781 transitions. [2023-08-04 02:55:39,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:39,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 781 transitions. [2023-08-04 02:55:39,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.57142857142857) internal successors, (781), 7 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:39,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:39,136 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 227.0) internal successors, (1816), 8 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:39,136 INFO L175 Difference]: Start difference. First operand has 104 places, 100 transitions, 985 flow. Second operand 7 states and 781 transitions. [2023-08-04 02:55:39,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 285 transitions, 3017 flow [2023-08-04 02:55:39,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 285 transitions, 2955 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-08-04 02:55:39,987 INFO L231 Difference]: Finished difference. Result has 113 places, 120 transitions, 1288 flow [2023-08-04 02:55:39,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1288, PETRI_PLACES=113, PETRI_TRANSITIONS=120} [2023-08-04 02:55:39,987 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 72 predicate places. [2023-08-04 02:55:39,987 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 120 transitions, 1288 flow [2023-08-04 02:55:39,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:39,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:39,988 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 02:55:39,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-08-04 02:55:40,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-04 02:55:40,190 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:40,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:40,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1291903500, now seen corresponding path program 3 times [2023-08-04 02:55:40,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:40,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085532018] [2023-08-04 02:55:40,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:40,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:40,283 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 02:55:40,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:40,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085532018] [2023-08-04 02:55:40,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085532018] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:40,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912372297] [2023-08-04 02:55:40,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 02:55:40,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:40,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:40,298 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 02:55:40,307 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 02:55:40,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 02:55:40,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:55:40,383 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-04 02:55:40,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:40,491 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-04 02:55:40,532 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-04 02:55:40,532 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 23 treesize of output 26 [2023-08-04 02:55:40,671 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9 [2023-08-04 02:55:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 02:55:40,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:55:41,158 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 30 [2023-08-04 02:55:41,162 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 46 treesize of output 42 [2023-08-04 02:55:41,181 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 32 [2023-08-04 02:55:41,184 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 50 treesize of output 46 [2023-08-04 02:55:41,398 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 02:55:41,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912372297] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:55:41,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:55:41,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 24 [2023-08-04 02:55:41,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371102413] [2023-08-04 02:55:41,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:55:41,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-04 02:55:41,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:41,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-04 02:55:41,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2023-08-04 02:55:42,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 227 [2023-08-04 02:55:42,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 120 transitions, 1288 flow. Second operand has 24 states, 24 states have (on average 79.83333333333333) internal successors, (1916), 24 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:42,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:42,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 227 [2023-08-04 02:55:42,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:47,153 INFO L124 PetriNetUnfolderBase]: 20868/29154 cut-off events. [2023-08-04 02:55:47,154 INFO L125 PetriNetUnfolderBase]: For 239663/242969 co-relation queries the response was YES. [2023-08-04 02:55:47,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150160 conditions, 29154 events. 20868/29154 cut-off events. For 239663/242969 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 162930 event pairs, 473 based on Foata normal form. 3690/32303 useless extension candidates. Maximal degree in co-relation 148869. Up to 14072 conditions per place. [2023-08-04 02:55:47,416 INFO L140 encePairwiseOnDemand]: 209/227 looper letters, 520 selfloop transitions, 354 changer transitions 9/891 dead transitions. [2023-08-04 02:55:47,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 891 transitions, 11863 flow [2023-08-04 02:55:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-08-04 02:55:47,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-08-04 02:55:47,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 3519 transitions. [2023-08-04 02:55:47,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36910006293266207 [2023-08-04 02:55:47,420 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 3519 transitions. [2023-08-04 02:55:47,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 3519 transitions. [2023-08-04 02:55:47,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:47,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 3519 transitions. [2023-08-04 02:55:47,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 83.78571428571429) internal successors, (3519), 42 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:47,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 227.0) internal successors, (9761), 43 states have internal predecessors, (9761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:47,432 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 227.0) internal successors, (9761), 43 states have internal predecessors, (9761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:47,432 INFO L175 Difference]: Start difference. First operand has 113 places, 120 transitions, 1288 flow. Second operand 42 states and 3519 transitions. [2023-08-04 02:55:47,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 891 transitions, 11863 flow [2023-08-04 02:55:47,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 891 transitions, 11681 flow, removed 34 selfloop flow, removed 2 redundant places. [2023-08-04 02:55:47,880 INFO L231 Difference]: Finished difference. Result has 160 places, 426 transitions, 6464 flow [2023-08-04 02:55:47,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=6464, PETRI_PLACES=160, PETRI_TRANSITIONS=426} [2023-08-04 02:55:47,880 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 119 predicate places. [2023-08-04 02:55:47,880 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 426 transitions, 6464 flow [2023-08-04 02:55:47,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 79.83333333333333) internal successors, (1916), 24 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:47,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:47,881 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 02:55:47,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-08-04 02:55:48,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-04 02:55:48,085 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:48,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:48,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1373830036, now seen corresponding path program 4 times [2023-08-04 02:55:48,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:48,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313630342] [2023-08-04 02:55:48,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:48,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:48,131 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 02:55:48,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313630342] [2023-08-04 02:55:48,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313630342] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:55:48,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:55:48,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:55:48,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001922180] [2023-08-04 02:55:48,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:55:48,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:55:48,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:48,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:55:48,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:55:48,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 227 [2023-08-04 02:55:48,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 426 transitions, 6464 flow. Second operand has 5 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:48,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:48,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 227 [2023-08-04 02:55:48,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:51,341 INFO L124 PetriNetUnfolderBase]: 18575/25738 cut-off events. [2023-08-04 02:55:51,342 INFO L125 PetriNetUnfolderBase]: For 238140/241024 co-relation queries the response was YES. [2023-08-04 02:55:51,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140555 conditions, 25738 events. 18575/25738 cut-off events. For 238140/241024 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 138322 event pairs, 4304 based on Foata normal form. 3137/28374 useless extension candidates. Maximal degree in co-relation 139543. Up to 13733 conditions per place. [2023-08-04 02:55:51,536 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 309 selfloop transitions, 144 changer transitions 30/499 dead transitions. [2023-08-04 02:55:51,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 499 transitions, 7811 flow [2023-08-04 02:55:51,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:55:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:55:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2023-08-04 02:55:51,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4995594713656388 [2023-08-04 02:55:51,538 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 567 transitions. [2023-08-04 02:55:51,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 567 transitions. [2023-08-04 02:55:51,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:51,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 567 transitions. [2023-08-04 02:55:51,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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 02:55:51,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:51,540 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:51,540 INFO L175 Difference]: Start difference. First operand has 160 places, 426 transitions, 6464 flow. Second operand 5 states and 567 transitions. [2023-08-04 02:55:51,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 499 transitions, 7811 flow [2023-08-04 02:55:52,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 499 transitions, 7083 flow, removed 154 selfloop flow, removed 13 redundant places. [2023-08-04 02:55:52,603 INFO L231 Difference]: Finished difference. Result has 151 places, 413 transitions, 5817 flow [2023-08-04 02:55:52,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=5559, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5817, PETRI_PLACES=151, PETRI_TRANSITIONS=413} [2023-08-04 02:55:52,604 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 110 predicate places. [2023-08-04 02:55:52,604 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 413 transitions, 5817 flow [2023-08-04 02:55:52,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:52,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:52,605 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 02:55:52,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-04 02:55:52,605 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:52,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:52,606 INFO L85 PathProgramCache]: Analyzing trace with hash 49318914, now seen corresponding path program 1 times [2023-08-04 02:55:52,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:52,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176014327] [2023-08-04 02:55:52,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:52,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:55:52,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:52,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176014327] [2023-08-04 02:55:52,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176014327] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:52,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232336739] [2023-08-04 02:55:52,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:52,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:52,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:52,678 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:55:52,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-04 02:55:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:52,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:55:52,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:55:52,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:55:52,864 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:55:52,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232336739] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:55:52,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:55:52,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-08-04 02:55:52,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887276772] [2023-08-04 02:55:52,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:55:52,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 02:55:52,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:52,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 02:55:52,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-04 02:55:52,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2023-08-04 02:55:52,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 413 transitions, 5817 flow. Second operand has 8 states, 8 states have (on average 98.75) internal successors, (790), 8 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:52,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:52,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2023-08-04 02:55:52,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:55:56,737 INFO L124 PetriNetUnfolderBase]: 21071/28983 cut-off events. [2023-08-04 02:55:56,737 INFO L125 PetriNetUnfolderBase]: For 256598/259879 co-relation queries the response was YES. [2023-08-04 02:55:56,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151535 conditions, 28983 events. 21071/28983 cut-off events. For 256598/259879 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 158730 event pairs, 3802 based on Foata normal form. 3704/32293 useless extension candidates. Maximal degree in co-relation 150483. Up to 17645 conditions per place. [2023-08-04 02:55:57,001 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 233 selfloop transitions, 254 changer transitions 0/521 dead transitions. [2023-08-04 02:55:57,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 521 transitions, 7554 flow [2023-08-04 02:55:57,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:55:57,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:55:57,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2023-08-04 02:55:57,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066079295154186 [2023-08-04 02:55:57,002 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 575 transitions. [2023-08-04 02:55:57,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 575 transitions. [2023-08-04 02:55:57,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:55:57,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 575 transitions. [2023-08-04 02:55:57,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:57,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:57,004 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:57,004 INFO L175 Difference]: Start difference. First operand has 151 places, 413 transitions, 5817 flow. Second operand 5 states and 575 transitions. [2023-08-04 02:55:57,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 521 transitions, 7554 flow [2023-08-04 02:55:57,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 521 transitions, 6990 flow, removed 52 selfloop flow, removed 6 redundant places. [2023-08-04 02:55:57,909 INFO L231 Difference]: Finished difference. Result has 149 places, 419 transitions, 6060 flow [2023-08-04 02:55:57,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=5300, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=248, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6060, PETRI_PLACES=149, PETRI_TRANSITIONS=419} [2023-08-04 02:55:57,909 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 108 predicate places. [2023-08-04 02:55:57,910 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 419 transitions, 6060 flow [2023-08-04 02:55:57,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.75) internal successors, (790), 8 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:57,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:55:57,925 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 02:55:57,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-04 02:55:58,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-08-04 02:55:58,126 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:55:58,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:55:58,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1015819622, now seen corresponding path program 2 times [2023-08-04 02:55:58,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:55:58,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338310207] [2023-08-04 02:55:58,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:55:58,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:55:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:55:58,176 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 02:55:58,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:55:58,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338310207] [2023-08-04 02:55:58,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338310207] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:55:58,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13623643] [2023-08-04 02:55:58,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:55:58,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:55:58,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:55:58,179 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:55:58,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-04 02:55:58,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:55:58,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:55:58,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:55:58,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:55:58,295 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 02:55:58,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:55:58,313 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 02:55:58,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13623643] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:55:58,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:55:58,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-04 02:55:58,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678410974] [2023-08-04 02:55:58,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:55:58,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 02:55:58,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:55:58,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 02:55:58,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-04 02:55:58,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2023-08-04 02:55:58,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 419 transitions, 6060 flow. Second operand has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:55:58,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:55:58,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2023-08-04 02:55:58,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:56:06,348 INFO L124 PetriNetUnfolderBase]: 40413/56592 cut-off events. [2023-08-04 02:56:06,348 INFO L125 PetriNetUnfolderBase]: For 483065/488550 co-relation queries the response was YES. [2023-08-04 02:56:06,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295373 conditions, 56592 events. 40413/56592 cut-off events. For 483065/488550 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 351013 event pairs, 9577 based on Foata normal form. 5609/61564 useless extension candidates. Maximal degree in co-relation 292731. Up to 27779 conditions per place. [2023-08-04 02:56:06,993 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 706 selfloop transitions, 26 changer transitions 0/823 dead transitions. [2023-08-04 02:56:06,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 823 transitions, 13114 flow [2023-08-04 02:56:06,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:56:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:56:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 568 transitions. [2023-08-04 02:56:06,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5004405286343613 [2023-08-04 02:56:06,994 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 568 transitions. [2023-08-04 02:56:06,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 568 transitions. [2023-08-04 02:56:06,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:56:06,995 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 568 transitions. [2023-08-04 02:56:06,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:06,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:06,996 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:06,996 INFO L175 Difference]: Start difference. First operand has 149 places, 419 transitions, 6060 flow. Second operand 5 states and 568 transitions. [2023-08-04 02:56:06,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 823 transitions, 13114 flow [2023-08-04 02:56:09,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 823 transitions, 12599 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-04 02:56:09,712 INFO L231 Difference]: Finished difference. Result has 154 places, 434 transitions, 6020 flow [2023-08-04 02:56:09,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=5750, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6020, PETRI_PLACES=154, PETRI_TRANSITIONS=434} [2023-08-04 02:56:09,713 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 113 predicate places. [2023-08-04 02:56:09,713 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 434 transitions, 6020 flow [2023-08-04 02:56:09,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 97.0) internal successors, (970), 10 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:09,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:56:09,713 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 02:56:09,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-04 02:56:09,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:56:09,918 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:56:09,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:56:09,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1440843392, now seen corresponding path program 3 times [2023-08-04 02:56:09,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:56:09,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416497111] [2023-08-04 02:56:09,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:56:09,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:56:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:56:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 02:56:09,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:56:09,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416497111] [2023-08-04 02:56:09,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416497111] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:56:09,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:56:09,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:56:09,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895998858] [2023-08-04 02:56:09,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:56:09,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:56:09,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:56:09,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:56:09,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:56:09,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 227 [2023-08-04 02:56:09,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 434 transitions, 6020 flow. Second operand has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:09,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:56:09,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 227 [2023-08-04 02:56:09,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:56:17,269 INFO L124 PetriNetUnfolderBase]: 40030/56217 cut-off events. [2023-08-04 02:56:17,270 INFO L125 PetriNetUnfolderBase]: For 536525/543773 co-relation queries the response was YES. [2023-08-04 02:56:17,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311724 conditions, 56217 events. 40030/56217 cut-off events. For 536525/543773 co-relation queries the response was YES. Maximal size of possible extension queue 1597. Compared 353260 event pairs, 11535 based on Foata normal form. 6151/61507 useless extension candidates. Maximal degree in co-relation 309025. Up to 42555 conditions per place. [2023-08-04 02:56:17,779 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 423 selfloop transitions, 32 changer transitions 46/592 dead transitions. [2023-08-04 02:56:17,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 592 transitions, 8595 flow [2023-08-04 02:56:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:56:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:56:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 562 transitions. [2023-08-04 02:56:17,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4951541850220264 [2023-08-04 02:56:17,782 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 562 transitions. [2023-08-04 02:56:17,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 562 transitions. [2023-08-04 02:56:17,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:56:17,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 562 transitions. [2023-08-04 02:56:17,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:17,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:17,783 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:17,783 INFO L175 Difference]: Start difference. First operand has 154 places, 434 transitions, 6020 flow. Second operand 5 states and 562 transitions. [2023-08-04 02:56:17,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 592 transitions, 8595 flow [2023-08-04 02:56:20,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 592 transitions, 8591 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 02:56:20,947 INFO L231 Difference]: Finished difference. Result has 160 places, 446 transitions, 6280 flow [2023-08-04 02:56:20,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=6016, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6280, PETRI_PLACES=160, PETRI_TRANSITIONS=446} [2023-08-04 02:56:20,948 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 119 predicate places. [2023-08-04 02:56:20,948 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 446 transitions, 6280 flow [2023-08-04 02:56:20,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:20,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:56:20,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, 1, 1] [2023-08-04 02:56:20,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-04 02:56:20,948 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:56:20,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:56:20,948 INFO L85 PathProgramCache]: Analyzing trace with hash 140269834, now seen corresponding path program 4 times [2023-08-04 02:56:20,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:56:20,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650777292] [2023-08-04 02:56:20,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:56:20,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:56:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:56:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 02:56:20,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:56:20,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650777292] [2023-08-04 02:56:20,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650777292] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:56:20,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:56:20,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-04 02:56:20,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222533936] [2023-08-04 02:56:20,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:56:20,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:56:20,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:56:20,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:56:20,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:56:21,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 227 [2023-08-04 02:56:21,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 446 transitions, 6280 flow. Second operand has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:21,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:56:21,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 227 [2023-08-04 02:56:21,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:56:28,399 INFO L124 PetriNetUnfolderBase]: 36027/50551 cut-off events. [2023-08-04 02:56:28,399 INFO L125 PetriNetUnfolderBase]: For 519629/524803 co-relation queries the response was YES. [2023-08-04 02:56:28,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292407 conditions, 50551 events. 36027/50551 cut-off events. For 519629/524803 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 310723 event pairs, 9769 based on Foata normal form. 4977/54765 useless extension candidates. Maximal degree in co-relation 290340. Up to 33331 conditions per place. [2023-08-04 02:56:28,926 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 537 selfloop transitions, 33 changer transitions 8/669 dead transitions. [2023-08-04 02:56:28,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 669 transitions, 9966 flow [2023-08-04 02:56:28,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:56:28,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:56:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2023-08-04 02:56:28,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013215859030837 [2023-08-04 02:56:28,927 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 569 transitions. [2023-08-04 02:56:28,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 569 transitions. [2023-08-04 02:56:28,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:56:28,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 569 transitions. [2023-08-04 02:56:28,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:28,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:28,930 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:28,930 INFO L175 Difference]: Start difference. First operand has 160 places, 446 transitions, 6280 flow. Second operand 5 states and 569 transitions. [2023-08-04 02:56:28,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 669 transitions, 9966 flow [2023-08-04 02:56:31,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 669 transitions, 9921 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-04 02:56:31,831 INFO L231 Difference]: Finished difference. Result has 164 places, 448 transitions, 6346 flow [2023-08-04 02:56:31,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=6235, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6346, PETRI_PLACES=164, PETRI_TRANSITIONS=448} [2023-08-04 02:56:31,831 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 123 predicate places. [2023-08-04 02:56:31,832 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 448 transitions, 6346 flow [2023-08-04 02:56:31,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:31,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:56:31,832 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 02:56:31,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-04 02:56:31,832 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:56:31,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:56:31,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1955223660, now seen corresponding path program 5 times [2023-08-04 02:56:31,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:56:31,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187875599] [2023-08-04 02:56:31,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:56:31,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:56:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:56:31,882 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:56:31,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:56:31,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187875599] [2023-08-04 02:56:31,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187875599] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:56:31,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787833932] [2023-08-04 02:56:31,883 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-04 02:56:31,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:56:31,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:56:31,885 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:56:31,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-04 02:56:31,973 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-04 02:56:31,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:56:31,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:56:31,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:56:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:56:32,010 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:56:32,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787833932] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:56:32,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:56:32,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-08-04 02:56:32,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673540808] [2023-08-04 02:56:32,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:56:32,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:56:32,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:56:32,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:56:32,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-04 02:56:32,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 227 [2023-08-04 02:56:32,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 448 transitions, 6346 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:32,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:56:32,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 227 [2023-08-04 02:56:32,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:56:39,335 INFO L124 PetriNetUnfolderBase]: 36767/51830 cut-off events. [2023-08-04 02:56:39,335 INFO L125 PetriNetUnfolderBase]: For 579067/584082 co-relation queries the response was YES. [2023-08-04 02:56:39,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302615 conditions, 51830 events. 36767/51830 cut-off events. For 579067/584082 co-relation queries the response was YES. Maximal size of possible extension queue 1419. Compared 324253 event pairs, 7662 based on Foata normal form. 5053/56236 useless extension candidates. Maximal degree in co-relation 300471. Up to 25744 conditions per place. [2023-08-04 02:56:39,915 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 660 selfloop transitions, 25 changer transitions 58/834 dead transitions. [2023-08-04 02:56:39,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 834 transitions, 13275 flow [2023-08-04 02:56:39,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:56:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:56:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2023-08-04 02:56:39,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4986784140969163 [2023-08-04 02:56:39,917 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 566 transitions. [2023-08-04 02:56:39,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 566 transitions. [2023-08-04 02:56:39,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:56:39,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 566 transitions. [2023-08-04 02:56:39,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:39,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:39,918 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:39,918 INFO L175 Difference]: Start difference. First operand has 164 places, 448 transitions, 6346 flow. Second operand 5 states and 566 transitions. [2023-08-04 02:56:39,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 834 transitions, 13275 flow [2023-08-04 02:56:42,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 834 transitions, 13188 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-04 02:56:42,278 INFO L231 Difference]: Finished difference. Result has 168 places, 450 transitions, 6408 flow [2023-08-04 02:56:42,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=6279, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6408, PETRI_PLACES=168, PETRI_TRANSITIONS=450} [2023-08-04 02:56:42,280 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 127 predicate places. [2023-08-04 02:56:42,280 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 450 transitions, 6408 flow [2023-08-04 02:56:42,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:42,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:56:42,280 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 02:56:42,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-08-04 02:56:42,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:56:42,484 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:56:42,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:56:42,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1735081870, now seen corresponding path program 6 times [2023-08-04 02:56:42,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:56:42,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842329674] [2023-08-04 02:56:42,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:56:42,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:56:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:56:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:56:42,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:56:42,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842329674] [2023-08-04 02:56:42,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842329674] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:56:42,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829153610] [2023-08-04 02:56:42,526 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-04 02:56:42,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:56:42,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:56:42,542 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:56:42,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-04 02:56:42,624 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-08-04 02:56:42,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:56:42,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:56:42,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:56:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 02:56:42,676 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:56:42,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829153610] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:56:42,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:56:42,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-08-04 02:56:42,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926772364] [2023-08-04 02:56:42,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:56:42,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:56:42,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:56:42,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:56:42,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-04 02:56:42,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 227 [2023-08-04 02:56:42,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 450 transitions, 6408 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 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 02:56:42,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:56:42,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 227 [2023-08-04 02:56:42,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:56:49,321 INFO L124 PetriNetUnfolderBase]: 32091/44871 cut-off events. [2023-08-04 02:56:49,321 INFO L125 PetriNetUnfolderBase]: For 518552/522974 co-relation queries the response was YES. [2023-08-04 02:56:49,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269634 conditions, 44871 events. 32091/44871 cut-off events. For 518552/522974 co-relation queries the response was YES. Maximal size of possible extension queue 1197. Compared 269890 event pairs, 7005 based on Foata normal form. 4481/48753 useless extension candidates. Maximal degree in co-relation 268241. Up to 23900 conditions per place. [2023-08-04 02:56:49,849 INFO L140 encePairwiseOnDemand]: 222/227 looper letters, 621 selfloop transitions, 27 changer transitions 49/788 dead transitions. [2023-08-04 02:56:49,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 788 transitions, 12478 flow [2023-08-04 02:56:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:56:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:56:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2023-08-04 02:56:49,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4995594713656388 [2023-08-04 02:56:49,850 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 567 transitions. [2023-08-04 02:56:49,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 567 transitions. [2023-08-04 02:56:49,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:56:49,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 567 transitions. [2023-08-04 02:56:49,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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 02:56:49,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:49,852 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:49,852 INFO L175 Difference]: Start difference. First operand has 168 places, 450 transitions, 6408 flow. Second operand 5 states and 567 transitions. [2023-08-04 02:56:49,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 788 transitions, 12478 flow [2023-08-04 02:56:52,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 788 transitions, 12436 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-08-04 02:56:52,136 INFO L231 Difference]: Finished difference. Result has 173 places, 451 transitions, 6464 flow [2023-08-04 02:56:52,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=6366, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6464, PETRI_PLACES=173, PETRI_TRANSITIONS=451} [2023-08-04 02:56:52,137 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 132 predicate places. [2023-08-04 02:56:52,137 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 451 transitions, 6464 flow [2023-08-04 02:56:52,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 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 02:56:52,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:56:52,137 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 02:56:52,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-08-04 02:56:52,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:56:52,342 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:56:52,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:56:52,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1741632970, now seen corresponding path program 1 times [2023-08-04 02:56:52,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:56:52,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785234049] [2023-08-04 02:56:52,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:56:52,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:56:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:56:52,455 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 02:56:52,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:56:52,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785234049] [2023-08-04 02:56:52,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785234049] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:56:52,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19043250] [2023-08-04 02:56:52,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:56:52,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:56:52,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:56:52,485 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:56:52,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-04 02:56:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:56:52,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-04 02:56:52,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:56:52,682 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 02:56:52,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:56:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 02:56:52,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19043250] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:56:52,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:56:52,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2023-08-04 02:56:52,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989456277] [2023-08-04 02:56:52,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:56:52,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 02:56:52,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:56:52,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 02:56:52,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 02:56:52,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 227 [2023-08-04 02:56:52,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 451 transitions, 6464 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:56:52,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:56:52,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 227 [2023-08-04 02:56:52,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:57:06,831 INFO L124 PetriNetUnfolderBase]: 62071/88949 cut-off events. [2023-08-04 02:57:06,831 INFO L125 PetriNetUnfolderBase]: For 1069700/1098421 co-relation queries the response was YES. [2023-08-04 02:57:07,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519695 conditions, 88949 events. 62071/88949 cut-off events. For 1069700/1098421 co-relation queries the response was YES. Maximal size of possible extension queue 2644. Compared 631497 event pairs, 9685 based on Foata normal form. 23128/109408 useless extension candidates. Maximal degree in co-relation 516289. Up to 45839 conditions per place. [2023-08-04 02:57:08,084 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 388 selfloop transitions, 376 changer transitions 12/882 dead transitions. [2023-08-04 02:57:08,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 882 transitions, 13905 flow [2023-08-04 02:57:08,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:57:08,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:57:08,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2023-08-04 02:57:08,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5539647577092511 [2023-08-04 02:57:08,086 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 503 transitions. [2023-08-04 02:57:08,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 503 transitions. [2023-08-04 02:57:08,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:57:08,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 503 transitions. [2023-08-04 02:57:08,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:57:08,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:57:08,087 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:57:08,087 INFO L175 Difference]: Start difference. First operand has 173 places, 451 transitions, 6464 flow. Second operand 4 states and 503 transitions. [2023-08-04 02:57:08,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 882 transitions, 13905 flow [2023-08-04 02:57:15,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 882 transitions, 13821 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-04 02:57:15,108 INFO L231 Difference]: Finished difference. Result has 176 places, 761 transitions, 13398 flow [2023-08-04 02:57:15,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=6414, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=13398, PETRI_PLACES=176, PETRI_TRANSITIONS=761} [2023-08-04 02:57:15,109 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 135 predicate places. [2023-08-04 02:57:15,109 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 761 transitions, 13398 flow [2023-08-04 02:57:15,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:57:15,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:57:15,109 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 02:57:15,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-08-04 02:57:15,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-08-04 02:57:15,313 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:57:15,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:57:15,314 INFO L85 PathProgramCache]: Analyzing trace with hash 497529490, now seen corresponding path program 2 times [2023-08-04 02:57:15,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:57:15,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358445148] [2023-08-04 02:57:15,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:57:15,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:57:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:57:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:57:15,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:57:15,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358445148] [2023-08-04 02:57:15,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358445148] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:57:15,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104945363] [2023-08-04 02:57:15,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:57:15,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:57:15,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:57:15,405 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:57:15,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-04 02:57:15,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:57:15,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:57:15,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-04 02:57:15,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:57:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:57:15,586 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:57:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:57:15,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104945363] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:57:15,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:57:15,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-04 02:57:15,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358143828] [2023-08-04 02:57:15,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:57:15,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:57:15,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:57:15,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:57:15,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:57:15,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 227 [2023-08-04 02:57:15,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 761 transitions, 13398 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 02:57:15,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:57:15,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 227 [2023-08-04 02:57:15,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:57:24,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1028], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), 86#thread1EXITtrue, Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), 43#thread2EXITtrue, Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), 3764#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 5040#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 3#L51-4true, 41#L41-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), thread1Thread1of2ForFork0InUse, 4741#true, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:24,878 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 02:57:24,878 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:57:24,878 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:57:24,878 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 02:57:27,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1086], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), 86#thread1EXITtrue, Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, Black: 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), 43#thread2EXITtrue, Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 5040#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), 4741#true, thread1Thread1of2ForFork0InUse, 78#L69-8true, 590#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:27,663 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 02:57:27,663 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:57:27,663 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:57:27,663 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:57:27,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1029], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), 86#thread1EXITtrue, Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), 43#thread2EXITtrue, 3764#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), 5039#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 3#L51-4true, 41#L41-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), 4741#true, thread1Thread1of2ForFork0InUse, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:27,804 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 02:57:27,804 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:57:27,804 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:57:27,804 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 02:57:29,713 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1086], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), 86#thread1EXITtrue, Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, Black: 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), 43#thread2EXITtrue, Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 33#L69-3true, Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 5040#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), thread1Thread1of2ForFork0InUse, 4741#true, 590#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:29,713 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 02:57:29,713 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:57:29,713 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:57:29,714 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:57:29,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1086], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, Black: 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), 6#L69-4true, Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 31#L51-4true, Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 5040#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), 4741#true, thread1Thread1of2ForFork0InUse, 590#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:29,792 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 02:57:29,792 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:57:29,792 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:57:29,792 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:57:29,868 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1119], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), 86#thread1EXITtrue, Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, Black: 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), 5039#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 31#L51-4true, Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 33#L69-3true, Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 3#L51-4true, 41#L41-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), thread1Thread1of2ForFork0InUse, 4741#true, 590#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:29,877 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 02:57:29,877 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:57:29,877 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:57:29,877 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 02:57:32,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1086], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, Black: 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), 6#L69-4true, Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), 43#thread2EXITtrue, Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 5040#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), 4741#true, thread1Thread1of2ForFork0InUse, 590#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:33,000 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 02:57:33,000 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:57:33,000 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:57:33,000 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:57:33,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1086], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), 86#thread1EXITtrue, Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, Black: 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), 6#L69-4true, Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 5040#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1NotInUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), 4741#true, thread1Thread1of2ForFork0InUse, 590#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:33,001 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 02:57:33,001 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:57:33,001 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:57:33,001 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:57:33,081 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1119], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, Black: 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 6#L69-4true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), 5039#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 31#L51-4true, Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), thread1Thread1of2ForFork0InUse, 4741#true, 590#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:33,082 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 02:57:33,082 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:57:33,082 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:57:33,082 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:57:33,149 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1119], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), 86#thread1EXITtrue, Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, Black: 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), 43#thread2EXITtrue, Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), 5039#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 33#L69-3true, Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 3#L51-4true, 41#L41-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), 4741#true, thread1Thread1of2ForFork0InUse, 590#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:33,150 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 02:57:33,150 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:57:33,150 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:57:33,150 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 02:57:35,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1119], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, Black: 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 6#L69-4true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), 43#thread2EXITtrue, Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), 5039#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), thread1Thread1of2ForFork0InUse, 4741#true, 590#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:35,384 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 02:57:35,385 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:57:35,385 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:57:35,385 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:57:35,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1086], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 31#L51-4true, Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 5040#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), 4741#true, thread1Thread1of2ForFork0InUse, 78#L69-8true, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:35,388 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 02:57:35,388 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:57:35,388 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:57:35,388 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:57:35,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1119], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), 86#thread1EXITtrue, Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, Black: 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), 6#L69-4true, Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), 5039#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 3#L51-4true, 41#L41-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1NotInUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), 4741#true, thread1Thread1of2ForFork0InUse, 590#(= 0 |ULTIMATE.start_main_~asdf~2#1|), 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:35,440 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-04 02:57:35,440 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:57:35,440 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:57:35,440 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 02:57:37,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1086], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), 43#thread2EXITtrue, Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 5040#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), thread1Thread1of2ForFork0InUse, 4741#true, 78#L69-8true, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:37,727 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 02:57:37,727 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:57:37,727 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:57:37,727 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:57:37,728 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1086], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), 86#thread1EXITtrue, Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 5040#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1NotInUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), thread1Thread1of2ForFork0InUse, 4741#true, 78#L69-8true, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:37,728 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 02:57:37,728 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:57:37,728 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:57:37,729 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:57:37,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1119], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), 5039#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 31#L51-4true, Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), thread1Thread1of2ForFork0InUse, 4741#true, 78#L69-8true, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:37,807 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 02:57:37,807 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:57:37,807 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:57:37,807 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:57:37,810 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1086], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 31#L51-4true, Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 33#L69-3true, Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 5040#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), 4741#true, thread1Thread1of2ForFork0InUse, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:37,811 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 02:57:37,811 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:57:37,811 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:57:37,811 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 02:57:39,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1086], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), 43#thread2EXITtrue, Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 33#L69-3true, Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 5040#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), 4741#true, thread1Thread1of2ForFork0InUse, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:39,658 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,658 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,658 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,658 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,659 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1086], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), 86#thread1EXITtrue, Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 33#L69-3true, Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 5040#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1NotInUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), 4741#true, thread1Thread1of2ForFork0InUse, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:39,659 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,659 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,659 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,659 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1119], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), 43#thread2EXITtrue, Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), 5039#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), 4741#true, thread1Thread1of2ForFork0InUse, 78#L69-8true, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:39,722 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,722 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,722 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,722 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,724 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1119], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), 5039#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 31#L51-4true, Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 33#L69-3true, Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), thread1Thread1of2ForFork0InUse, 4741#true, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:39,724 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,724 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,724 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,724 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1119], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), 86#thread1EXITtrue, Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), 5039#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 3#L51-4true, 41#L41-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1NotInUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), thread1Thread1of2ForFork0InUse, 4741#true, 78#L69-8true, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:39,784 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,784 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,784 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:57:39,784 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 02:57:41,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1086], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), 6#L69-4true, Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 5040#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1NotInUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), 4741#true, thread1Thread1of2ForFork0InUse, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:41,338 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-04 02:57:41,338 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 02:57:41,338 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 02:57:41,338 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 02:57:41,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1119], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), 43#thread2EXITtrue, Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), 5039#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 33#L69-3true, Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1InUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), 4741#true, thread1Thread1of2ForFork0InUse, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:41,377 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-04 02:57:41,377 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 02:57:41,377 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 02:57:41,377 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 02:57:41,416 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1119], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), 86#thread1EXITtrue, Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), 5039#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 33#L69-3true, Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 3#L51-4true, 41#L41-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1NotInUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), thread1Thread1of2ForFork0InUse, 4741#true, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:41,416 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-04 02:57:41,416 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 02:57:41,416 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 02:57:41,416 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-04 02:57:42,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1119], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 588#true, 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 6#L69-4true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), 5039#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1NotInUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), thread1Thread1of2ForFork0InUse, 4741#true, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:42,766 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-04 02:57:42,766 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 02:57:42,766 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 02:57:42,766 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-04 02:57:43,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1086], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 5040#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1NotInUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), 4741#true, thread1Thread1of2ForFork0InUse, 78#L69-8true, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:43,910 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-04 02:57:43,910 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 02:57:43,910 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 02:57:43,910 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-04 02:57:44,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([725] L41-4-->L41-4: Formula: (and (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< v_thread1Thread1of2ForFork0_~i~0_43 v_~N~0_125) (= v_~counter~0_178 (+ v_~counter~0_179 1))) InVars {~counter~0=v_~counter~0_179, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~N~0=v_~N~0_125} OutVars{~counter~0=v_~counter~0_178, thread1Thread1of2ForFork0_#t~post2=|v_thread1Thread1of2ForFork0_#t~post2_12|, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~N~0=v_~N~0_125} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post2, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][1119], [Black: 1806#(<= ~N~0 thread1Thread2of2ForFork0_~i~0), Black: 257#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 4736#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), Black: 4655#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0)), Black: 1026#(= ~counter~0 0), 4489#(<= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 4107#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 1031#(= thread1Thread1of2ForFork0_~i~0 0), Black: 591#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 2203#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 263#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 2206#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 2236#true, 1609#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 4744#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4743#(= ~counter~0 0), Black: 2212#(= |thread2Thread1of2ForFork1_~i~1#1| 0), Black: 2834#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 1325#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 2833#(= |thread2Thread1of2ForFork1_~i~1#1| 0), 5039#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 4404#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 4114#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2228#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 2227#(= thread1Thread2of2ForFork0_~i~0 0), 2296#(<= 0 thread1Thread1of2ForFork0_~i~0), Black: 4412#(= thread1Thread2of2ForFork0_~i~0 0), Black: 4413#(and (= thread1Thread2of2ForFork0_~i~0 0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), Black: 2239#(and (= thread1Thread1of2ForFork0_~i~0 0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 193#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 4424#(and (<= 1 ~N~0) (= |thread2Thread2of2ForFork1_~i~1#1| 0)), 3768#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 1332#(= thread1Thread2of2ForFork0_~i~0 0), Black: 3762#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (= 0 |ULTIMATE.start_main_~asdf~1#1|)) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3758#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3774#(and (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (or (< 2147483647 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)) (not (= thread1Thread1of2ForFork0_thidvar0 (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= |ULTIMATE.start_main_~asdf~1#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 4294967296)))) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), 3414#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3778#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3792#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3782#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= (+ thread1Thread1of2ForFork0_thidvar0 2) |ULTIMATE.start_main_#t~mem15#1|) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))))), Black: 3786#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (<= 1 ~N~0) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~asdf~3#1|) (or (<= (mod |#pthreadsForks| 4294967296) 2147483647) (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296)))) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3416#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 3750#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base|) 0) (+ thread1Thread1of2ForFork0_thidvar0 2)) (or (<= (mod (+ |#pthreadsForks| 1) 4294967296) 2147483647) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) (+ thread1Thread1of2ForFork0_thidvar0 4294967296)))) (<= 1 ~N~0) (or (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (+ 2147483649 thread1Thread1of2ForFork0_thidvar0) 0) (<= 0 thread1Thread1of2ForFork0_thidvar0)) (or (not (= (+ thread1Thread1of2ForFork0_thidvar0 4294967296) (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))) (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (<= (mod |#pthreadsForks| 4294967296) 2147483647))) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0) (or (< 2147483647 (mod (+ |#pthreadsForks| 1) 4294967296)) (not (= (mod (+ |#pthreadsForks| 1) 4294967296) thread1Thread1of2ForFork0_thidvar0))) (= |thread2Thread1of2ForFork1_~i~1#1| 0) (or (and (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 (mod |#pthreadsForks| 4294967296))) (and (or (= 0 |ULTIMATE.start_main_~asdf~1#1|) (< 2147483647 thread1Thread1of2ForFork0_thidvar0) (< thread1Thread1of2ForFork0_thidvar0 0)) (or (not (= thread1Thread1of2ForFork0_thidvar0 (mod |#pthreadsForks| 4294967296))) (not (= 0 |ULTIMATE.start_main_~asdf~1#1|)))))), Black: 3409#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0)), Black: 3412#(and (<= 0 thread1Thread2of2ForFork0_~i~0) (<= 1 ~N~0) (= |thread2Thread1of2ForFork1_~i~1#1| 0)), Black: 2303#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= thread1Thread2of2ForFork0_~i~0 0)), Black: 4579#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= 0 thread1Thread2of2ForFork0_~i~0) (<= ~N~0 0)), 41#L41-4true, 3#L51-4true, Black: 4577#(and (<= |thread2Thread2of2ForFork1_~i~1#1| 0) (<= ~N~0 0)), thread2Thread1of2ForFork1NotInUse, 4104#(and (<= 0 thread1Thread1of2ForFork0_~i~0) (<= 1 ~N~0)), 4741#true, thread1Thread1of2ForFork0InUse, 78#L69-8true, 1905#(and (< thread1Thread1of2ForFork0_~i~0 (+ thread1Thread2of2ForFork0_~i~0 1)) (<= ~N~0 thread1Thread2of2ForFork0_~i~0)), 4113#(= |thread2Thread2of2ForFork1_~i~1#1| 0), Black: 1621#(and (= thread1Thread1of2ForFork0_~i~0 0) (= thread1Thread2of2ForFork0_~i~0 0)), Black: 791#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 1620#(= thread1Thread1of2ForFork0_~i~0 0)]) [2023-08-04 02:57:44,694 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 02:57:44,694 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 02:57:44,694 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 02:57:44,694 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 02:57:48,136 INFO L124 PetriNetUnfolderBase]: 119207/171064 cut-off events. [2023-08-04 02:57:48,136 INFO L125 PetriNetUnfolderBase]: For 2627337/2679566 co-relation queries the response was YES. [2023-08-04 02:57:49,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102788 conditions, 171064 events. 119207/171064 cut-off events. For 2627337/2679566 co-relation queries the response was YES. Maximal size of possible extension queue 5101. Compared 1319946 event pairs, 16357 based on Foata normal form. 38711/205370 useless extension candidates. Maximal degree in co-relation 1095319. Up to 82726 conditions per place. [2023-08-04 02:57:50,715 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 447 selfloop transitions, 842 changer transitions 17/1412 dead transitions. [2023-08-04 02:57:50,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 1412 transitions, 25843 flow [2023-08-04 02:57:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:57:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:57:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-08-04 02:57:50,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.560352422907489 [2023-08-04 02:57:50,717 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-08-04 02:57:50,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-08-04 02:57:50,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:57:50,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-08-04 02:57:50,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:57:50,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:57:50,718 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:57:50,718 INFO L175 Difference]: Start difference. First operand has 176 places, 761 transitions, 13398 flow. Second operand 5 states and 636 transitions. [2023-08-04 02:57:50,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 1412 transitions, 25843 flow [2023-08-04 02:58:15,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 1412 transitions, 25843 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 02:58:15,144 INFO L231 Difference]: Finished difference. Result has 182 places, 1227 transitions, 25069 flow [2023-08-04 02:58:15,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=13398, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=761, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=524, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=25069, PETRI_PLACES=182, PETRI_TRANSITIONS=1227} [2023-08-04 02:58:15,146 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 141 predicate places. [2023-08-04 02:58:15,146 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 1227 transitions, 25069 flow [2023-08-04 02:58:15,146 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 02:58:15,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:58:15,146 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 02:58:15,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-04 02:58:15,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-08-04 02:58:15,352 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:58:15,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:58:15,353 INFO L85 PathProgramCache]: Analyzing trace with hash -340661555, now seen corresponding path program 1 times [2023-08-04 02:58:15,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:58:15,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777038531] [2023-08-04 02:58:15,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:58:15,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:58:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:58:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 02:58:15,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:58:15,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777038531] [2023-08-04 02:58:15,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777038531] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:58:15,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871459604] [2023-08-04 02:58:15,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:58:15,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:58:15,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:58:15,437 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:58:15,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-04 02:58:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:58:15,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 02:58:15,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:58:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 02:58:15,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:58:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 02:58:15,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871459604] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:58:15,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:58:15,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-08-04 02:58:15,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870925392] [2023-08-04 02:58:15,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:58:15,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-04 02:58:15,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:58:15,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-04 02:58:15,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-08-04 02:58:15,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 227 [2023-08-04 02:58:15,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 1227 transitions, 25069 flow. Second operand has 12 states, 12 states have (on average 97.25) internal successors, (1167), 12 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:58:15,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:58:15,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 227 [2023-08-04 02:58:15,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand