./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6b55d0b1c42ab7aaefa2efb35454af77e64d43e1c106bfebef7445a043c9409 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 11:10:31,080 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 11:10:31,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 11:10:31,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 11:10:31,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 11:10:31,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 11:10:31,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 11:10:31,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 11:10:31,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 11:10:31,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 11:10:31,128 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 11:10:31,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 11:10:31,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 11:10:31,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 11:10:31,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 11:10:31,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 11:10:31,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 11:10:31,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 11:10:31,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 11:10:31,142 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 11:10:31,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 11:10:31,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 11:10:31,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 11:10:31,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 11:10:31,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 11:10:31,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 11:10:31,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 11:10:31,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 11:10:31,163 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 11:10:31,164 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 11:10:31,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 11:10:31,165 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 11:10:31,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 11:10:31,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 11:10:31,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 11:10:31,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 11:10:31,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 11:10:31,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 11:10:31,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 11:10:31,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 11:10:31,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 11:10:31,169 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-08-30 11:10:31,190 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 11:10:31,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 11:10:31,191 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 11:10:31,191 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 11:10:31,192 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 11:10:31,192 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 11:10:31,193 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 11:10:31,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 11:10:31,193 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 11:10:31,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 11:10:31,194 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 11:10:31,194 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 11:10:31,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 11:10:31,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 11:10:31,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 11:10:31,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 11:10:31,195 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 11:10:31,195 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 11:10:31,195 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-08-30 11:10:31,195 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 11:10:31,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 11:10:31,195 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 11:10:31,195 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 11:10:31,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 11:10:31,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 11:10:31,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 11:10:31,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 11:10:31,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 11:10:31,196 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 11:10:31,197 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 11:10:31,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 11:10:31,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 11:10:31,197 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 11:10:31,197 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 11:10:31,197 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 11:10:31,198 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 11:10:31,198 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 11:10:31,198 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6b55d0b1c42ab7aaefa2efb35454af77e64d43e1c106bfebef7445a043c9409 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 11:10:31,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 11:10:31,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 11:10:31,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 11:10:31,427 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 11:10:31,428 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 11:10:31,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2023-08-30 11:10:32,335 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 11:10:32,495 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 11:10:32,496 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2023-08-30 11:10:32,501 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e5a99de1/c073bf30c1c444cbb6d030abb1dcf6c7/FLAG2e2ba1aba [2023-08-30 11:10:32,513 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e5a99de1/c073bf30c1c444cbb6d030abb1dcf6c7 [2023-08-30 11:10:32,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 11:10:32,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 11:10:32,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 11:10:32,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 11:10:32,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 11:10:32,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:10:32" (1/1) ... [2023-08-30 11:10:32,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34aaf3da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:32, skipping insertion in model container [2023-08-30 11:10:32,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:10:32" (1/1) ... [2023-08-30 11:10:32,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 11:10:32,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 11:10:32,699 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5426,5439] [2023-08-30 11:10:32,701 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 11:10:32,708 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 11:10:32,739 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[5426,5439] [2023-08-30 11:10:32,739 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 11:10:32,744 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 11:10:32,745 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 11:10:32,749 INFO L208 MainTranslator]: Completed translation [2023-08-30 11:10:32,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:32 WrapperNode [2023-08-30 11:10:32,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 11:10:32,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 11:10:32,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 11:10:32,750 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 11:10:32,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:32" (1/1) ... [2023-08-30 11:10:32,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:32" (1/1) ... [2023-08-30 11:10:32,807 INFO L138 Inliner]: procedures = 22, calls = 110, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 277 [2023-08-30 11:10:32,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 11:10:32,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 11:10:32,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 11:10:32,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 11:10:32,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:32" (1/1) ... [2023-08-30 11:10:32,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:32" (1/1) ... [2023-08-30 11:10:32,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:32" (1/1) ... [2023-08-30 11:10:32,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:32" (1/1) ... [2023-08-30 11:10:32,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:32" (1/1) ... [2023-08-30 11:10:32,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:32" (1/1) ... [2023-08-30 11:10:32,834 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:32" (1/1) ... [2023-08-30 11:10:32,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:32" (1/1) ... [2023-08-30 11:10:32,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 11:10:32,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 11:10:32,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 11:10:32,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 11:10:32,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:32" (1/1) ... [2023-08-30 11:10:32,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 11:10:32,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 11:10:32,864 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-30 11:10:32,867 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-30 11:10:32,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 11:10:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 11:10:32,890 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 11:10:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 11:10:32,890 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 11:10:32,890 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 11:10:32,890 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 11:10:32,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 11:10:32,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 11:10:32,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 11:10:32,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 11:10:32,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 11:10:32,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 11:10:32,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 11:10:32,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 11:10:32,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 11:10:32,892 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 11:10:32,997 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 11:10:32,998 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 11:10:33,259 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 11:10:33,440 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 11:10:33,440 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 11:10:33,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:10:33 BoogieIcfgContainer [2023-08-30 11:10:33,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 11:10:33,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 11:10:33,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 11:10:33,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 11:10:33,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:10:32" (1/3) ... [2023-08-30 11:10:33,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53dd4441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:10:33, skipping insertion in model container [2023-08-30 11:10:33,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:10:32" (2/3) ... [2023-08-30 11:10:33,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53dd4441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:10:33, skipping insertion in model container [2023-08-30 11:10:33,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:10:33" (3/3) ... [2023-08-30 11:10:33,449 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2023-08-30 11:10:33,453 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 11:10:33,459 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 11:10:33,459 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-08-30 11:10:33,460 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 11:10:33,516 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-30 11:10:33,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 165 transitions, 354 flow [2023-08-30 11:10:33,609 INFO L130 PetriNetUnfolder]: 2/162 cut-off events. [2023-08-30 11:10:33,610 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 11:10:33,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 162 events. 2/162 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 164 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2023-08-30 11:10:33,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 165 transitions, 354 flow [2023-08-30 11:10:33,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 144 transitions, 303 flow [2023-08-30 11:10:33,622 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 11:10:33,632 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 144 transitions, 303 flow [2023-08-30 11:10:33,635 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 144 transitions, 303 flow [2023-08-30 11:10:33,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 144 transitions, 303 flow [2023-08-30 11:10:33,660 INFO L130 PetriNetUnfolder]: 1/144 cut-off events. [2023-08-30 11:10:33,661 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-30 11:10:33,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 144 events. 1/144 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 161 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2023-08-30 11:10:33,662 INFO L119 LiptonReduction]: Number of co-enabled transitions 3240 [2023-08-30 11:10:36,828 INFO L134 LiptonReduction]: Checked pairs total: 33915 [2023-08-30 11:10:36,828 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-08-30 11:10:36,850 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 11:10:36,856 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;@16797bb0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 11:10:36,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2023-08-30 11:10:36,858 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-08-30 11:10:36,858 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 11:10:36,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:10:36,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 11:10:36,859 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:10:36,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:10:36,863 INFO L85 PathProgramCache]: Analyzing trace with hash 726723740, now seen corresponding path program 1 times [2023-08-30 11:10:36,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:10:36,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72467895] [2023-08-30 11:10:36,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:10:36,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:10:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:10:37,218 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-30 11:10:37,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:10:37,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72467895] [2023-08-30 11:10:37,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72467895] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:10:37,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:10:37,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 11:10:37,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734563644] [2023-08-30 11:10:37,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:10:37,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 11:10:37,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:10:37,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 11:10:37,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 11:10:37,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 266 [2023-08-30 11:10:37,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:37,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:10:37,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 266 [2023-08-30 11:10:37,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:10:38,490 INFO L130 PetriNetUnfolder]: 11812/18139 cut-off events. [2023-08-30 11:10:38,491 INFO L131 PetriNetUnfolder]: For 590/590 co-relation queries the response was YES. [2023-08-30 11:10:38,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35967 conditions, 18139 events. 11812/18139 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 125977 event pairs, 6078 based on Foata normal form. 0/15035 useless extension candidates. Maximal degree in co-relation 33750. Up to 15714 conditions per place. [2023-08-30 11:10:38,623 INFO L137 encePairwiseOnDemand]: 255/266 looper letters, 79 selfloop transitions, 11 changer transitions 0/102 dead transitions. [2023-08-30 11:10:38,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 102 transitions, 408 flow [2023-08-30 11:10:38,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 11:10:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 11:10:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 578 transitions. [2023-08-30 11:10:38,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.543233082706767 [2023-08-30 11:10:38,639 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 578 transitions. [2023-08-30 11:10:38,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 578 transitions. [2023-08-30 11:10:38,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:10:38,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 578 transitions. [2023-08-30 11:10:38,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.5) internal successors, (578), 4 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-30 11:10:38,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:38,654 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:38,655 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 133 flow. Second operand 4 states and 578 transitions. [2023-08-30 11:10:38,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 102 transitions, 408 flow [2023-08-30 11:10:38,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 102 transitions, 395 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-30 11:10:38,667 INFO L231 Difference]: Finished difference. Result has 70 places, 69 transitions, 212 flow [2023-08-30 11:10:38,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2023-08-30 11:10:38,673 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 1 predicate places. [2023-08-30 11:10:38,674 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 212 flow [2023-08-30 11:10:38,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:38,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:10:38,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 11:10:38,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 11:10:38,677 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:10:38,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:10:38,678 INFO L85 PathProgramCache]: Analyzing trace with hash 726723739, now seen corresponding path program 1 times [2023-08-30 11:10:38,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:10:38,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011964503] [2023-08-30 11:10:38,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:10:38,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:10:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:10:38,815 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-30 11:10:38,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:10:38,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011964503] [2023-08-30 11:10:38,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011964503] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:10:38,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:10:38,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 11:10:38,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651833513] [2023-08-30 11:10:38,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:10:38,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 11:10:38,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:10:38,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 11:10:38,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 11:10:38,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 266 [2023-08-30 11:10:38,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:38,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:10:38,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 266 [2023-08-30 11:10:38,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:10:39,524 INFO L130 PetriNetUnfolder]: 8397/12953 cut-off events. [2023-08-30 11:10:39,525 INFO L131 PetriNetUnfolder]: For 4296/5044 co-relation queries the response was YES. [2023-08-30 11:10:39,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28241 conditions, 12953 events. 8397/12953 cut-off events. For 4296/5044 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 85963 event pairs, 7549 based on Foata normal form. 707/12440 useless extension candidates. Maximal degree in co-relation 12840. Up to 12320 conditions per place. [2023-08-30 11:10:39,575 INFO L137 encePairwiseOnDemand]: 262/266 looper letters, 45 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2023-08-30 11:10:39,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 282 flow [2023-08-30 11:10:39,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 11:10:39,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 11:10:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-30 11:10:39,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5288220551378446 [2023-08-30 11:10:39,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-30 11:10:39,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-30 11:10:39,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:10:39,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-30 11:10:39,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:39,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:39,580 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:39,581 INFO L175 Difference]: Start difference. First operand has 70 places, 69 transitions, 212 flow. Second operand 3 states and 422 transitions. [2023-08-30 11:10:39,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 282 flow [2023-08-30 11:10:39,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 11:10:39,583 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 184 flow [2023-08-30 11:10:39,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2023-08-30 11:10:39,583 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, -1 predicate places. [2023-08-30 11:10:39,584 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 184 flow [2023-08-30 11:10:39,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:39,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:10:39,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:10:39,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 11:10:39,585 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:10:39,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:10:39,585 INFO L85 PathProgramCache]: Analyzing trace with hash 544697587, now seen corresponding path program 1 times [2023-08-30 11:10:39,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:10:39,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457870363] [2023-08-30 11:10:39,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:10:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:10:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:10:39,937 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-30 11:10:39,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:10:39,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457870363] [2023-08-30 11:10:39,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457870363] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:10:39,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:10:39,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 11:10:39,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176368133] [2023-08-30 11:10:39,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:10:39,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 11:10:39,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:10:39,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 11:10:39,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 11:10:39,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-30 11:10:39,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:39,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:10:39,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-30 11:10:39,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:10:40,732 INFO L130 PetriNetUnfolder]: 10502/16161 cut-off events. [2023-08-30 11:10:40,732 INFO L131 PetriNetUnfolder]: For 3711/4017 co-relation queries the response was YES. [2023-08-30 11:10:40,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35334 conditions, 16161 events. 10502/16161 cut-off events. For 3711/4017 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 104240 event pairs, 2851 based on Foata normal form. 146/15094 useless extension candidates. Maximal degree in co-relation 35324. Up to 14844 conditions per place. [2023-08-30 11:10:40,788 INFO L137 encePairwiseOnDemand]: 257/266 looper letters, 74 selfloop transitions, 12 changer transitions 0/98 dead transitions. [2023-08-30 11:10:40,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 98 transitions, 454 flow [2023-08-30 11:10:40,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 11:10:40,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 11:10:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2023-08-30 11:10:40,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103383458646616 [2023-08-30 11:10:40,790 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 543 transitions. [2023-08-30 11:10:40,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 543 transitions. [2023-08-30 11:10:40,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:10:40,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 543 transitions. [2023-08-30 11:10:40,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:40,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:40,794 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:40,794 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 184 flow. Second operand 4 states and 543 transitions. [2023-08-30 11:10:40,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 98 transitions, 454 flow [2023-08-30 11:10:40,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 98 transitions, 453 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 11:10:40,797 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 276 flow [2023-08-30 11:10:40,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=276, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2023-08-30 11:10:40,798 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 3 predicate places. [2023-08-30 11:10:40,798 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 276 flow [2023-08-30 11:10:40,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:40,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:10:40,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:10:40,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 11:10:40,799 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:10:40,799 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:10:40,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1003442848, now seen corresponding path program 1 times [2023-08-30 11:10:40,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:10:40,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048256225] [2023-08-30 11:10:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:10:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:10:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:10:40,947 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-30 11:10:40,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:10:40,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048256225] [2023-08-30 11:10:40,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048256225] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:10:40,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:10:40,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 11:10:40,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760859705] [2023-08-30 11:10:40,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:10:40,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 11:10:40,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:10:40,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 11:10:40,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 11:10:40,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 266 [2023-08-30 11:10:40,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:40,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:10:40,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 266 [2023-08-30 11:10:40,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:10:42,115 INFO L130 PetriNetUnfolder]: 13999/21756 cut-off events. [2023-08-30 11:10:42,115 INFO L131 PetriNetUnfolder]: For 14634/15204 co-relation queries the response was YES. [2023-08-30 11:10:42,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52252 conditions, 21756 events. 13999/21756 cut-off events. For 14634/15204 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 148283 event pairs, 3355 based on Foata normal form. 748/21018 useless extension candidates. Maximal degree in co-relation 52239. Up to 15342 conditions per place. [2023-08-30 11:10:42,200 INFO L137 encePairwiseOnDemand]: 257/266 looper letters, 106 selfloop transitions, 18 changer transitions 0/137 dead transitions. [2023-08-30 11:10:42,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 137 transitions, 701 flow [2023-08-30 11:10:42,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 11:10:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 11:10:42,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 705 transitions. [2023-08-30 11:10:42,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5300751879699248 [2023-08-30 11:10:42,204 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 705 transitions. [2023-08-30 11:10:42,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 705 transitions. [2023-08-30 11:10:42,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:10:42,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 705 transitions. [2023-08-30 11:10:42,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.0) internal successors, (705), 5 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:42,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:42,208 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:42,208 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 276 flow. Second operand 5 states and 705 transitions. [2023-08-30 11:10:42,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 137 transitions, 701 flow [2023-08-30 11:10:42,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 137 transitions, 699 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-30 11:10:42,212 INFO L231 Difference]: Finished difference. Result has 77 places, 78 transitions, 358 flow [2023-08-30 11:10:42,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=77, PETRI_TRANSITIONS=78} [2023-08-30 11:10:42,213 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 8 predicate places. [2023-08-30 11:10:42,213 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 358 flow [2023-08-30 11:10:42,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:42,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:10:42,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:10:42,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 11:10:42,214 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:10:42,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:10:42,214 INFO L85 PathProgramCache]: Analyzing trace with hash -753202659, now seen corresponding path program 1 times [2023-08-30 11:10:42,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:10:42,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601800920] [2023-08-30 11:10:42,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:10:42,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:10:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:10:42,431 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-30 11:10:42,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:10:42,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601800920] [2023-08-30 11:10:42,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601800920] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:10:42,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:10:42,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 11:10:42,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294942089] [2023-08-30 11:10:42,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:10:42,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 11:10:42,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:10:42,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 11:10:42,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 11:10:42,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-30 11:10:42,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 358 flow. Second operand has 6 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-30 11:10:42,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:10:42,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-30 11:10:42,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:10:44,951 INFO L130 PetriNetUnfolder]: 31083/47704 cut-off events. [2023-08-30 11:10:44,951 INFO L131 PetriNetUnfolder]: For 34577/35815 co-relation queries the response was YES. [2023-08-30 11:10:45,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118560 conditions, 47704 events. 31083/47704 cut-off events. For 34577/35815 co-relation queries the response was YES. Maximal size of possible extension queue 1437. Compared 360573 event pairs, 5117 based on Foata normal form. 412/44668 useless extension candidates. Maximal degree in co-relation 118544. Up to 18543 conditions per place. [2023-08-30 11:10:45,292 INFO L137 encePairwiseOnDemand]: 251/266 looper letters, 238 selfloop transitions, 84 changer transitions 0/334 dead transitions. [2023-08-30 11:10:45,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 334 transitions, 1908 flow [2023-08-30 11:10:45,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 11:10:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 11:10:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1312 transitions. [2023-08-30 11:10:45,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5480367585630743 [2023-08-30 11:10:45,295 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1312 transitions. [2023-08-30 11:10:45,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1312 transitions. [2023-08-30 11:10:45,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:10:45,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1312 transitions. [2023-08-30 11:10:45,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 145.77777777777777) internal successors, (1312), 9 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:45,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:45,301 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:45,301 INFO L175 Difference]: Start difference. First operand has 77 places, 78 transitions, 358 flow. Second operand 9 states and 1312 transitions. [2023-08-30 11:10:45,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 334 transitions, 1908 flow [2023-08-30 11:10:45,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 334 transitions, 1834 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-08-30 11:10:45,312 INFO L231 Difference]: Finished difference. Result has 89 places, 158 transitions, 1169 flow [2023-08-30 11:10:45,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1169, PETRI_PLACES=89, PETRI_TRANSITIONS=158} [2023-08-30 11:10:45,314 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 20 predicate places. [2023-08-30 11:10:45,314 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 158 transitions, 1169 flow [2023-08-30 11:10:45,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-30 11:10:45,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:10:45,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:10:45,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 11:10:45,315 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:10:45,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:10:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1652497841, now seen corresponding path program 2 times [2023-08-30 11:10:45,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:10:45,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413240469] [2023-08-30 11:10:45,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:10:45,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:10:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:10:45,516 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-30 11:10:45,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:10:45,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413240469] [2023-08-30 11:10:45,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413240469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:10:45,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:10:45,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 11:10:45,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134517750] [2023-08-30 11:10:45,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:10:45,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 11:10:45,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:10:45,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 11:10:45,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 11:10:45,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 266 [2023-08-30 11:10:45,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 158 transitions, 1169 flow. Second operand has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:45,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:10:45,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 266 [2023-08-30 11:10:45,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:10:48,507 INFO L130 PetriNetUnfolder]: 32724/50181 cut-off events. [2023-08-30 11:10:48,508 INFO L131 PetriNetUnfolder]: For 113364/115600 co-relation queries the response was YES. [2023-08-30 11:10:48,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150451 conditions, 50181 events. 32724/50181 cut-off events. For 113364/115600 co-relation queries the response was YES. Maximal size of possible extension queue 1574. Compared 379124 event pairs, 7331 based on Foata normal form. 809/47304 useless extension candidates. Maximal degree in co-relation 150428. Up to 41607 conditions per place. [2023-08-30 11:10:48,861 INFO L137 encePairwiseOnDemand]: 254/266 looper letters, 182 selfloop transitions, 79 changer transitions 0/276 dead transitions. [2023-08-30 11:10:48,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 276 transitions, 2492 flow [2023-08-30 11:10:48,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 11:10:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 11:10:48,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 825 transitions. [2023-08-30 11:10:48,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5169172932330827 [2023-08-30 11:10:48,863 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 825 transitions. [2023-08-30 11:10:48,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 825 transitions. [2023-08-30 11:10:48,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:10:48,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 825 transitions. [2023-08-30 11:10:48,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:48,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:48,867 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:48,867 INFO L175 Difference]: Start difference. First operand has 89 places, 158 transitions, 1169 flow. Second operand 6 states and 825 transitions. [2023-08-30 11:10:48,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 276 transitions, 2492 flow [2023-08-30 11:10:49,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 276 transitions, 2408 flow, removed 42 selfloop flow, removed 0 redundant places. [2023-08-30 11:10:49,216 INFO L231 Difference]: Finished difference. Result has 98 places, 211 transitions, 1948 flow [2023-08-30 11:10:49,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1948, PETRI_PLACES=98, PETRI_TRANSITIONS=211} [2023-08-30 11:10:49,216 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 29 predicate places. [2023-08-30 11:10:49,217 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 211 transitions, 1948 flow [2023-08-30 11:10:49,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:49,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:10:49,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:10:49,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 11:10:49,218 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:10:49,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:10:49,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1379132551, now seen corresponding path program 1 times [2023-08-30 11:10:49,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:10:49,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791055798] [2023-08-30 11:10:49,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:10:49,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:10:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:10:49,264 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-30 11:10:49,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:10:49,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791055798] [2023-08-30 11:10:49,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791055798] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:10:49,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:10:49,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 11:10:49,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056308566] [2023-08-30 11:10:49,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:10:49,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 11:10:49,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:10:49,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 11:10:49,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 11:10:49,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 266 [2023-08-30 11:10:49,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 211 transitions, 1948 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:49,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:10:49,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 266 [2023-08-30 11:10:49,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:10:49,853 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][147], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 28#L109true, 135#L191-1true, 123#L53true, 238#(= ~i~0 0), 176#true]) [2023-08-30 11:10:49,853 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-30 11:10:49,853 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 11:10:49,853 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 11:10:49,853 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-30 11:10:49,973 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][147], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 123#L53true, 13#L112true, 238#(= ~i~0 0), 176#true]) [2023-08-30 11:10:49,974 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-30 11:10:49,974 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 11:10:49,974 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 11:10:49,974 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-30 11:10:50,085 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][147], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 28#L109true, 12#L60true, 135#L191-1true, 238#(= ~i~0 0), 176#true]) [2023-08-30 11:10:50,086 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-30 11:10:50,086 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 11:10:50,086 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 11:10:50,086 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-30 11:10:50,437 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][147], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 118#L63true, 225#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 28#L109true, 135#L191-1true, 238#(= ~i~0 0), 176#true]) [2023-08-30 11:10:50,437 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 11:10:50,437 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 11:10:50,437 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 11:10:50,437 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 11:10:50,438 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][147], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 12#L60true, 135#L191-1true, 13#L112true, 238#(= ~i~0 0), 176#true]) [2023-08-30 11:10:50,438 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 11:10:50,438 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 11:10:50,438 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 11:10:50,438 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 11:10:50,452 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([696] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][185], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 204#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, 14#thread2EXITtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 123#L53true, 176#true]) [2023-08-30 11:10:50,452 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 11:10:50,452 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 11:10:50,452 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 11:10:50,453 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 11:10:50,453 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 149#L119true, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 123#L53true, 176#true]) [2023-08-30 11:10:50,453 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-30 11:10:50,453 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 11:10:50,453 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 11:10:50,453 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-30 11:10:50,569 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][147], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), 82#L66true, Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 28#L109true, 135#L191-1true, 238#(= ~i~0 0), 176#true]) [2023-08-30 11:10:50,569 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 11:10:50,569 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 11:10:50,569 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 11:10:50,569 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 11:10:50,570 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][147], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 118#L63true, 225#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 13#L112true, 238#(= ~i~0 0), 176#true]) [2023-08-30 11:10:50,570 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-30 11:10:50,570 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 11:10:50,570 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 11:10:50,570 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-30 11:10:50,701 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][147], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 17#L69true, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 28#L109true, 135#L191-1true, 238#(= ~i~0 0), 176#true]) [2023-08-30 11:10:50,701 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 11:10:50,701 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:10:50,701 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:10:50,701 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:10:50,702 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][147], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), 82#L66true, Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 13#L112true, 238#(= ~i~0 0), 176#true]) [2023-08-30 11:10:50,702 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 11:10:50,702 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:10:50,702 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:10:50,702 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:10:50,702 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([696] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][185], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, 204#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, 14#thread2EXITtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 12#L60true, 135#L191-1true, 176#true]) [2023-08-30 11:10:50,702 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 11:10:50,702 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:10:50,702 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:10:50,702 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:10:50,702 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 149#L119true, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 12#L60true, 135#L191-1true, 176#true]) [2023-08-30 11:10:50,703 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 11:10:50,703 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:10:50,703 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:10:50,703 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:10:50,835 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][147], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 17#L69true, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 13#L112true, 238#(= ~i~0 0), 176#true]) [2023-08-30 11:10:50,836 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,836 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,836 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,836 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,836 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([696] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][185], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 118#L63true, 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, 14#thread2EXITtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 176#true]) [2023-08-30 11:10:50,836 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,836 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,836 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,836 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,836 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 118#L63true, 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, 149#L119true, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 176#true]) [2023-08-30 11:10:50,837 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,837 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,837 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,837 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,842 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([693] L76-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n1~0_67 0)) InVars {} OutVars{~n1~0=v_~n1~0_67, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][160], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 47#L190-4true, 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, 204#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 62#thread1EXITtrue, Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 28#L109true, 176#true]) [2023-08-30 11:10:50,842 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,842 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,842 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,842 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,842 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 47#L190-4true, 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 28#L109true, 127#L76true, 176#true]) [2023-08-30 11:10:50,842 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,842 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,842 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,842 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:10:50,967 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([693] L76-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n1~0_67 0)) InVars {} OutVars{~n1~0=v_~n1~0_67, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][160], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, 204#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), thread3Thread1of1ForFork0InUse, Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), 62#thread1EXITtrue, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 28#L109true, 135#L191-1true, 176#true]) [2023-08-30 11:10:50,967 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,967 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,968 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,968 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,968 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 188#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 28#L109true, 135#L191-1true, 127#L76true, 176#true]) [2023-08-30 11:10:50,968 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,968 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,968 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,968 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,969 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([696] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][185], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), 82#L66true, Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 204#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, 14#thread2EXITtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 176#true]) [2023-08-30 11:10:50,969 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,969 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,969 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,969 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,969 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), 82#L66true, Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 188#true, 204#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, 149#L119true, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 176#true]) [2023-08-30 11:10:50,970 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,970 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,970 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,970 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,976 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([693] L76-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n1~0_67 0)) InVars {} OutVars{~n1~0=v_~n1~0_67, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][160], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 47#L190-4true, 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), thread3Thread1of1ForFork0InUse, Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), 62#thread1EXITtrue, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 13#L112true, 176#true]) [2023-08-30 11:10:50,976 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,976 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,976 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,976 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,977 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 47#L190-4true, 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 13#L112true, 127#L76true, 176#true]) [2023-08-30 11:10:50,977 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,977 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,977 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:50,977 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:10:51,104 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([693] L76-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n1~0_67 0)) InVars {} OutVars{~n1~0=v_~n1~0_67, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][160], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, 204#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 62#thread1EXITtrue, Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 13#L112true, 176#true]) [2023-08-30 11:10:51,104 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,104 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,104 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,104 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,105 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, 204#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 13#L112true, 127#L76true, 176#true]) [2023-08-30 11:10:51,105 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,105 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,105 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,105 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,105 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([696] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][185], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, 204#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, 14#thread2EXITtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 17#L69true, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 176#true]) [2023-08-30 11:10:51,105 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,105 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,105 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,105 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,105 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, 149#L119true, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 17#L69true, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 176#true]) [2023-08-30 11:10:51,106 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,106 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,106 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,106 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,112 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([693] L76-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n1~0_67 0)) InVars {} OutVars{~n1~0=v_~n1~0_67, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][160], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 47#L190-4true, 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 204#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), 62#thread1EXITtrue, Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 74#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 176#true]) [2023-08-30 11:10:51,112 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,112 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,112 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,112 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,112 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 47#L190-4true, 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 188#true, 204#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 74#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 127#L76true, 176#true]) [2023-08-30 11:10:51,112 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,112 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,113 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,113 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,113 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([693] L76-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n1~0_67 0)) InVars {} OutVars{~n1~0=v_~n1~0_67, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][160], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 47#L190-4true, 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, 122#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), 62#thread1EXITtrue, thread3Thread1of1ForFork0InUse, Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 176#true]) [2023-08-30 11:10:51,113 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,113 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,113 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,113 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,113 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 47#L190-4true, 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, 204#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 122#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 127#L76true, 176#true]) [2023-08-30 11:10:51,113 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,114 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,114 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,114 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:10:51,242 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([693] L76-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n1~0_67 0)) InVars {} OutVars{~n1~0=v_~n1~0_67, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][160], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 204#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), 62#thread1EXITtrue, Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 74#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 176#true]) [2023-08-30 11:10:51,242 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,242 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,242 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,242 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,243 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 188#true, 204#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 74#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 127#L76true, 176#true]) [2023-08-30 11:10:51,243 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,243 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,243 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,243 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,243 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([693] L76-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n1~0_67 0)) InVars {} OutVars{~n1~0=v_~n1~0_67, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][160], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 204#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, 122#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), 62#thread1EXITtrue, Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 176#true]) [2023-08-30 11:10:51,243 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,243 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,243 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,243 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,243 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, 204#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 122#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 127#L76true, 176#true]) [2023-08-30 11:10:51,243 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,243 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,244 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,244 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,244 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), 48#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, 149#L119true, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 176#true]) [2023-08-30 11:10:51,244 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,244 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,244 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,244 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,244 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 104#thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, 204#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, 149#L119true, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 176#true]) [2023-08-30 11:10:51,244 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,245 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,245 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,245 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,249 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([696] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][185], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 47#L190-4true, 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 204#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, 14#thread2EXITtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 127#L76true, 176#true]) [2023-08-30 11:10:51,249 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,249 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,249 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,249 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,249 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([693] L76-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n1~0_67 0)) InVars {} OutVars{~n1~0=v_~n1~0_67, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][160], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 47#L190-4true, 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 204#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), 62#thread1EXITtrue, thread3Thread1of1ForFork0InUse, 149#L119true, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 176#true]) [2023-08-30 11:10:51,249 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,249 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,249 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,249 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,250 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 47#L190-4true, 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 204#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, 149#L119true, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 127#L76true, 176#true]) [2023-08-30 11:10:51,250 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,250 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,250 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,250 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:10:51,282 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([696] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][185], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), 48#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 204#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, 14#thread2EXITtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 176#true]) [2023-08-30 11:10:51,282 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2023-08-30 11:10:51,282 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-30 11:10:51,282 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-30 11:10:51,282 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-30 11:10:51,282 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([696] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][185], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 104#thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 204#true, 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, 14#thread2EXITtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 176#true]) [2023-08-30 11:10:51,283 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2023-08-30 11:10:51,283 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-30 11:10:51,283 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-30 11:10:51,283 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-30 11:10:51,362 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([696] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][185], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 204#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, 14#thread2EXITtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 127#L76true, 176#true]) [2023-08-30 11:10:51,363 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 11:10:51,363 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:10:51,363 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:10:51,363 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:10:51,363 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([693] L76-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_thread1Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n1~0_67 0)) InVars {} OutVars{~n1~0=v_~n1~0_67, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_7|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_7|} AuxVars[] AssignedVars[~n1~0, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_#res#1.base][160], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 204#true, Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), 62#thread1EXITtrue, Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, 149#L119true, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 176#true]) [2023-08-30 11:10:51,363 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 11:10:51,363 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:10:51,363 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:10:51,363 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:10:51,364 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([613] L136-->L139: Formula: (and (= v_~n3~0_49 (+ v_~n3~0_50 1)) (<= 0 (+ 2147483649 v_~n3~0_50)) (<= v_~n3~0_50 2147483646)) InVars {~n3~0=v_~n3~0_50} OutVars{~n3~0=v_~n3~0_49, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][214], [Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 186#(<= 0 ~n3~0), Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 236#true, 21#L139true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), 188#true, 204#true, Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), thread3Thread1of1ForFork0InUse, 149#L119true, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 127#L76true, 176#true]) [2023-08-30 11:10:51,364 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 11:10:51,364 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:10:51,364 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:10:51,364 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:10:52,208 INFO L130 PetriNetUnfolder]: 20565/32359 cut-off events. [2023-08-30 11:10:52,208 INFO L131 PetriNetUnfolder]: For 123337/131894 co-relation queries the response was YES. [2023-08-30 11:10:52,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104592 conditions, 32359 events. 20565/32359 cut-off events. For 123337/131894 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 240890 event pairs, 7902 based on Foata normal form. 4903/35440 useless extension candidates. Maximal degree in co-relation 104563. Up to 19877 conditions per place. [2023-08-30 11:10:52,353 INFO L137 encePairwiseOnDemand]: 256/266 looper letters, 211 selfloop transitions, 4 changer transitions 0/274 dead transitions. [2023-08-30 11:10:52,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 274 transitions, 2919 flow [2023-08-30 11:10:52,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 11:10:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 11:10:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2023-08-30 11:10:52,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.568922305764411 [2023-08-30 11:10:52,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2023-08-30 11:10:52,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2023-08-30 11:10:52,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:10:52,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2023-08-30 11:10:52,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:52,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:52,358 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:52,358 INFO L175 Difference]: Start difference. First operand has 98 places, 211 transitions, 1948 flow. Second operand 3 states and 454 transitions. [2023-08-30 11:10:52,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 274 transitions, 2919 flow [2023-08-30 11:10:52,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 274 transitions, 2857 flow, removed 31 selfloop flow, removed 0 redundant places. [2023-08-30 11:10:52,518 INFO L231 Difference]: Finished difference. Result has 101 places, 214 transitions, 1942 flow [2023-08-30 11:10:52,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1942, PETRI_PLACES=101, PETRI_TRANSITIONS=214} [2023-08-30 11:10:52,519 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 32 predicate places. [2023-08-30 11:10:52,519 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 214 transitions, 1942 flow [2023-08-30 11:10:52,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:52,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:10:52,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:10:52,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 11:10:52,519 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:10:52,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:10:52,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1801532155, now seen corresponding path program 1 times [2023-08-30 11:10:52,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:10:52,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418732597] [2023-08-30 11:10:52,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:10:52,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:10:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:10:52,642 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-30 11:10:52,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:10:52,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418732597] [2023-08-30 11:10:52,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418732597] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:10:52,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:10:52,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 11:10:52,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664336625] [2023-08-30 11:10:52,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:10:52,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 11:10:52,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:10:52,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 11:10:52,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 11:10:52,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 266 [2023-08-30 11:10:52,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 214 transitions, 1942 flow. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:52,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:10:52,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 266 [2023-08-30 11:10:52,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:10:55,655 INFO L130 PetriNetUnfolder]: 24466/38224 cut-off events. [2023-08-30 11:10:55,656 INFO L131 PetriNetUnfolder]: For 112686/114684 co-relation queries the response was YES. [2023-08-30 11:10:55,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130679 conditions, 38224 events. 24466/38224 cut-off events. For 112686/114684 co-relation queries the response was YES. Maximal size of possible extension queue 1123. Compared 285817 event pairs, 9424 based on Foata normal form. 992/37802 useless extension candidates. Maximal degree in co-relation 130647. Up to 33077 conditions per place. [2023-08-30 11:10:55,871 INFO L137 encePairwiseOnDemand]: 257/266 looper letters, 197 selfloop transitions, 76 changer transitions 0/294 dead transitions. [2023-08-30 11:10:55,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 294 transitions, 2974 flow [2023-08-30 11:10:55,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 11:10:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 11:10:55,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2023-08-30 11:10:55,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5203007518796993 [2023-08-30 11:10:55,873 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 692 transitions. [2023-08-30 11:10:55,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 692 transitions. [2023-08-30 11:10:55,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:10:55,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 692 transitions. [2023-08-30 11:10:55,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:55,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:55,876 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:55,876 INFO L175 Difference]: Start difference. First operand has 101 places, 214 transitions, 1942 flow. Second operand 5 states and 692 transitions. [2023-08-30 11:10:55,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 294 transitions, 2974 flow [2023-08-30 11:10:56,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 294 transitions, 2967 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 11:10:56,204 INFO L231 Difference]: Finished difference. Result has 106 places, 240 transitions, 2425 flow [2023-08-30 11:10:56,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2425, PETRI_PLACES=106, PETRI_TRANSITIONS=240} [2023-08-30 11:10:56,205 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 37 predicate places. [2023-08-30 11:10:56,205 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 240 transitions, 2425 flow [2023-08-30 11:10:56,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:56,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:10:56,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:10:56,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 11:10:56,206 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:10:56,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:10:56,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2117245499, now seen corresponding path program 2 times [2023-08-30 11:10:56,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:10:56,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730999685] [2023-08-30 11:10:56,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:10:56,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:10:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:10:56,352 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-30 11:10:56,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:10:56,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730999685] [2023-08-30 11:10:56,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730999685] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:10:56,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:10:56,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 11:10:56,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002638422] [2023-08-30 11:10:56,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:10:56,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 11:10:56,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:10:56,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 11:10:56,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 11:10:56,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 266 [2023-08-30 11:10:56,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 240 transitions, 2425 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:56,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:10:56,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 266 [2023-08-30 11:10:56,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:10:59,532 INFO L130 PetriNetUnfolder]: 27123/42278 cut-off events. [2023-08-30 11:10:59,532 INFO L131 PetriNetUnfolder]: For 124280/124548 co-relation queries the response was YES. [2023-08-30 11:10:59,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146645 conditions, 42278 events. 27123/42278 cut-off events. For 124280/124548 co-relation queries the response was YES. Maximal size of possible extension queue 1180. Compared 316015 event pairs, 9961 based on Foata normal form. 439/41332 useless extension candidates. Maximal degree in co-relation 146610. Up to 36349 conditions per place. [2023-08-30 11:10:59,741 INFO L137 encePairwiseOnDemand]: 255/266 looper letters, 236 selfloop transitions, 90 changer transitions 0/341 dead transitions. [2023-08-30 11:10:59,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 341 transitions, 3912 flow [2023-08-30 11:10:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 11:10:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 11:10:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-08-30 11:10:59,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5240601503759399 [2023-08-30 11:10:59,743 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-08-30 11:10:59,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-08-30 11:10:59,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:10:59,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-08-30 11:10:59,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:59,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:59,745 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:10:59,746 INFO L175 Difference]: Start difference. First operand has 106 places, 240 transitions, 2425 flow. Second operand 5 states and 697 transitions. [2023-08-30 11:10:59,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 341 transitions, 3912 flow [2023-08-30 11:11:00,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 341 transitions, 3814 flow, removed 35 selfloop flow, removed 1 redundant places. [2023-08-30 11:11:00,212 INFO L231 Difference]: Finished difference. Result has 112 places, 287 transitions, 3274 flow [2023-08-30 11:11:00,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=2355, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3274, PETRI_PLACES=112, PETRI_TRANSITIONS=287} [2023-08-30 11:11:00,213 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 43 predicate places. [2023-08-30 11:11:00,213 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 287 transitions, 3274 flow [2023-08-30 11:11:00,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:00,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:11:00,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:11:00,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 11:11:00,214 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:11:00,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:11:00,214 INFO L85 PathProgramCache]: Analyzing trace with hash 49308894, now seen corresponding path program 1 times [2023-08-30 11:11:00,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:11:00,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902892740] [2023-08-30 11:11:00,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:11:00,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:11:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:11:00,426 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-30 11:11:00,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:11:00,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902892740] [2023-08-30 11:11:00,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902892740] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:11:00,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:11:00,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 11:11:00,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885682315] [2023-08-30 11:11:00,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:11:00,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 11:11:00,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:11:00,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 11:11:00,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 11:11:00,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-30 11:11:00,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 287 transitions, 3274 flow. Second operand has 6 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-30 11:11:00,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:11:00,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-30 11:11:00,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:11:04,892 INFO L130 PetriNetUnfolder]: 32105/50526 cut-off events. [2023-08-30 11:11:04,892 INFO L131 PetriNetUnfolder]: For 204019/206380 co-relation queries the response was YES. [2023-08-30 11:11:05,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179967 conditions, 50526 events. 32105/50526 cut-off events. For 204019/206380 co-relation queries the response was YES. Maximal size of possible extension queue 1442. Compared 393540 event pairs, 6554 based on Foata normal form. 1993/50829 useless extension candidates. Maximal degree in co-relation 179928. Up to 33037 conditions per place. [2023-08-30 11:11:05,208 INFO L137 encePairwiseOnDemand]: 256/266 looper letters, 307 selfloop transitions, 113 changer transitions 0/445 dead transitions. [2023-08-30 11:11:05,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 445 transitions, 5459 flow [2023-08-30 11:11:05,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 11:11:05,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 11:11:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2023-08-30 11:11:05,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5270676691729324 [2023-08-30 11:11:05,210 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 701 transitions. [2023-08-30 11:11:05,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 701 transitions. [2023-08-30 11:11:05,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:11:05,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 701 transitions. [2023-08-30 11:11:05,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:05,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:05,213 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:05,214 INFO L175 Difference]: Start difference. First operand has 112 places, 287 transitions, 3274 flow. Second operand 5 states and 701 transitions. [2023-08-30 11:11:05,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 445 transitions, 5459 flow [2023-08-30 11:11:05,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 445 transitions, 5429 flow, removed 15 selfloop flow, removed 0 redundant places. [2023-08-30 11:11:05,989 INFO L231 Difference]: Finished difference. Result has 118 places, 345 transitions, 4389 flow [2023-08-30 11:11:05,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=3246, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4389, PETRI_PLACES=118, PETRI_TRANSITIONS=345} [2023-08-30 11:11:05,991 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 49 predicate places. [2023-08-30 11:11:05,991 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 345 transitions, 4389 flow [2023-08-30 11:11:05,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-30 11:11:05,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:11:05,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:11:05,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 11:11:05,991 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:11:05,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:11:05,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1429082072, now seen corresponding path program 2 times [2023-08-30 11:11:05,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:11:05,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105474415] [2023-08-30 11:11:05,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:11:05,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:11:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:11:06,189 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-30 11:11:06,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:11:06,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105474415] [2023-08-30 11:11:06,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105474415] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:11:06,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:11:06,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 11:11:06,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123959802] [2023-08-30 11:11:06,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:11:06,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 11:11:06,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:11:06,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 11:11:06,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 11:11:06,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-30 11:11:06,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 345 transitions, 4389 flow. Second operand has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:06,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:11:06,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-30 11:11:06,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:11:11,396 INFO L130 PetriNetUnfolder]: 34123/53457 cut-off events. [2023-08-30 11:11:11,396 INFO L131 PetriNetUnfolder]: For 254322/258235 co-relation queries the response was YES. [2023-08-30 11:11:11,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199415 conditions, 53457 events. 34123/53457 cut-off events. For 254322/258235 co-relation queries the response was YES. Maximal size of possible extension queue 1587. Compared 419368 event pairs, 10577 based on Foata normal form. 2977/54551 useless extension candidates. Maximal degree in co-relation 199372. Up to 44782 conditions per place. [2023-08-30 11:11:11,723 INFO L137 encePairwiseOnDemand]: 252/266 looper letters, 340 selfloop transitions, 137 changer transitions 0/529 dead transitions. [2023-08-30 11:11:11,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 529 transitions, 7011 flow [2023-08-30 11:11:11,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 11:11:11,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 11:11:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1076 transitions. [2023-08-30 11:11:11,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056390977443609 [2023-08-30 11:11:11,726 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1076 transitions. [2023-08-30 11:11:11,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1076 transitions. [2023-08-30 11:11:11,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:11:11,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1076 transitions. [2023-08-30 11:11:11,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.5) internal successors, (1076), 8 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:11,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:11,730 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:11,730 INFO L175 Difference]: Start difference. First operand has 118 places, 345 transitions, 4389 flow. Second operand 8 states and 1076 transitions. [2023-08-30 11:11:11,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 529 transitions, 7011 flow [2023-08-30 11:11:12,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 529 transitions, 6940 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-08-30 11:11:12,425 INFO L231 Difference]: Finished difference. Result has 130 places, 439 transitions, 6128 flow [2023-08-30 11:11:12,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=4341, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6128, PETRI_PLACES=130, PETRI_TRANSITIONS=439} [2023-08-30 11:11:12,426 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 61 predicate places. [2023-08-30 11:11:12,426 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 439 transitions, 6128 flow [2023-08-30 11:11:12,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:12,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:11:12,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:11:12,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 11:11:12,427 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:11:12,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:11:12,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1267168118, now seen corresponding path program 1 times [2023-08-30 11:11:12,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:11:12,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241095543] [2023-08-30 11:11:12,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:11:12,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:11:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:11:12,722 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-30 11:11:12,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:11:12,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241095543] [2023-08-30 11:11:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241095543] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:11:12,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:11:12,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 11:11:12,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248250413] [2023-08-30 11:11:12,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:11:12,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 11:11:12,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:11:12,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 11:11:12,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 11:11:12,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 266 [2023-08-30 11:11:12,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 439 transitions, 6128 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:12,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:11:12,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 266 [2023-08-30 11:11:12,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:11:18,753 INFO L130 PetriNetUnfolder]: 36237/56753 cut-off events. [2023-08-30 11:11:18,753 INFO L131 PetriNetUnfolder]: For 311348/314016 co-relation queries the response was YES. [2023-08-30 11:11:18,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227675 conditions, 56753 events. 36237/56753 cut-off events. For 311348/314016 co-relation queries the response was YES. Maximal size of possible extension queue 1638. Compared 445579 event pairs, 9822 based on Foata normal form. 1922/56767 useless extension candidates. Maximal degree in co-relation 227625. Up to 46413 conditions per place. [2023-08-30 11:11:19,183 INFO L137 encePairwiseOnDemand]: 254/266 looper letters, 369 selfloop transitions, 147 changer transitions 0/541 dead transitions. [2023-08-30 11:11:19,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 541 transitions, 7891 flow [2023-08-30 11:11:19,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 11:11:19,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 11:11:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 824 transitions. [2023-08-30 11:11:19,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5162907268170426 [2023-08-30 11:11:19,186 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 824 transitions. [2023-08-30 11:11:19,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 824 transitions. [2023-08-30 11:11:19,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:11:19,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 824 transitions. [2023-08-30 11:11:19,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.33333333333334) internal successors, (824), 6 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:19,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:19,189 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:19,189 INFO L175 Difference]: Start difference. First operand has 130 places, 439 transitions, 6128 flow. Second operand 6 states and 824 transitions. [2023-08-30 11:11:19,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 541 transitions, 7891 flow [2023-08-30 11:11:20,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 541 transitions, 7827 flow, removed 32 selfloop flow, removed 0 redundant places. [2023-08-30 11:11:20,478 INFO L231 Difference]: Finished difference. Result has 139 places, 471 transitions, 6948 flow [2023-08-30 11:11:20,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=6049, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6948, PETRI_PLACES=139, PETRI_TRANSITIONS=471} [2023-08-30 11:11:20,478 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 70 predicate places. [2023-08-30 11:11:20,478 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 471 transitions, 6948 flow [2023-08-30 11:11:20,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:20,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:11:20,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:11:20,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 11:11:20,479 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:11:20,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:11:20,479 INFO L85 PathProgramCache]: Analyzing trace with hash -869258823, now seen corresponding path program 1 times [2023-08-30 11:11:20,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:11:20,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365093090] [2023-08-30 11:11:20,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:11:20,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:11:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:11:20,709 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-30 11:11:20,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:11:20,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365093090] [2023-08-30 11:11:20,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365093090] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:11:20,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:11:20,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 11:11:20,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43738075] [2023-08-30 11:11:20,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:11:20,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 11:11:20,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:11:20,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 11:11:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-08-30 11:11:20,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-30 11:11:20,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 471 transitions, 6948 flow. Second operand has 8 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:20,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:11:20,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-30 11:11:20,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:11:27,222 INFO L130 PetriNetUnfolder]: 36897/57879 cut-off events. [2023-08-30 11:11:27,222 INFO L131 PetriNetUnfolder]: For 334765/336095 co-relation queries the response was YES. [2023-08-30 11:11:27,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243366 conditions, 57879 events. 36897/57879 cut-off events. For 334765/336095 co-relation queries the response was YES. Maximal size of possible extension queue 1682. Compared 456004 event pairs, 9328 based on Foata normal form. 1034/57037 useless extension candidates. Maximal degree in co-relation 243310. Up to 47515 conditions per place. [2023-08-30 11:11:27,816 INFO L137 encePairwiseOnDemand]: 255/266 looper letters, 441 selfloop transitions, 166 changer transitions 0/621 dead transitions. [2023-08-30 11:11:27,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 621 transitions, 9247 flow [2023-08-30 11:11:27,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 11:11:27,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 11:11:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1199 transitions. [2023-08-30 11:11:27,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008354218880535 [2023-08-30 11:11:27,826 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1199 transitions. [2023-08-30 11:11:27,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1199 transitions. [2023-08-30 11:11:27,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:11:27,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1199 transitions. [2023-08-30 11:11:27,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 133.22222222222223) internal successors, (1199), 9 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:27,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:27,830 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:27,830 INFO L175 Difference]: Start difference. First operand has 139 places, 471 transitions, 6948 flow. Second operand 9 states and 1199 transitions. [2023-08-30 11:11:27,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 621 transitions, 9247 flow [2023-08-30 11:11:29,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 621 transitions, 9237 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-08-30 11:11:29,225 INFO L231 Difference]: Finished difference. Result has 150 places, 524 transitions, 8120 flow [2023-08-30 11:11:29,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=6942, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8120, PETRI_PLACES=150, PETRI_TRANSITIONS=524} [2023-08-30 11:11:29,225 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 81 predicate places. [2023-08-30 11:11:29,226 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 524 transitions, 8120 flow [2023-08-30 11:11:29,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:29,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:11:29,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:11:29,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 11:11:29,226 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:11:29,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:11:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash 156737964, now seen corresponding path program 1 times [2023-08-30 11:11:29,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:11:29,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712272555] [2023-08-30 11:11:29,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:11:29,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:11:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:11:29,433 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-30 11:11:29,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:11:29,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712272555] [2023-08-30 11:11:29,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712272555] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:11:29,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:11:29,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 11:11:29,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333692602] [2023-08-30 11:11:29,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:11:29,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 11:11:29,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:11:29,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 11:11:29,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 11:11:29,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-30 11:11:29,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 524 transitions, 8120 flow. Second operand has 6 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:29,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:11:29,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-30 11:11:29,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:11:33,007 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 62#thread1EXITtrue, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 135#L191-1true, 249#true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 49#L103true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:33,007 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 11:11:33,007 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:11:33,007 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:11:33,007 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:11:33,008 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), 296#true, Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 62#thread1EXITtrue, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 135#L191-1true, 249#true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 49#L103true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:33,008 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-30 11:11:33,008 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:11:33,008 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:11:33,008 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-30 11:11:33,502 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 62#thread1EXITtrue, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 135#L191-1true, 249#true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 7#L106true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:33,503 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 11:11:33,503 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:11:33,503 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:11:33,503 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:11:33,503 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 62#thread1EXITtrue, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 135#L191-1true, 249#true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 7#L106true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:33,503 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 11:11:33,503 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:11:33,503 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:11:33,503 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:11:33,504 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), 91#L191-2true, Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 49#L103true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:33,504 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 11:11:33,504 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:11:33,504 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:11:33,504 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:11:33,504 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 91#L191-2true, Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), 296#true, Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 49#L103true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:33,504 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-30 11:11:33,504 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:11:33,504 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:11:33,504 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-30 11:11:33,810 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, 163#L192-1true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 49#L103true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:33,810 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,810 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,810 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,810 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,811 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), 296#true, Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, 163#L192-1true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 49#L103true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:33,811 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,811 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,811 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,811 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,851 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 62#thread1EXITtrue, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 28#L109true, 135#L191-1true, 249#true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:33,851 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,851 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,851 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,851 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,852 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 62#thread1EXITtrue, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 28#L109true, 135#L191-1true, 249#true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:33,852 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,852 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,852 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,852 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,852 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), 91#L191-2true, Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 7#L106true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:33,852 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,852 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,852 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,853 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,853 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 91#L191-2true, Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 7#L106true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:33,853 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,853 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,853 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:33,853 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-30 11:11:34,331 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, 163#L192-1true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 7#L106true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:34,332 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,332 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,332 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,332 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,332 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), 296#true, Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, 163#L192-1true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, 7#L106true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:34,333 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,333 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,333 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,333 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,379 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 62#thread1EXITtrue, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 135#L191-1true, 249#true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 13#L112true, 176#true]) [2023-08-30 11:11:34,379 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,379 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,379 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,379 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,379 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 62#thread1EXITtrue, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 135#L191-1true, 249#true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 13#L112true, 176#true]) [2023-08-30 11:11:34,379 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,379 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,379 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,379 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,380 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), 91#L191-2true, Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 28#L109true, 249#true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:34,380 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,380 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,380 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,380 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,380 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), 91#L191-2true, Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 28#L109true, 249#true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:34,380 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,380 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,380 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,380 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-30 11:11:34,704 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 28#L109true, 249#true, 163#L192-1true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:34,705 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,705 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,705 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,705 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,705 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 28#L109true, 249#true, 163#L192-1true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:34,705 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,705 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,705 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,705 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,759 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 91#L191-2true, 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 13#L112true, 176#true]) [2023-08-30 11:11:34,759 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,759 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,759 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,760 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,760 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 91#L191-2true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 13#L112true, 176#true]) [2023-08-30 11:11:34,760 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,760 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,760 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,760 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,760 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 62#thread1EXITtrue, 74#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 135#L191-1true, 249#true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:34,760 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,760 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,760 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,760 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,761 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 62#thread1EXITtrue, 74#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 135#L191-1true, 249#true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:34,761 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,761 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,761 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,761 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,761 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 62#thread1EXITtrue, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 135#L191-1true, 249#true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, 122#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:34,761 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,761 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,761 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,761 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,762 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 62#thread1EXITtrue, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 135#L191-1true, 249#true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 122#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:34,762 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,762 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,762 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:34,762 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-30 11:11:35,051 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, 163#L192-1true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 13#L112true, 176#true]) [2023-08-30 11:11:35,052 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,052 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,052 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,052 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,052 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), 296#true, Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, 163#L192-1true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 13#L112true, 176#true]) [2023-08-30 11:11:35,052 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,052 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,052 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,052 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,105 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 62#thread1EXITtrue, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 135#L191-1true, 249#true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 149#L119true, Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:35,106 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,106 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,106 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,106 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,106 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), 296#true, Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 62#thread1EXITtrue, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 135#L191-1true, 249#true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 149#L119true, Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:35,106 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,106 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,106 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,106 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,107 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 91#L191-2true, 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 74#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:35,107 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,107 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,107 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,107 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,107 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 91#L191-2true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), 296#true, Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 74#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 249#true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:35,107 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,107 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,107 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,107 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,108 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 91#L191-2true, 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, 122#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:35,108 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,108 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,108 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,108 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,108 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 91#L191-2true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), 296#true, Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 249#true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 122#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:35,109 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,109 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,109 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,109 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-30 11:11:35,510 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 74#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, 163#L192-1true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:35,510 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,510 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,510 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,510 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,510 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), 296#true, Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, 74#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, 163#L192-1true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:35,510 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,510 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,510 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,510 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,511 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, 163#L192-1true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, 122#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:35,511 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,511 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,511 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,511 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,511 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), 296#true, Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, 163#L192-1true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 122#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:35,511 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,511 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,512 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,512 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,568 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), 91#L191-2true, Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 149#L119true, Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:35,568 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,568 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,568 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,568 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,568 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 91#L191-2true, Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 204#true, 285#true, 188#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 149#L119true, Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:35,568 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,568 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,568 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,568 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-30 11:11:35,755 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([610] L133-->L136: Formula: (= v_~n3~0_7 (ite (< v_~n3~0_8 v_~n2~0_12) v_~n2~0_12 v_~n3~0_8)) InVars {~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_8} OutVars{~n2~0=v_~n2~0_12, ~n3~0=v_~n3~0_7} AuxVars[] AssignedVars[~n3~0][274], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), 186#(<= 0 ~n3~0), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), 296#true, Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, 163#L192-1true, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), 29#L136true, Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), 149#L119true, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:35,756 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 11:11:35,756 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 11:11:35,756 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 11:11:35,756 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 11:11:35,756 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] L133-->thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (= v_~n3~0_65 |v_thread3Thread1of1ForFork0_#t~post3#1_11|) (= v_~n3~0_65 (ite (< v_~n3~0_66 v_~n2~0_55) v_~n2~0_55 v_~n3~0_66)) (< 2147483646 |v_thread3Thread1of1ForFork0_#t~post3#1_11|)) InVars {~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_66} OutVars{~n2~0=v_~n2~0_55, ~n3~0=v_~n3~0_65, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_11|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][275], [Black: 253#(and (= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 1)), Black: 251#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 254#(and (<= ~n1~0 0) (<= ~n3~0 1)), 312#true, 186#(<= 0 ~n3~0), Black: 264#(and (<= ~n2~0 2147483646) (<= ~n3~0 1)), Black: 263#(and (<= ~n2~0 2147483646) (<= ~n1~0 1) (<= ~n3~0 0)), Black: 271#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 277#(and (<= ~n1~0 1) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= (+ ~n3~0 1) ~n1~0)), Black: 275#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0))), Black: 272#(and (<= ~n1~0 1) (= ~n1~0 ~n3~0) (<= (+ ~n2~0 1) ~n1~0)), 296#true, Black: 273#(and (or (<= (+ ~n2~0 1) ~n3~0) (= ~n2~0 ~n3~0)) (<= ~n3~0 1)), Black: 270#(and (<= ~n1~0 0) (<= ~n3~0 ~n1~0) (<= ~n2~0 ~n1~0)), 285#true, 188#true, 204#true, Black: 289#(and (<= ~n2~0 1) (or (= ~n2~0 ~n1~0) (= ~n1~0 0)) (= ~n3~0 0)), Black: 288#(and (<= ~n2~0 1) (= ~n3~0 0) (= ~n1~0 0)), Black: 290#(and (or (= ~n2~0 ~n3~0) (= ~n3~0 0)) (<= ~n2~0 1)), Black: 287#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), thread3Thread1of1ForFork0InUse, Black: 179#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 303#(or (and (<= ~n2~0 0) (<= ~n3~0 0)) (and (<= ~n3~0 ~n2~0) (<= ~n2~0 1))), Black: 302#(or (and (= ~n2~0 ~n3~0) (<= ~n3~0 1)) (and (<= ~n2~0 0) (<= ~n3~0 0))), 241#true, Black: 178#(and (<= ~n1~0 0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 301#(and (or (and (<= ~n2~0 0) (<= ~n3~0 0)) (<= (+ ~n3~0 1) ~n1~0)) (or (<= ~n1~0 ~n3~0) (and (= ~n2~0 ~n1~0) (<= ~n1~0 1)))), 249#true, 163#L192-1true, 113#thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 190#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 0) (<= ~n2~0 ~n3~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 192#(and (<= ~n2~0 0) (<= ~n3~0 0)), 259#true, Black: 201#(and (<= ~n3~0 2147483646) (or (<= ~n2~0 1) (= ~n2~0 ~n3~0))), 225#true, Black: 214#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 208#(and (<= ~n3~0 ~n2~0) (or (< ~n1~0 ~n3~0) (and (< ~n1~0 (+ ~n2~0 1)) (<= ~n2~0 ~n1~0)))), Black: 206#(<= ~n1~0 ~n2~0), Black: 207#(and (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), Black: 216#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646) (<= ~n1~0 ~n2~0)), Black: 209#(and (<= ~n1~0 2147483646) (<= ~n3~0 2147483646)), Black: 227#(and (<= ~n2~0 0) (<= ~n1~0 ~n2~0) (<= ~n3~0 0)), Black: 229#(and (<= ~n1~0 0) (<= ~n2~0 1) (<= ~n3~0 0)), Black: 230#(and (or (<= ~n3~0 ~n1~0) (<= ~n3~0 0)) (<= ~n1~0 1)), 149#L119true, Black: 228#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), Black: 238#(= ~i~0 0), 268#true, Black: 244#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 0)), Black: 245#(and (<= (+ ~n1~0 1) ~n3~0) (<= ~n3~0 1)), 176#true]) [2023-08-30 11:11:35,756 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-30 11:11:35,756 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 11:11:35,756 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 11:11:35,756 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-30 11:11:36,759 INFO L130 PetriNetUnfolder]: 37704/58652 cut-off events. [2023-08-30 11:11:36,759 INFO L131 PetriNetUnfolder]: For 376494/378557 co-relation queries the response was YES. [2023-08-30 11:11:37,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256324 conditions, 58652 events. 37704/58652 cut-off events. For 376494/378557 co-relation queries the response was YES. Maximal size of possible extension queue 1716. Compared 458455 event pairs, 12935 based on Foata normal form. 1162/57749 useless extension candidates. Maximal degree in co-relation 256263. Up to 50844 conditions per place. [2023-08-30 11:11:37,227 INFO L137 encePairwiseOnDemand]: 258/266 looper letters, 405 selfloop transitions, 155 changer transitions 0/600 dead transitions. [2023-08-30 11:11:37,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 600 transitions, 9927 flow [2023-08-30 11:11:37,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 11:11:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 11:11:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 675 transitions. [2023-08-30 11:11:37,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075187969924813 [2023-08-30 11:11:37,229 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 675 transitions. [2023-08-30 11:11:37,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 675 transitions. [2023-08-30 11:11:37,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:11:37,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 675 transitions. [2023-08-30 11:11:37,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:37,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:37,232 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:37,232 INFO L175 Difference]: Start difference. First operand has 150 places, 524 transitions, 8120 flow. Second operand 5 states and 675 transitions. [2023-08-30 11:11:37,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 600 transitions, 9927 flow [2023-08-30 11:11:39,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 600 transitions, 9680 flow, removed 70 selfloop flow, removed 3 redundant places. [2023-08-30 11:11:39,111 INFO L231 Difference]: Finished difference. Result has 152 places, 550 transitions, 8677 flow [2023-08-30 11:11:39,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=7875, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8677, PETRI_PLACES=152, PETRI_TRANSITIONS=550} [2023-08-30 11:11:39,111 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 83 predicate places. [2023-08-30 11:11:39,111 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 550 transitions, 8677 flow [2023-08-30 11:11:39,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:39,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:11:39,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:11:39,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 11:11:39,112 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:11:39,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:11:39,112 INFO L85 PathProgramCache]: Analyzing trace with hash 465402263, now seen corresponding path program 1 times [2023-08-30 11:11:39,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:11:39,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769861043] [2023-08-30 11:11:39,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:11:39,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:11:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:11:39,371 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-30 11:11:39,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:11:39,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769861043] [2023-08-30 11:11:39,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769861043] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:11:39,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:11:39,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 11:11:39,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382518528] [2023-08-30 11:11:39,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:11:39,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 11:11:39,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:11:39,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 11:11:39,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 11:11:39,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-30 11:11:39,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 550 transitions, 8677 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:39,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:11:39,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-30 11:11:39,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:11:47,517 INFO L130 PetriNetUnfolder]: 39328/61216 cut-off events. [2023-08-30 11:11:47,517 INFO L131 PetriNetUnfolder]: For 395483/395488 co-relation queries the response was YES. [2023-08-30 11:11:47,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270901 conditions, 61216 events. 39328/61216 cut-off events. For 395483/395488 co-relation queries the response was YES. Maximal size of possible extension queue 1737. Compared 478118 event pairs, 9633 based on Foata normal form. 238/59640 useless extension candidates. Maximal degree in co-relation 270838. Up to 48444 conditions per place. [2023-08-30 11:11:48,059 INFO L137 encePairwiseOnDemand]: 253/266 looper letters, 487 selfloop transitions, 201 changer transitions 0/697 dead transitions. [2023-08-30 11:11:48,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 697 transitions, 11615 flow [2023-08-30 11:11:48,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 11:11:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 11:11:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 841 transitions. [2023-08-30 11:11:48,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5269423558897243 [2023-08-30 11:11:48,061 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 841 transitions. [2023-08-30 11:11:48,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 841 transitions. [2023-08-30 11:11:48,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:11:48,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 841 transitions. [2023-08-30 11:11:48,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.16666666666666) internal successors, (841), 6 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:48,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:48,064 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:48,064 INFO L175 Difference]: Start difference. First operand has 152 places, 550 transitions, 8677 flow. Second operand 6 states and 841 transitions. [2023-08-30 11:11:48,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 697 transitions, 11615 flow [2023-08-30 11:11:49,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 697 transitions, 11398 flow, removed 23 selfloop flow, removed 2 redundant places. [2023-08-30 11:11:49,770 INFO L231 Difference]: Finished difference. Result has 158 places, 599 transitions, 10110 flow [2023-08-30 11:11:49,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=8487, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10110, PETRI_PLACES=158, PETRI_TRANSITIONS=599} [2023-08-30 11:11:49,771 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 89 predicate places. [2023-08-30 11:11:49,771 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 599 transitions, 10110 flow [2023-08-30 11:11:49,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:49,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:11:49,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:11:49,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 11:11:49,772 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:11:49,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:11:49,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1221782686, now seen corresponding path program 2 times [2023-08-30 11:11:49,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:11:49,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817002328] [2023-08-30 11:11:49,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:11:49,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:11:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:11:49,955 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-30 11:11:49,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:11:49,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817002328] [2023-08-30 11:11:49,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817002328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:11:49,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:11:49,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 11:11:49,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735534596] [2023-08-30 11:11:49,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:11:49,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 11:11:49,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:11:49,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 11:11:49,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 11:11:49,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-30 11:11:49,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 599 transitions, 10110 flow. Second operand has 6 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:49,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:11:49,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-30 11:11:49,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:11:58,043 INFO L130 PetriNetUnfolder]: 37623/58888 cut-off events. [2023-08-30 11:11:58,043 INFO L131 PetriNetUnfolder]: For 463536/465508 co-relation queries the response was YES. [2023-08-30 11:11:58,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272453 conditions, 58888 events. 37623/58888 cut-off events. For 463536/465508 co-relation queries the response was YES. Maximal size of possible extension queue 1745. Compared 466431 event pairs, 9318 based on Foata normal form. 1623/58406 useless extension candidates. Maximal degree in co-relation 272387. Up to 48136 conditions per place. [2023-08-30 11:11:58,515 INFO L137 encePairwiseOnDemand]: 254/266 looper letters, 466 selfloop transitions, 198 changer transitions 0/696 dead transitions. [2023-08-30 11:11:58,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 696 transitions, 12245 flow [2023-08-30 11:11:58,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 11:11:58,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 11:11:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 820 transitions. [2023-08-30 11:11:58,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5137844611528822 [2023-08-30 11:11:58,517 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 820 transitions. [2023-08-30 11:11:58,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 820 transitions. [2023-08-30 11:11:58,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:11:58,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 820 transitions. [2023-08-30 11:11:58,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:58,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:58,520 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:11:58,520 INFO L175 Difference]: Start difference. First operand has 158 places, 599 transitions, 10110 flow. Second operand 6 states and 820 transitions. [2023-08-30 11:11:58,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 696 transitions, 12245 flow [2023-08-30 11:12:00,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 696 transitions, 12144 flow, removed 22 selfloop flow, removed 1 redundant places. [2023-08-30 11:12:00,876 INFO L231 Difference]: Finished difference. Result has 164 places, 619 transitions, 10945 flow [2023-08-30 11:12:00,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=10011, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10945, PETRI_PLACES=164, PETRI_TRANSITIONS=619} [2023-08-30 11:12:00,876 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 95 predicate places. [2023-08-30 11:12:00,877 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 619 transitions, 10945 flow [2023-08-30 11:12:00,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:00,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:12:00,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:12:00,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 11:12:00,877 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:12:00,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:12:00,877 INFO L85 PathProgramCache]: Analyzing trace with hash -701844438, now seen corresponding path program 3 times [2023-08-30 11:12:00,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:12:00,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203913320] [2023-08-30 11:12:00,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:12:00,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:12:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:12:01,081 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-30 11:12:01,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:12:01,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203913320] [2023-08-30 11:12:01,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203913320] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:12:01,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:12:01,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 11:12:01,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236980702] [2023-08-30 11:12:01,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:12:01,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 11:12:01,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:12:01,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 11:12:01,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-08-30 11:12:01,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-30 11:12:01,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 619 transitions, 10945 flow. Second operand has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:01,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:12:01,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-30 11:12:01,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:12:09,449 INFO L130 PetriNetUnfolder]: 39158/61060 cut-off events. [2023-08-30 11:12:09,450 INFO L131 PetriNetUnfolder]: For 496723/497744 co-relation queries the response was YES. [2023-08-30 11:12:09,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291793 conditions, 61060 events. 39158/61060 cut-off events. For 496723/497744 co-relation queries the response was YES. Maximal size of possible extension queue 1778. Compared 481730 event pairs, 12803 based on Foata normal form. 658/59793 useless extension candidates. Maximal degree in co-relation 291724. Up to 52339 conditions per place. [2023-08-30 11:12:09,984 INFO L137 encePairwiseOnDemand]: 255/266 looper letters, 533 selfloop transitions, 159 changer transitions 0/706 dead transitions. [2023-08-30 11:12:09,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 706 transitions, 13124 flow [2023-08-30 11:12:09,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 11:12:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 11:12:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 803 transitions. [2023-08-30 11:12:09,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5031328320802005 [2023-08-30 11:12:09,988 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 803 transitions. [2023-08-30 11:12:09,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 803 transitions. [2023-08-30 11:12:09,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:12:09,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 803 transitions. [2023-08-30 11:12:09,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:09,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:09,990 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:09,990 INFO L175 Difference]: Start difference. First operand has 164 places, 619 transitions, 10945 flow. Second operand 6 states and 803 transitions. [2023-08-30 11:12:09,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 706 transitions, 13124 flow [2023-08-30 11:12:12,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 706 transitions, 12890 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-30 11:12:12,464 INFO L231 Difference]: Finished difference. Result has 169 places, 644 transitions, 11573 flow [2023-08-30 11:12:12,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=10711, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11573, PETRI_PLACES=169, PETRI_TRANSITIONS=644} [2023-08-30 11:12:12,465 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 100 predicate places. [2023-08-30 11:12:12,465 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 644 transitions, 11573 flow [2023-08-30 11:12:12,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:12,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:12:12,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:12:12,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 11:12:12,466 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:12:12,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:12:12,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1075938565, now seen corresponding path program 1 times [2023-08-30 11:12:12,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:12:12,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942056648] [2023-08-30 11:12:12,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:12:12,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:12:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:12:12,630 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-30 11:12:12,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:12:12,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942056648] [2023-08-30 11:12:12,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942056648] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:12:12,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:12:12,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 11:12:12,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216665696] [2023-08-30 11:12:12,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:12:12,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 11:12:12,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:12:12,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 11:12:12,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-08-30 11:12:12,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-30 11:12:12,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 644 transitions, 11573 flow. Second operand has 8 states, 8 states have (on average 117.75) internal successors, (942), 8 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:12,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:12:12,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-30 11:12:12,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:12:22,580 INFO L130 PetriNetUnfolder]: 44707/69711 cut-off events. [2023-08-30 11:12:22,580 INFO L131 PetriNetUnfolder]: For 566814/566819 co-relation queries the response was YES. [2023-08-30 11:12:23,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325406 conditions, 69711 events. 44707/69711 cut-off events. For 566814/566819 co-relation queries the response was YES. Maximal size of possible extension queue 1980. Compared 555920 event pairs, 8319 based on Foata normal form. 370/67897 useless extension candidates. Maximal degree in co-relation 325334. Up to 39223 conditions per place. [2023-08-30 11:12:23,410 INFO L137 encePairwiseOnDemand]: 254/266 looper letters, 549 selfloop transitions, 274 changer transitions 0/832 dead transitions. [2023-08-30 11:12:23,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 832 transitions, 14825 flow [2023-08-30 11:12:23,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 11:12:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 11:12:23,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 995 transitions. [2023-08-30 11:12:23,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5343716433941997 [2023-08-30 11:12:23,412 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 995 transitions. [2023-08-30 11:12:23,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 995 transitions. [2023-08-30 11:12:23,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:12:23,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 995 transitions. [2023-08-30 11:12:23,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.14285714285714) internal successors, (995), 7 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:23,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:23,416 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:23,416 INFO L175 Difference]: Start difference. First operand has 169 places, 644 transitions, 11573 flow. Second operand 7 states and 995 transitions. [2023-08-30 11:12:23,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 832 transitions, 14825 flow [2023-08-30 11:12:26,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 832 transitions, 14411 flow, removed 18 selfloop flow, removed 7 redundant places. [2023-08-30 11:12:26,429 INFO L231 Difference]: Finished difference. Result has 173 places, 660 transitions, 12384 flow [2023-08-30 11:12:26,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=10697, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=240, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12384, PETRI_PLACES=173, PETRI_TRANSITIONS=660} [2023-08-30 11:12:26,430 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 104 predicate places. [2023-08-30 11:12:26,431 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 660 transitions, 12384 flow [2023-08-30 11:12:26,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.75) internal successors, (942), 8 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:26,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:12:26,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:12:26,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 11:12:26,431 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:12:26,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:12:26,432 INFO L85 PathProgramCache]: Analyzing trace with hash 867035426, now seen corresponding path program 4 times [2023-08-30 11:12:26,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:12:26,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630080287] [2023-08-30 11:12:26,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:12:26,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:12:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:12:26,749 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-30 11:12:26,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:12:26,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630080287] [2023-08-30 11:12:26,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630080287] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:12:26,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:12:26,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 11:12:26,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247120124] [2023-08-30 11:12:26,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:12:26,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 11:12:26,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:12:26,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 11:12:26,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 11:12:26,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 266 [2023-08-30 11:12:26,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 660 transitions, 12384 flow. Second operand has 7 states, 7 states have (on average 118.57142857142857) internal successors, (830), 7 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:26,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:12:26,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 266 [2023-08-30 11:12:26,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:12:37,875 INFO L130 PetriNetUnfolder]: 44739/70546 cut-off events. [2023-08-30 11:12:37,875 INFO L131 PetriNetUnfolder]: For 705603/713389 co-relation queries the response was YES. [2023-08-30 11:12:38,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339883 conditions, 70546 events. 44739/70546 cut-off events. For 705603/713389 co-relation queries the response was YES. Maximal size of possible extension queue 2189. Compared 579113 event pairs, 16580 based on Foata normal form. 3193/70853 useless extension candidates. Maximal degree in co-relation 339809. Up to 55841 conditions per place. [2023-08-30 11:12:38,572 INFO L137 encePairwiseOnDemand]: 253/266 looper letters, 560 selfloop transitions, 209 changer transitions 0/826 dead transitions. [2023-08-30 11:12:38,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 826 transitions, 15343 flow [2023-08-30 11:12:38,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 11:12:38,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 11:12:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 987 transitions. [2023-08-30 11:12:38,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5300751879699248 [2023-08-30 11:12:38,574 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 987 transitions. [2023-08-30 11:12:38,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 987 transitions. [2023-08-30 11:12:38,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:12:38,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 987 transitions. [2023-08-30 11:12:38,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.0) internal successors, (987), 7 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:38,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:38,577 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:38,577 INFO L175 Difference]: Start difference. First operand has 173 places, 660 transitions, 12384 flow. Second operand 7 states and 987 transitions. [2023-08-30 11:12:38,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 826 transitions, 15343 flow [2023-08-30 11:12:41,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 826 transitions, 15213 flow, removed 50 selfloop flow, removed 1 redundant places. [2023-08-30 11:12:41,832 INFO L231 Difference]: Finished difference. Result has 181 places, 710 transitions, 13784 flow [2023-08-30 11:12:41,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=12276, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13784, PETRI_PLACES=181, PETRI_TRANSITIONS=710} [2023-08-30 11:12:41,833 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 112 predicate places. [2023-08-30 11:12:41,833 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 710 transitions, 13784 flow [2023-08-30 11:12:41,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.57142857142857) internal successors, (830), 7 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:41,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:12:41,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:12:41,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 11:12:41,833 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:12:41,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:12:41,834 INFO L85 PathProgramCache]: Analyzing trace with hash -14156756, now seen corresponding path program 5 times [2023-08-30 11:12:41,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:12:41,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994902930] [2023-08-30 11:12:41,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:12:41,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:12:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:12:41,996 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-30 11:12:41,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:12:41,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994902930] [2023-08-30 11:12:41,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994902930] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:12:41,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:12:41,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 11:12:41,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598652651] [2023-08-30 11:12:41,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:12:41,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 11:12:41,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:12:41,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 11:12:41,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-30 11:12:42,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-30 11:12:42,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 710 transitions, 13784 flow. Second operand has 7 states, 7 states have (on average 117.57142857142857) internal successors, (823), 7 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:42,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:12:42,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-30 11:12:42,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:12:53,952 INFO L130 PetriNetUnfolder]: 47621/74795 cut-off events. [2023-08-30 11:12:53,953 INFO L131 PetriNetUnfolder]: For 729075/730842 co-relation queries the response was YES. [2023-08-30 11:12:54,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375478 conditions, 74795 events. 47621/74795 cut-off events. For 729075/730842 co-relation queries the response was YES. Maximal size of possible extension queue 2232. Compared 612370 event pairs, 9093 based on Foata normal form. 1326/73365 useless extension candidates. Maximal degree in co-relation 375400. Up to 56176 conditions per place. [2023-08-30 11:12:54,704 INFO L137 encePairwiseOnDemand]: 256/266 looper letters, 524 selfloop transitions, 286 changer transitions 0/842 dead transitions. [2023-08-30 11:12:54,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 842 transitions, 16908 flow [2023-08-30 11:12:54,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 11:12:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 11:12:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 820 transitions. [2023-08-30 11:12:54,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5137844611528822 [2023-08-30 11:12:54,706 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 820 transitions. [2023-08-30 11:12:54,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 820 transitions. [2023-08-30 11:12:54,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:12:54,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 820 transitions. [2023-08-30 11:12:54,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:54,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:54,709 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:54,709 INFO L175 Difference]: Start difference. First operand has 181 places, 710 transitions, 13784 flow. Second operand 6 states and 820 transitions. [2023-08-30 11:12:54,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 842 transitions, 16908 flow [2023-08-30 11:12:59,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 842 transitions, 16606 flow, removed 111 selfloop flow, removed 2 redundant places. [2023-08-30 11:12:59,639 INFO L231 Difference]: Finished difference. Result has 186 places, 744 transitions, 15003 flow [2023-08-30 11:12:59,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=13490, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=15003, PETRI_PLACES=186, PETRI_TRANSITIONS=744} [2023-08-30 11:12:59,639 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 117 predicate places. [2023-08-30 11:12:59,640 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 744 transitions, 15003 flow [2023-08-30 11:12:59,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.57142857142857) internal successors, (823), 7 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:59,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:12:59,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:12:59,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 11:12:59,640 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:12:59,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:12:59,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1152432709, now seen corresponding path program 2 times [2023-08-30 11:12:59,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:12:59,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125578344] [2023-08-30 11:12:59,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:12:59,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:12:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:12:59,842 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-30 11:12:59,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:12:59,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125578344] [2023-08-30 11:12:59,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125578344] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:12:59,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:12:59,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 11:12:59,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302915435] [2023-08-30 11:12:59,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:12:59,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 11:12:59,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:12:59,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 11:12:59,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 11:12:59,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 266 [2023-08-30 11:12:59,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 744 transitions, 15003 flow. Second operand has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:12:59,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:12:59,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 266 [2023-08-30 11:12:59,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:13:12,316 INFO L130 PetriNetUnfolder]: 48266/75715 cut-off events. [2023-08-30 11:13:12,316 INFO L131 PetriNetUnfolder]: For 880794/888400 co-relation queries the response was YES. [2023-08-30 11:13:12,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388180 conditions, 75715 events. 48266/75715 cut-off events. For 880794/888400 co-relation queries the response was YES. Maximal size of possible extension queue 2336. Compared 619919 event pairs, 10320 based on Foata normal form. 3865/76692 useless extension candidates. Maximal degree in co-relation 388098. Up to 62634 conditions per place. [2023-08-30 11:13:13,102 INFO L137 encePairwiseOnDemand]: 255/266 looper letters, 561 selfloop transitions, 220 changer transitions 0/850 dead transitions. [2023-08-30 11:13:13,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 850 transitions, 17398 flow [2023-08-30 11:13:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 11:13:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 11:13:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 965 transitions. [2023-08-30 11:13:13,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5182599355531686 [2023-08-30 11:13:13,104 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 965 transitions. [2023-08-30 11:13:13,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 965 transitions. [2023-08-30 11:13:13,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:13:13,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 965 transitions. [2023-08-30 11:13:13,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.85714285714286) internal successors, (965), 7 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:13:13,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:13:13,107 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:13:13,107 INFO L175 Difference]: Start difference. First operand has 186 places, 744 transitions, 15003 flow. Second operand 7 states and 965 transitions. [2023-08-30 11:13:13,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 850 transitions, 17398 flow [2023-08-30 11:13:17,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 850 transitions, 17076 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-30 11:13:17,299 INFO L231 Difference]: Finished difference. Result has 192 places, 771 transitions, 15771 flow [2023-08-30 11:13:17,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=14694, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=15771, PETRI_PLACES=192, PETRI_TRANSITIONS=771} [2023-08-30 11:13:17,300 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 123 predicate places. [2023-08-30 11:13:17,300 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 771 transitions, 15771 flow [2023-08-30 11:13:17,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:13:17,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:13:17,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:13:17,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 11:13:17,301 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:13:17,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:13:17,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1459617180, now seen corresponding path program 1 times [2023-08-30 11:13:17,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:13:17,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598832758] [2023-08-30 11:13:17,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:13:17,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:13:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:13:17,439 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-30 11:13:17,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:13:17,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598832758] [2023-08-30 11:13:17,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598832758] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:13:17,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:13:17,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 11:13:17,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353680011] [2023-08-30 11:13:17,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:13:17,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 11:13:17,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:13:17,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 11:13:17,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-30 11:13:17,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 266 [2023-08-30 11:13:17,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 771 transitions, 15771 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:13:17,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:13:17,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 266 [2023-08-30 11:13:17,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:13:30,996 INFO L130 PetriNetUnfolder]: 49948/79412 cut-off events. [2023-08-30 11:13:30,996 INFO L131 PetriNetUnfolder]: For 972937/983448 co-relation queries the response was YES. [2023-08-30 11:13:31,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407112 conditions, 79412 events. 49948/79412 cut-off events. For 972937/983448 co-relation queries the response was YES. Maximal size of possible extension queue 2543. Compared 669672 event pairs, 8029 based on Foata normal form. 4397/80513 useless extension candidates. Maximal degree in co-relation 407027. Up to 39422 conditions per place. [2023-08-30 11:13:31,842 INFO L137 encePairwiseOnDemand]: 256/266 looper letters, 536 selfloop transitions, 310 changer transitions 0/921 dead transitions. [2023-08-30 11:13:31,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 921 transitions, 19210 flow [2023-08-30 11:13:31,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 11:13:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 11:13:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 852 transitions. [2023-08-30 11:13:31,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5338345864661654 [2023-08-30 11:13:31,844 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 852 transitions. [2023-08-30 11:13:31,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 852 transitions. [2023-08-30 11:13:31,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:13:31,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 852 transitions. [2023-08-30 11:13:31,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:13:31,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:13:31,846 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:13:31,847 INFO L175 Difference]: Start difference. First operand has 192 places, 771 transitions, 15771 flow. Second operand 6 states and 852 transitions. [2023-08-30 11:13:31,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 921 transitions, 19210 flow [2023-08-30 11:13:36,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 921 transitions, 19042 flow, removed 68 selfloop flow, removed 1 redundant places. [2023-08-30 11:13:36,760 INFO L231 Difference]: Finished difference. Result has 198 places, 795 transitions, 17121 flow [2023-08-30 11:13:36,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=15619, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=771, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=289, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=465, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=17121, PETRI_PLACES=198, PETRI_TRANSITIONS=795} [2023-08-30 11:13:36,760 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 129 predicate places. [2023-08-30 11:13:36,761 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 795 transitions, 17121 flow [2023-08-30 11:13:36,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:13:36,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:13:36,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:13:36,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 11:13:36,761 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:13:36,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:13:36,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1645293550, now seen corresponding path program 2 times [2023-08-30 11:13:36,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:13:36,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625394616] [2023-08-30 11:13:36,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:13:36,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:13:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:13:36,954 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-30 11:13:36,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:13:36,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625394616] [2023-08-30 11:13:36,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625394616] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:13:36,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:13:36,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 11:13:36,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413718452] [2023-08-30 11:13:36,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:13:36,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 11:13:36,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:13:36,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 11:13:36,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-30 11:13:36,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-30 11:13:36,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 795 transitions, 17121 flow. Second operand has 8 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:13:36,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:13:36,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-30 11:13:36,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:13:54,085 INFO L130 PetriNetUnfolder]: 60614/95020 cut-off events. [2023-08-30 11:13:54,085 INFO L131 PetriNetUnfolder]: For 1082909/1084507 co-relation queries the response was YES. [2023-08-30 11:13:54,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491230 conditions, 95020 events. 60614/95020 cut-off events. For 1082909/1084507 co-relation queries the response was YES. Maximal size of possible extension queue 2860. Compared 797027 event pairs, 12311 based on Foata normal form. 1234/92721 useless extension candidates. Maximal degree in co-relation 491141. Up to 43770 conditions per place. [2023-08-30 11:13:55,363 INFO L137 encePairwiseOnDemand]: 255/266 looper letters, 704 selfloop transitions, 291 changer transitions 0/1039 dead transitions. [2023-08-30 11:13:55,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 1039 transitions, 21931 flow [2023-08-30 11:13:55,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 11:13:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 11:13:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1111 transitions. [2023-08-30 11:13:55,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5220864661654135 [2023-08-30 11:13:55,365 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1111 transitions. [2023-08-30 11:13:55,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1111 transitions. [2023-08-30 11:13:55,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:13:55,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1111 transitions. [2023-08-30 11:13:55,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 138.875) internal successors, (1111), 8 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:13:55,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:13:55,367 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:13:55,367 INFO L175 Difference]: Start difference. First operand has 198 places, 795 transitions, 17121 flow. Second operand 8 states and 1111 transitions. [2023-08-30 11:13:55,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 1039 transitions, 21931 flow [2023-08-30 11:14:03,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 1039 transitions, 21726 flow, removed 34 selfloop flow, removed 2 redundant places. [2023-08-30 11:14:03,113 INFO L231 Difference]: Finished difference. Result has 207 places, 837 transitions, 18892 flow [2023-08-30 11:14:03,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=16960, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=250, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=514, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=18892, PETRI_PLACES=207, PETRI_TRANSITIONS=837} [2023-08-30 11:14:03,114 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 138 predicate places. [2023-08-30 11:14:03,114 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 837 transitions, 18892 flow [2023-08-30 11:14:03,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:14:03,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:14:03,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:14:03,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 11:14:03,115 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:14:03,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:14:03,115 INFO L85 PathProgramCache]: Analyzing trace with hash 414694392, now seen corresponding path program 3 times [2023-08-30 11:14:03,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:14:03,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805031065] [2023-08-30 11:14:03,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:14:03,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:14:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:14:03,343 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-30 11:14:03,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:14:03,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805031065] [2023-08-30 11:14:03,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805031065] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:14:03,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:14:03,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 11:14:03,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081247155] [2023-08-30 11:14:03,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:14:03,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 11:14:03,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:14:03,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 11:14:03,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 11:14:03,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 266 [2023-08-30 11:14:03,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 837 transitions, 18892 flow. Second operand has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:14:03,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:14:03,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 266 [2023-08-30 11:14:03,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:14:23,900 INFO L130 PetriNetUnfolder]: 60623/96374 cut-off events. [2023-08-30 11:14:23,901 INFO L131 PetriNetUnfolder]: For 1398377/1415036 co-relation queries the response was YES. [2023-08-30 11:14:24,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505139 conditions, 96374 events. 60623/96374 cut-off events. For 1398377/1415036 co-relation queries the response was YES. Maximal size of possible extension queue 3151. Compared 834016 event pairs, 14339 based on Foata normal form. 7805/99927 useless extension candidates. Maximal degree in co-relation 505045. Up to 73235 conditions per place. [2023-08-30 11:14:24,973 INFO L137 encePairwiseOnDemand]: 253/266 looper letters, 562 selfloop transitions, 256 changer transitions 1/998 dead transitions. [2023-08-30 11:14:24,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 998 transitions, 22314 flow [2023-08-30 11:14:24,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 11:14:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 11:14:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 972 transitions. [2023-08-30 11:14:24,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5220193340494093 [2023-08-30 11:14:24,975 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 972 transitions. [2023-08-30 11:14:24,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 972 transitions. [2023-08-30 11:14:24,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:14:24,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 972 transitions. [2023-08-30 11:14:24,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.85714285714286) internal successors, (972), 7 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:14:24,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:14:24,977 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:14:24,977 INFO L175 Difference]: Start difference. First operand has 207 places, 837 transitions, 18892 flow. Second operand 7 states and 972 transitions. [2023-08-30 11:14:24,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 998 transitions, 22314 flow [2023-08-30 11:14:32,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 998 transitions, 22153 flow, removed 52 selfloop flow, removed 1 redundant places. [2023-08-30 11:14:32,848 INFO L231 Difference]: Finished difference. Result has 217 places, 891 transitions, 20807 flow [2023-08-30 11:14:32,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=18741, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=20807, PETRI_PLACES=217, PETRI_TRANSITIONS=891} [2023-08-30 11:14:32,849 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 148 predicate places. [2023-08-30 11:14:32,849 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 891 transitions, 20807 flow [2023-08-30 11:14:32,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:14:32,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:14:32,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:14:32,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-30 11:14:32,850 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:14:32,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:14:32,850 INFO L85 PathProgramCache]: Analyzing trace with hash 6756181, now seen corresponding path program 3 times [2023-08-30 11:14:32,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:14:32,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541050514] [2023-08-30 11:14:32,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:14:32,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:14:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:14:33,011 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-30 11:14:33,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:14:33,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541050514] [2023-08-30 11:14:33,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541050514] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:14:33,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:14:33,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 11:14:33,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671556523] [2023-08-30 11:14:33,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:14:33,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 11:14:33,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:14:33,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 11:14:33,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 11:14:33,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-30 11:14:33,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 891 transitions, 20807 flow. Second operand has 8 states, 8 states have (on average 117.625) internal successors, (941), 8 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:14:33,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:14:33,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-30 11:14:33,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:14:53,571 INFO L130 PetriNetUnfolder]: 61550/97617 cut-off events. [2023-08-30 11:14:53,571 INFO L131 PetriNetUnfolder]: For 1533633/1540954 co-relation queries the response was YES. [2023-08-30 11:14:54,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545043 conditions, 97617 events. 61550/97617 cut-off events. For 1533633/1540954 co-relation queries the response was YES. Maximal size of possible extension queue 3167. Compared 843401 event pairs, 23692 based on Foata normal form. 3444/97077 useless extension candidates. Maximal degree in co-relation 544943. Up to 88322 conditions per place. [2023-08-30 11:14:54,795 INFO L137 encePairwiseOnDemand]: 257/266 looper letters, 909 selfloop transitions, 63 changer transitions 0/1014 dead transitions. [2023-08-30 11:14:54,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 1014 transitions, 24605 flow [2023-08-30 11:14:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 11:14:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 11:14:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 939 transitions. [2023-08-30 11:14:54,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042964554242749 [2023-08-30 11:14:54,797 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 939 transitions. [2023-08-30 11:14:54,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 939 transitions. [2023-08-30 11:14:54,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:14:54,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 939 transitions. [2023-08-30 11:14:54,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:14:54,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:14:54,799 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:14:54,799 INFO L175 Difference]: Start difference. First operand has 217 places, 891 transitions, 20807 flow. Second operand 7 states and 939 transitions. [2023-08-30 11:14:54,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 1014 transitions, 24605 flow [2023-08-30 11:15:03,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 1014 transitions, 24379 flow, removed 69 selfloop flow, removed 1 redundant places. [2023-08-30 11:15:03,746 INFO L231 Difference]: Finished difference. Result has 227 places, 935 transitions, 22192 flow [2023-08-30 11:15:03,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=20589, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=829, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=22192, PETRI_PLACES=227, PETRI_TRANSITIONS=935} [2023-08-30 11:15:03,746 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 158 predicate places. [2023-08-30 11:15:03,746 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 935 transitions, 22192 flow [2023-08-30 11:15:03,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.625) internal successors, (941), 8 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:15:03,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:15:03,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:15:03,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-30 11:15:03,747 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:15:03,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:15:03,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1733461479, now seen corresponding path program 4 times [2023-08-30 11:15:03,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:15:03,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654708168] [2023-08-30 11:15:03,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:15:03,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:15:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:15:03,976 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-30 11:15:03,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:15:03,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654708168] [2023-08-30 11:15:03,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654708168] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:15:03,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:15:03,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 11:15:03,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088844983] [2023-08-30 11:15:03,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:15:03,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 11:15:03,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:15:03,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 11:15:03,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-08-30 11:15:04,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-30 11:15:04,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 935 transitions, 22192 flow. Second operand has 9 states, 9 states have (on average 117.44444444444444) internal successors, (1057), 9 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:15:04,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:15:04,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-30 11:15:04,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:15:30,360 INFO L130 PetriNetUnfolder]: 76359/120422 cut-off events. [2023-08-30 11:15:30,361 INFO L131 PetriNetUnfolder]: For 1698351/1705913 co-relation queries the response was YES. [2023-08-30 11:15:31,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643656 conditions, 120422 events. 76359/120422 cut-off events. For 1698351/1705913 co-relation queries the response was YES. Maximal size of possible extension queue 3930. Compared 1055977 event pairs, 15906 based on Foata normal form. 4035/119258 useless extension candidates. Maximal degree in co-relation 643550. Up to 74053 conditions per place. [2023-08-30 11:15:31,994 INFO L137 encePairwiseOnDemand]: 252/266 looper letters, 714 selfloop transitions, 379 changer transitions 0/1162 dead transitions. [2023-08-30 11:15:31,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 1162 transitions, 27543 flow [2023-08-30 11:15:31,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 11:15:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 11:15:31,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 975 transitions. [2023-08-30 11:15:31,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5236305048335124 [2023-08-30 11:15:31,996 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 975 transitions. [2023-08-30 11:15:31,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 975 transitions. [2023-08-30 11:15:31,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:15:31,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 975 transitions. [2023-08-30 11:15:31,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.28571428571428) internal successors, (975), 7 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:15:31,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:15:31,999 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:15:31,999 INFO L175 Difference]: Start difference. First operand has 227 places, 935 transitions, 22192 flow. Second operand 7 states and 975 transitions. [2023-08-30 11:15:31,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 1162 transitions, 27543 flow [2023-08-30 11:15:44,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 1162 transitions, 27537 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-30 11:15:44,162 INFO L231 Difference]: Finished difference. Result has 236 places, 1000 transitions, 25060 flow [2023-08-30 11:15:44,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=22130, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=933, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=316, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=25060, PETRI_PLACES=236, PETRI_TRANSITIONS=1000} [2023-08-30 11:15:44,163 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 167 predicate places. [2023-08-30 11:15:44,163 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 1000 transitions, 25060 flow [2023-08-30 11:15:44,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 117.44444444444444) internal successors, (1057), 9 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:15:44,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:15:44,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:15:44,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-30 11:15:44,164 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:15:44,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:15:44,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1506922770, now seen corresponding path program 4 times [2023-08-30 11:15:44,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:15:44,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676742406] [2023-08-30 11:15:44,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:15:44,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:15:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:15:44,390 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-30 11:15:44,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:15:44,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676742406] [2023-08-30 11:15:44,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676742406] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:15:44,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:15:44,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 11:15:44,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453462676] [2023-08-30 11:15:44,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:15:44,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 11:15:44,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:15:44,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 11:15:44,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-08-30 11:15:44,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-30 11:15:44,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 1000 transitions, 25060 flow. Second operand has 9 states, 9 states have (on average 116.44444444444444) internal successors, (1048), 9 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:15:44,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:15:44,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-30 11:15:44,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:16:15,158 INFO L130 PetriNetUnfolder]: 80945/127478 cut-off events. [2023-08-30 11:16:15,158 INFO L131 PetriNetUnfolder]: For 1989212/1993766 co-relation queries the response was YES. [2023-08-30 11:16:16,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712868 conditions, 127478 events. 80945/127478 cut-off events. For 1989212/1993766 co-relation queries the response was YES. Maximal size of possible extension queue 4144. Compared 1119614 event pairs, 21302 based on Foata normal form. 2278/124594 useless extension candidates. Maximal degree in co-relation 712757. Up to 99337 conditions per place. [2023-08-30 11:16:16,981 INFO L137 encePairwiseOnDemand]: 255/266 looper letters, 751 selfloop transitions, 421 changer transitions 0/1206 dead transitions. [2023-08-30 11:16:16,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 1206 transitions, 29905 flow [2023-08-30 11:16:16,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 11:16:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 11:16:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1220 transitions. [2023-08-30 11:16:16,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096073517126148 [2023-08-30 11:16:16,983 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1220 transitions. [2023-08-30 11:16:16,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1220 transitions. [2023-08-30 11:16:16,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:16:16,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1220 transitions. [2023-08-30 11:16:16,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 135.55555555555554) internal successors, (1220), 9 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:16:16,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:16:16,986 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:16:16,986 INFO L175 Difference]: Start difference. First operand has 236 places, 1000 transitions, 25060 flow. Second operand 9 states and 1220 transitions. [2023-08-30 11:16:16,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 1206 transitions, 29905 flow [2023-08-30 11:16:31,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 1206 transitions, 29578 flow, removed 75 selfloop flow, removed 2 redundant places. [2023-08-30 11:16:31,755 INFO L231 Difference]: Finished difference. Result has 246 places, 1056 transitions, 27422 flow [2023-08-30 11:16:31,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=24737, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=367, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=27422, PETRI_PLACES=246, PETRI_TRANSITIONS=1056} [2023-08-30 11:16:31,755 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 177 predicate places. [2023-08-30 11:16:31,756 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 1056 transitions, 27422 flow [2023-08-30 11:16:31,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.44444444444444) internal successors, (1048), 9 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:16:31,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:16:31,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:16:31,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-30 11:16:31,756 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:16:31,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:16:31,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1017706741, now seen corresponding path program 5 times [2023-08-30 11:16:31,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:16:31,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195400240] [2023-08-30 11:16:31,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:16:31,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:16:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:16:31,921 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-30 11:16:31,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:16:31,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195400240] [2023-08-30 11:16:31,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195400240] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:16:31,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:16:31,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 11:16:31,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837068835] [2023-08-30 11:16:31,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:16:31,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 11:16:31,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:16:31,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 11:16:31,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 11:16:31,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 266 [2023-08-30 11:16:31,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 1056 transitions, 27422 flow. Second operand has 7 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:16:31,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:16:31,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 266 [2023-08-30 11:16:31,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:17:02,443 INFO L130 PetriNetUnfolder]: 77678/123471 cut-off events. [2023-08-30 11:17:02,443 INFO L131 PetriNetUnfolder]: For 2049339/2064905 co-relation queries the response was YES. [2023-08-30 11:17:03,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674680 conditions, 123471 events. 77678/123471 cut-off events. For 2049339/2064905 co-relation queries the response was YES. Maximal size of possible extension queue 4132. Compared 1101600 event pairs, 19505 based on Foata normal form. 7367/125177 useless extension candidates. Maximal degree in co-relation 674564. Up to 86043 conditions per place. [2023-08-30 11:17:04,344 INFO L137 encePairwiseOnDemand]: 253/266 looper letters, 615 selfloop transitions, 360 changer transitions 0/1159 dead transitions. [2023-08-30 11:17:04,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 1159 transitions, 29707 flow [2023-08-30 11:17:04,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 11:17:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 11:17:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 973 transitions. [2023-08-30 11:17:04,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225563909774437 [2023-08-30 11:17:04,345 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 973 transitions. [2023-08-30 11:17:04,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 973 transitions. [2023-08-30 11:17:04,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:17:04,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 973 transitions. [2023-08-30 11:17:04,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.0) internal successors, (973), 7 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:17:04,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:17:04,347 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:17:04,347 INFO L175 Difference]: Start difference. First operand has 246 places, 1056 transitions, 27422 flow. Second operand 7 states and 973 transitions. [2023-08-30 11:17:04,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 1159 transitions, 29707 flow [2023-08-30 11:17:17,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 1159 transitions, 29315 flow, removed 43 selfloop flow, removed 4 redundant places. [2023-08-30 11:17:17,173 INFO L231 Difference]: Finished difference. Result has 248 places, 1023 transitions, 27243 flow [2023-08-30 11:17:17,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=25644, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1003, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=340, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=27243, PETRI_PLACES=248, PETRI_TRANSITIONS=1023} [2023-08-30 11:17:17,174 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 179 predicate places. [2023-08-30 11:17:17,174 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 1023 transitions, 27243 flow [2023-08-30 11:17:17,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:17:17,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:17:17,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:17:17,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-30 11:17:17,175 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:17:17,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:17:17,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2139520496, now seen corresponding path program 5 times [2023-08-30 11:17:17,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:17:17,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562550451] [2023-08-30 11:17:17,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:17:17,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:17:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:17:17,330 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-30 11:17:17,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:17:17,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562550451] [2023-08-30 11:17:17,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562550451] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:17:17,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:17:17,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 11:17:17,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073356034] [2023-08-30 11:17:17,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:17:17,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 11:17:17,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:17:17,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 11:17:17,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 11:17:17,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-30 11:17:17,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 1023 transitions, 27243 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:17:17,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:17:17,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-30 11:17:17,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:17:49,324 INFO L130 PetriNetUnfolder]: 83538/132122 cut-off events. [2023-08-30 11:17:49,324 INFO L131 PetriNetUnfolder]: For 2175181/2184057 co-relation queries the response was YES. [2023-08-30 11:17:50,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743585 conditions, 132122 events. 83538/132122 cut-off events. For 2175181/2184057 co-relation queries the response was YES. Maximal size of possible extension queue 4321. Compared 1175142 event pairs, 22365 based on Foata normal form. 4618/131132 useless extension candidates. Maximal degree in co-relation 743468. Up to 107734 conditions per place. [2023-08-30 11:17:51,169 INFO L137 encePairwiseOnDemand]: 254/266 looper letters, 618 selfloop transitions, 413 changer transitions 0/1190 dead transitions. [2023-08-30 11:17:51,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 1190 transitions, 31365 flow [2023-08-30 11:17:51,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 11:17:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 11:17:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1211 transitions. [2023-08-30 11:17:51,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5058479532163743 [2023-08-30 11:17:51,171 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1211 transitions. [2023-08-30 11:17:51,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1211 transitions. [2023-08-30 11:17:51,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:17:51,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1211 transitions. [2023-08-30 11:17:51,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.55555555555554) internal successors, (1211), 9 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:17:51,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:17:51,174 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:17:51,174 INFO L175 Difference]: Start difference. First operand has 248 places, 1023 transitions, 27243 flow. Second operand 9 states and 1211 transitions. [2023-08-30 11:17:51,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 1190 transitions, 31365 flow [2023-08-30 11:18:05,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 1190 transitions, 30872 flow, removed 49 selfloop flow, removed 4 redundant places. [2023-08-30 11:18:05,284 INFO L231 Difference]: Finished difference. Result has 256 places, 1081 transitions, 29468 flow [2023-08-30 11:18:05,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=26783, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1023, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=359, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=29468, PETRI_PLACES=256, PETRI_TRANSITIONS=1081} [2023-08-30 11:18:05,285 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 187 predicate places. [2023-08-30 11:18:05,285 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 1081 transitions, 29468 flow [2023-08-30 11:18:05,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:18:05,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:18:05,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:18:05,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-30 11:18:05,285 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:18:05,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:18:05,286 INFO L85 PathProgramCache]: Analyzing trace with hash -401478335, now seen corresponding path program 1 times [2023-08-30 11:18:05,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:18:05,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831518588] [2023-08-30 11:18:05,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:18:05,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:18:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:18:05,471 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-30 11:18:05,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:18:05,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831518588] [2023-08-30 11:18:05,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831518588] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:18:05,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:18:05,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 11:18:05,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473268935] [2023-08-30 11:18:05,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:18:05,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 11:18:05,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:18:05,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 11:18:05,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 11:18:05,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-30 11:18:05,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 1081 transitions, 29468 flow. Second operand has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:18:05,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:18:05,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-30 11:18:05,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:18:50,218 INFO L130 PetriNetUnfolder]: 110695/173979 cut-off events. [2023-08-30 11:18:50,218 INFO L131 PetriNetUnfolder]: For 2648648/2648653 co-relation queries the response was YES. [2023-08-30 11:18:52,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972877 conditions, 173979 events. 110695/173979 cut-off events. For 2648648/2648653 co-relation queries the response was YES. Maximal size of possible extension queue 5613. Compared 1582118 event pairs, 28907 based on Foata normal form. 288/167009 useless extension candidates. Maximal degree in co-relation 972756. Up to 85964 conditions per place. [2023-08-30 11:18:52,822 INFO L137 encePairwiseOnDemand]: 253/266 looper letters, 857 selfloop transitions, 535 changer transitions 0/1401 dead transitions. [2023-08-30 11:18:52,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 1401 transitions, 37682 flow [2023-08-30 11:18:52,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 11:18:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 11:18:52,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1351 transitions. [2023-08-30 11:18:52,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5078947368421053 [2023-08-30 11:18:52,824 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1351 transitions. [2023-08-30 11:18:52,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1351 transitions. [2023-08-30 11:18:52,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:18:52,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1351 transitions. [2023-08-30 11:18:52,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 135.1) internal successors, (1351), 10 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:18:52,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 266.0) internal successors, (2926), 11 states have internal predecessors, (2926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:18:52,966 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 266.0) internal successors, (2926), 11 states have internal predecessors, (2926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:18:52,966 INFO L175 Difference]: Start difference. First operand has 256 places, 1081 transitions, 29468 flow. Second operand 10 states and 1351 transitions. [2023-08-30 11:18:52,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 1401 transitions, 37682 flow [2023-08-30 11:19:16,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 1401 transitions, 37223 flow, removed 154 selfloop flow, removed 2 redundant places. [2023-08-30 11:19:16,970 INFO L231 Difference]: Finished difference. Result has 266 places, 1148 transitions, 32481 flow [2023-08-30 11:19:16,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=29071, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1081, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=476, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=32481, PETRI_PLACES=266, PETRI_TRANSITIONS=1148} [2023-08-30 11:19:16,971 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 197 predicate places. [2023-08-30 11:19:16,971 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 1148 transitions, 32481 flow [2023-08-30 11:19:16,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.75) internal successors, (926), 8 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:19:16,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:19:16,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:19:16,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-30 11:19:16,972 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:19:16,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:19:16,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1542062712, now seen corresponding path program 6 times [2023-08-30 11:19:16,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:19:16,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156803283] [2023-08-30 11:19:16,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:19:16,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:19:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:19:17,160 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-30 11:19:17,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:19:17,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156803283] [2023-08-30 11:19:17,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156803283] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:19:17,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:19:17,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 11:19:17,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130868458] [2023-08-30 11:19:17,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:19:17,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 11:19:17,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:19:17,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 11:19:17,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-08-30 11:19:17,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-30 11:19:17,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 1148 transitions, 32481 flow. Second operand has 9 states, 9 states have (on average 115.55555555555556) internal successors, (1040), 9 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:19:17,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:19:17,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-30 11:19:17,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:20:11,513 INFO L130 PetriNetUnfolder]: 122973/193203 cut-off events. [2023-08-30 11:20:11,513 INFO L131 PetriNetUnfolder]: For 3220669/3220674 co-relation queries the response was YES. [2023-08-30 11:20:13,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1119173 conditions, 193203 events. 122973/193203 cut-off events. For 3220669/3220674 co-relation queries the response was YES. Maximal size of possible extension queue 6315. Compared 1779048 event pairs, 33407 based on Foata normal form. 192/185411 useless extension candidates. Maximal degree in co-relation 1119048. Up to 149947 conditions per place. [2023-08-30 11:20:14,676 INFO L137 encePairwiseOnDemand]: 253/266 looper letters, 1105 selfloop transitions, 396 changer transitions 0/1510 dead transitions. [2023-08-30 11:20:14,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 1510 transitions, 42883 flow [2023-08-30 11:20:14,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 11:20:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 11:20:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1200 transitions. [2023-08-30 11:20:14,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012531328320802 [2023-08-30 11:20:14,678 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1200 transitions. [2023-08-30 11:20:14,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1200 transitions. [2023-08-30 11:20:14,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:20:14,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1200 transitions. [2023-08-30 11:20:14,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 133.33333333333334) internal successors, (1200), 9 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:20:14,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:20:14,683 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:20:14,683 INFO L175 Difference]: Start difference. First operand has 266 places, 1148 transitions, 32481 flow. Second operand 9 states and 1200 transitions. [2023-08-30 11:20:14,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 1510 transitions, 42883 flow [2023-08-30 11:20:45,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 1510 transitions, 42489 flow, removed 174 selfloop flow, removed 1 redundant places. [2023-08-30 11:20:45,978 INFO L231 Difference]: Finished difference. Result has 280 places, 1312 transitions, 38381 flow [2023-08-30 11:20:45,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=32167, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=253, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=811, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=38381, PETRI_PLACES=280, PETRI_TRANSITIONS=1312} [2023-08-30 11:20:45,979 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 211 predicate places. [2023-08-30 11:20:45,979 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 1312 transitions, 38381 flow [2023-08-30 11:20:45,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.55555555555556) internal successors, (1040), 9 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:20:45,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:20:45,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:20:45,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-08-30 11:20:45,980 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:20:45,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:20:45,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1097731563, now seen corresponding path program 2 times [2023-08-30 11:20:45,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:20:45,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494940974] [2023-08-30 11:20:45,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:20:45,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:20:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:20:46,107 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-30 11:20:46,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:20:46,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494940974] [2023-08-30 11:20:46,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494940974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:20:46,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:20:46,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 11:20:46,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972496101] [2023-08-30 11:20:46,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:20:46,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 11:20:46,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:20:46,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 11:20:46,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 11:20:46,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 266 [2023-08-30 11:20:46,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 1312 transitions, 38381 flow. Second operand has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:20:46,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:20:46,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 266 [2023-08-30 11:20:46,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 11:21:52,636 INFO L130 PetriNetUnfolder]: 132415/209576 cut-off events. [2023-08-30 11:21:52,636 INFO L131 PetriNetUnfolder]: For 3617523/3628376 co-relation queries the response was YES. [2023-08-30 11:21:55,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1212888 conditions, 209576 events. 132415/209576 cut-off events. For 3617523/3628376 co-relation queries the response was YES. Maximal size of possible extension queue 7042. Compared 1976759 event pairs, 34306 based on Foata normal form. 9080/209299 useless extension candidates. Maximal degree in co-relation 1212754. Up to 160878 conditions per place. [2023-08-30 11:21:56,284 INFO L137 encePairwiseOnDemand]: 254/266 looper letters, 1075 selfloop transitions, 450 changer transitions 0/1614 dead transitions. [2023-08-30 11:21:56,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 1614 transitions, 47244 flow [2023-08-30 11:21:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 11:21:56,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 11:21:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 850 transitions. [2023-08-30 11:21:56,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5325814536340853 [2023-08-30 11:21:56,285 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 850 transitions. [2023-08-30 11:21:56,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 850 transitions. [2023-08-30 11:21:56,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 11:21:56,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 850 transitions. [2023-08-30 11:21:56,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.66666666666666) internal successors, (850), 6 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:21:56,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:21:56,287 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:21:56,287 INFO L175 Difference]: Start difference. First operand has 280 places, 1312 transitions, 38381 flow. Second operand 6 states and 850 transitions. [2023-08-30 11:21:56,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 1614 transitions, 47244 flow [2023-08-30 11:22:33,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 1614 transitions, 46880 flow, removed 182 selfloop flow, removed 0 redundant places. [2023-08-30 11:22:33,438 INFO L231 Difference]: Finished difference. Result has 289 places, 1415 transitions, 42457 flow [2023-08-30 11:22:33,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=38073, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=351, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=875, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=42457, PETRI_PLACES=289, PETRI_TRANSITIONS=1415} [2023-08-30 11:22:33,439 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 220 predicate places. [2023-08-30 11:22:33,439 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 1415 transitions, 42457 flow [2023-08-30 11:22:33,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:22:33,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 11:22:33,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 11:22:33,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-30 11:22:33,440 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-08-30 11:22:33,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 11:22:33,440 INFO L85 PathProgramCache]: Analyzing trace with hash 591251401, now seen corresponding path program 3 times [2023-08-30 11:22:33,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 11:22:33,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551801208] [2023-08-30 11:22:33,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 11:22:33,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 11:22:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 11:22:33,646 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-30 11:22:33,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 11:22:33,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551801208] [2023-08-30 11:22:33,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551801208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 11:22:33,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 11:22:33,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 11:22:33,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915769273] [2023-08-30 11:22:33,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 11:22:33,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 11:22:33,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 11:22:33,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 11:22:33,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 11:22:33,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 266 [2023-08-30 11:22:33,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 1415 transitions, 42457 flow. Second operand has 7 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 11:22:33,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 11:22:33,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 266 [2023-08-30 11:22:33,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15