./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/popl20-more-buffer-series.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 675e4a71573eb5ca191c78078c954ea41743d39a46f0fa586376ee48e7dc4190 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 13:45:02,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 13:45:02,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 13:45:02,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 13:45:02,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 13:45:02,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 13:45:02,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 13:45:02,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 13:45:02,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 13:45:02,549 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 13:45:02,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 13:45:02,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 13:45:02,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 13:45:02,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 13:45:02,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 13:45:02,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 13:45:02,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 13:45:02,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 13:45:02,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 13:45:02,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 13:45:02,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 13:45:02,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 13:45:02,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 13:45:02,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 13:45:02,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 13:45:02,588 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 13:45:02,588 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 13:45:02,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 13:45:02,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 13:45:02,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 13:45:02,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 13:45:02,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 13:45:02,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 13:45:02,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 13:45:02,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 13:45:02,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 13:45:02,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 13:45:02,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 13:45:02,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 13:45:02,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 13:45:02,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 13:45:02,600 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 13:45:02,635 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 13:45:02,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 13:45:02,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 13:45:02,636 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 13:45:02,637 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 13:45:02,637 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 13:45:02,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 13:45:02,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 13:45:02,638 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 13:45:02,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 13:45:02,639 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 13:45:02,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 13:45:02,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 13:45:02,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 13:45:02,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 13:45:02,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 13:45:02,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 13:45:02,641 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 13:45:02,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 13:45:02,641 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 13:45:02,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 13:45:02,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 13:45:02,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 13:45:02,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 13:45:02,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 13:45:02,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 13:45:02,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 13:45:02,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 13:45:02,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 13:45:02,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 13:45:02,643 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 13:45:02,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 13:45:02,644 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 13:45:02,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 13:45:02,644 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 13:45:02,644 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 ! call(reach_error())) ) 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 -> 675e4a71573eb5ca191c78078c954ea41743d39a46f0fa586376ee48e7dc4190 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 -> BEFORE [2023-09-01 13:45:02,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 13:45:02,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 13:45:02,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 13:45:02,990 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 13:45:02,990 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 13:45:02,992 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c [2023-09-01 13:45:04,142 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 13:45:04,330 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 13:45:04,330 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series.wvr.c [2023-09-01 13:45:04,337 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cecea6a4/99a0152a84cd4184b17045273d69b4ff/FLAGa46707070 [2023-09-01 13:45:04,349 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cecea6a4/99a0152a84cd4184b17045273d69b4ff [2023-09-01 13:45:04,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 13:45:04,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 13:45:04,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 13:45:04,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 13:45:04,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 13:45:04,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:45:04" (1/1) ... [2023-09-01 13:45:04,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76713653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:45:04, skipping insertion in model container [2023-09-01 13:45:04,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:45:04" (1/1) ... [2023-09-01 13:45:04,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 13:45:04,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 13:45:04,594 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/popl20-more-buffer-series.wvr.c[4351,4364] [2023-09-01 13:45:04,608 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 13:45:04,618 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 13:45:04,653 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/popl20-more-buffer-series.wvr.c[4351,4364] [2023-09-01 13:45:04,657 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 13:45:04,666 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 13:45:04,672 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 13:45:04,678 INFO L208 MainTranslator]: Completed translation [2023-09-01 13:45:04,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:45:04 WrapperNode [2023-09-01 13:45:04,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 13:45:04,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 13:45:04,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 13:45:04,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 13:45:04,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:45:04" (1/1) ... [2023-09-01 13:45:04,705 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:45:04" (1/1) ... [2023-09-01 13:45:04,741 INFO L138 Inliner]: procedures = 27, calls = 87, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 358 [2023-09-01 13:45:04,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 13:45:04,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 13:45:04,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 13:45:04,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 13:45:04,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:45:04" (1/1) ... [2023-09-01 13:45:04,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:45:04" (1/1) ... [2023-09-01 13:45:04,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:45:04" (1/1) ... [2023-09-01 13:45:04,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:45:04" (1/1) ... [2023-09-01 13:45:04,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:45:04" (1/1) ... [2023-09-01 13:45:04,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:45:04" (1/1) ... [2023-09-01 13:45:04,795 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:45:04" (1/1) ... [2023-09-01 13:45:04,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:45:04" (1/1) ... [2023-09-01 13:45:04,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 13:45:04,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 13:45:04,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 13:45:04,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 13:45:04,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:45:04" (1/1) ... [2023-09-01 13:45:04,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 13:45:04,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:45:04,833 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-09-01 13:45:04,861 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-09-01 13:45:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 13:45:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 13:45:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 13:45:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 13:45:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 13:45:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 13:45:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 13:45:04,895 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 13:45:04,895 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 13:45:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 13:45:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-09-01 13:45:04,896 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-09-01 13:45:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 13:45:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 13:45:04,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 13:45:04,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-01 13:45:04,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 13:45:04,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 13:45:04,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 13:45:04,899 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 13:45:05,028 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 13:45:05,043 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 13:45:05,497 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 13:45:05,676 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 13:45:05,677 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-09-01 13:45:05,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:45:05 BoogieIcfgContainer [2023-09-01 13:45:05,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 13:45:05,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 13:45:05,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 13:45:05,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 13:45:05,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 01:45:04" (1/3) ... [2023-09-01 13:45:05,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7d0375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:45:05, skipping insertion in model container [2023-09-01 13:45:05,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:45:04" (2/3) ... [2023-09-01 13:45:05,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7d0375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:45:05, skipping insertion in model container [2023-09-01 13:45:05,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:45:05" (3/3) ... [2023-09-01 13:45:05,686 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series.wvr.c [2023-09-01 13:45:05,692 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 13:45:05,700 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 13:45:05,701 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 13:45:05,701 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 13:45:05,793 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-09-01 13:45:05,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 253 transitions, 538 flow [2023-09-01 13:45:05,938 INFO L130 PetriNetUnfolder]: 22/249 cut-off events. [2023-09-01 13:45:05,938 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 13:45:05,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 249 events. 22/249 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 140 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 212. Up to 2 conditions per place. [2023-09-01 13:45:05,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 253 transitions, 538 flow [2023-09-01 13:45:05,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 237 transitions, 498 flow [2023-09-01 13:45:05,957 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 13:45:05,966 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 237 transitions, 498 flow [2023-09-01 13:45:05,968 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 237 transitions, 498 flow [2023-09-01 13:45:05,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 237 transitions, 498 flow [2023-09-01 13:45:06,031 INFO L130 PetriNetUnfolder]: 22/237 cut-off events. [2023-09-01 13:45:06,032 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 13:45:06,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 237 events. 22/237 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 139 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 212. Up to 2 conditions per place. [2023-09-01 13:45:06,037 INFO L119 LiptonReduction]: Number of co-enabled transitions 2000 [2023-09-01 13:45:14,405 INFO L134 LiptonReduction]: Checked pairs total: 4059 [2023-09-01 13:45:14,406 INFO L136 LiptonReduction]: Total number of compositions: 236 [2023-09-01 13:45:14,418 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 13:45:14,423 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;@66c6ec1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 13:45:14,424 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-01 13:45:14,433 INFO L130 PetriNetUnfolder]: 7/38 cut-off events. [2023-09-01 13:45:14,433 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 13:45:14,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:45:14,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:45:14,434 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:45:14,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:45:14,439 INFO L85 PathProgramCache]: Analyzing trace with hash -823670804, now seen corresponding path program 1 times [2023-09-01 13:45:14,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:45:14,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870975985] [2023-09-01 13:45:14,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:14,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:45:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:15,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:45:15,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:45:15,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870975985] [2023-09-01 13:45:15,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870975985] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:45:15,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:45:15,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 13:45:15,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293604473] [2023-09-01 13:45:15,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:45:15,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 13:45:15,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:45:15,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 13:45:15,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 13:45:15,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 489 [2023-09-01 13:45:15,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:15,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:45:15,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 489 [2023-09-01 13:45:15,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:45:15,678 INFO L130 PetriNetUnfolder]: 2607/3584 cut-off events. [2023-09-01 13:45:15,679 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2023-09-01 13:45:15,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7119 conditions, 3584 events. 2607/3584 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 16023 event pairs, 498 based on Foata normal form. 1/2296 useless extension candidates. Maximal degree in co-relation 5886. Up to 2275 conditions per place. [2023-09-01 13:45:15,699 INFO L137 encePairwiseOnDemand]: 485/489 looper letters, 49 selfloop transitions, 3 changer transitions 1/59 dead transitions. [2023-09-01 13:45:15,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 263 flow [2023-09-01 13:45:15,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 13:45:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 13:45:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2023-09-01 13:45:15,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49079754601226994 [2023-09-01 13:45:15,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 720 transitions. [2023-09-01 13:45:15,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 720 transitions. [2023-09-01 13:45:15,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:45:15,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 720 transitions. [2023-09-01 13:45:15,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.0) internal successors, (720), 3 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-09-01 13:45:15,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:15,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:15,744 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 102 flow. Second operand 3 states and 720 transitions. [2023-09-01 13:45:15,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 263 flow [2023-09-01 13:45:15,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 59 transitions, 237 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-09-01 13:45:15,756 INFO L231 Difference]: Finished difference. Result has 40 places, 41 transitions, 105 flow [2023-09-01 13:45:15,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=40, PETRI_TRANSITIONS=41} [2023-09-01 13:45:15,764 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2023-09-01 13:45:15,767 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 41 transitions, 105 flow [2023-09-01 13:45:15,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:15,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:45:15,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:45:15,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 13:45:15,769 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:45:15,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:45:15,778 INFO L85 PathProgramCache]: Analyzing trace with hash 723466093, now seen corresponding path program 1 times [2023-09-01 13:45:15,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:45:15,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541234406] [2023-09-01 13:45:15,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:15,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:45:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:45:15,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:45:15,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541234406] [2023-09-01 13:45:15,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541234406] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:45:15,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:45:15,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 13:45:15,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555068885] [2023-09-01 13:45:15,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:45:15,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 13:45:15,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:45:15,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 13:45:15,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 13:45:15,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 489 [2023-09-01 13:45:15,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 41 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:15,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:45:15,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 489 [2023-09-01 13:45:15,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:45:16,378 INFO L130 PetriNetUnfolder]: 2710/3667 cut-off events. [2023-09-01 13:45:16,378 INFO L131 PetriNetUnfolder]: For 718/718 co-relation queries the response was YES. [2023-09-01 13:45:16,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8148 conditions, 3667 events. 2710/3667 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 16521 event pairs, 624 based on Foata normal form. 118/3118 useless extension candidates. Maximal degree in co-relation 2697. Up to 2597 conditions per place. [2023-09-01 13:45:16,399 INFO L137 encePairwiseOnDemand]: 486/489 looper letters, 57 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-09-01 13:45:16,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 285 flow [2023-09-01 13:45:16,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 13:45:16,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 13:45:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2023-09-01 13:45:16,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4867075664621677 [2023-09-01 13:45:16,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 714 transitions. [2023-09-01 13:45:16,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 714 transitions. [2023-09-01 13:45:16,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:45:16,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 714 transitions. [2023-09-01 13:45:16,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 238.0) internal successors, (714), 3 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-09-01 13:45:16,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:16,408 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:16,408 INFO L175 Difference]: Start difference. First operand has 40 places, 41 transitions, 105 flow. Second operand 3 states and 714 transitions. [2023-09-01 13:45:16,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 285 flow [2023-09-01 13:45:16,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 13:45:16,412 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 116 flow [2023-09-01 13:45:16,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2023-09-01 13:45:16,413 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2023-09-01 13:45:16,413 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 116 flow [2023-09-01 13:45:16,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:16,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:45:16,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:45:16,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 13:45:16,414 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:45:16,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:45:16,417 INFO L85 PathProgramCache]: Analyzing trace with hash -213191495, now seen corresponding path program 1 times [2023-09-01 13:45:16,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:45:16,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764862173] [2023-09-01 13:45:16,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:16,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:45:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:45:16,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:45:16,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764862173] [2023-09-01 13:45:16,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764862173] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:45:16,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:45:16,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 13:45:16,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660673983] [2023-09-01 13:45:16,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:45:16,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 13:45:16,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:45:16,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 13:45:16,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 13:45:16,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 489 [2023-09-01 13:45:16,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:16,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:45:16,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 489 [2023-09-01 13:45:16,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:45:16,977 INFO L130 PetriNetUnfolder]: 2668/3764 cut-off events. [2023-09-01 13:45:16,977 INFO L131 PetriNetUnfolder]: For 1536/1536 co-relation queries the response was YES. [2023-09-01 13:45:16,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8737 conditions, 3764 events. 2668/3764 cut-off events. For 1536/1536 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 18375 event pairs, 655 based on Foata normal form. 74/3473 useless extension candidates. Maximal degree in co-relation 6349. Up to 2665 conditions per place. [2023-09-01 13:45:16,998 INFO L137 encePairwiseOnDemand]: 486/489 looper letters, 57 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-09-01 13:45:16,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 301 flow [2023-09-01 13:45:16,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 13:45:16,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 13:45:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2023-09-01 13:45:17,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48534423994546694 [2023-09-01 13:45:17,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 712 transitions. [2023-09-01 13:45:17,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 712 transitions. [2023-09-01 13:45:17,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:45:17,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 712 transitions. [2023-09-01 13:45:17,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:17,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:17,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:17,008 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 116 flow. Second operand 3 states and 712 transitions. [2023-09-01 13:45:17,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 301 flow [2023-09-01 13:45:17,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 65 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 13:45:17,010 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 128 flow [2023-09-01 13:45:17,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2023-09-01 13:45:17,011 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2023-09-01 13:45:17,011 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 128 flow [2023-09-01 13:45:17,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:17,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:45:17,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:45:17,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 13:45:17,013 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:45:17,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:45:17,013 INFO L85 PathProgramCache]: Analyzing trace with hash -326780758, now seen corresponding path program 1 times [2023-09-01 13:45:17,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:45:17,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834612037] [2023-09-01 13:45:17,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:17,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:45:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:45:17,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:45:17,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834612037] [2023-09-01 13:45:17,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834612037] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:45:17,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:45:17,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 13:45:17,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536674861] [2023-09-01 13:45:17,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:45:17,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 13:45:17,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:45:17,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 13:45:17,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 13:45:17,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 489 [2023-09-01 13:45:17,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 215.75) internal successors, (863), 4 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:17,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:45:17,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 489 [2023-09-01 13:45:17,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:45:17,793 INFO L130 PetriNetUnfolder]: 3191/4597 cut-off events. [2023-09-01 13:45:17,793 INFO L131 PetriNetUnfolder]: For 2513/2513 co-relation queries the response was YES. [2023-09-01 13:45:17,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11225 conditions, 4597 events. 3191/4597 cut-off events. For 2513/2513 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 24355 event pairs, 2374 based on Foata normal form. 95/4561 useless extension candidates. Maximal degree in co-relation 5018. Up to 3497 conditions per place. [2023-09-01 13:45:17,820 INFO L137 encePairwiseOnDemand]: 485/489 looper letters, 65 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-09-01 13:45:17,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 74 transitions, 349 flow [2023-09-01 13:45:17,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 13:45:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 13:45:17,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 899 transitions. [2023-09-01 13:45:17,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4596114519427403 [2023-09-01 13:45:17,825 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 899 transitions. [2023-09-01 13:45:17,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 899 transitions. [2023-09-01 13:45:17,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:45:17,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 899 transitions. [2023-09-01 13:45:17,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 224.75) internal successors, (899), 4 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:17,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 489.0) internal successors, (2445), 5 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:17,832 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 489.0) internal successors, (2445), 5 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:17,832 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 128 flow. Second operand 4 states and 899 transitions. [2023-09-01 13:45:17,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 74 transitions, 349 flow [2023-09-01 13:45:17,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 74 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 13:45:17,836 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 146 flow [2023-09-01 13:45:17,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2023-09-01 13:45:17,838 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-09-01 13:45:17,838 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 146 flow [2023-09-01 13:45:17,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 215.75) internal successors, (863), 4 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:17,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:45:17,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:45:17,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 13:45:17,839 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:45:17,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:45:17,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1525607470, now seen corresponding path program 1 times [2023-09-01 13:45:17,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:45:17,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130410203] [2023-09-01 13:45:17,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:17,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:45:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:45:18,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:45:18,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130410203] [2023-09-01 13:45:18,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130410203] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:45:18,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:45:18,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 13:45:18,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114600557] [2023-09-01 13:45:18,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:45:18,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 13:45:18,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:45:18,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 13:45:18,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 13:45:18,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 489 [2023-09-01 13:45:18,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 215.75) internal successors, (863), 4 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:18,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:45:18,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 489 [2023-09-01 13:45:18,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:45:18,697 INFO L130 PetriNetUnfolder]: 3933/5811 cut-off events. [2023-09-01 13:45:18,698 INFO L131 PetriNetUnfolder]: For 3196/3196 co-relation queries the response was YES. [2023-09-01 13:45:18,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13895 conditions, 5811 events. 3933/5811 cut-off events. For 3196/3196 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 33531 event pairs, 3012 based on Foata normal form. 166/5823 useless extension candidates. Maximal degree in co-relation 11262. Up to 4410 conditions per place. [2023-09-01 13:45:18,728 INFO L137 encePairwiseOnDemand]: 485/489 looper letters, 64 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2023-09-01 13:45:18,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 364 flow [2023-09-01 13:45:18,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 13:45:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 13:45:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 897 transitions. [2023-09-01 13:45:18,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45858895705521474 [2023-09-01 13:45:18,732 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 897 transitions. [2023-09-01 13:45:18,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 897 transitions. [2023-09-01 13:45:18,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:45:18,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 897 transitions. [2023-09-01 13:45:18,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 224.25) internal successors, (897), 4 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:18,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 489.0) internal successors, (2445), 5 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:18,740 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 489.0) internal successors, (2445), 5 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:18,740 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 146 flow. Second operand 4 states and 897 transitions. [2023-09-01 13:45:18,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 364 flow [2023-09-01 13:45:18,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 360 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 13:45:18,744 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 165 flow [2023-09-01 13:45:18,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-09-01 13:45:18,746 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-09-01 13:45:18,747 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 165 flow [2023-09-01 13:45:18,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 215.75) internal successors, (863), 4 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:18,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:45:18,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:45:18,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 13:45:18,748 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:45:18,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:45:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1648494691, now seen corresponding path program 1 times [2023-09-01 13:45:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:45:18,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923380703] [2023-09-01 13:45:18,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:18,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:45:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:19,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:45:19,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:45:19,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923380703] [2023-09-01 13:45:19,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923380703] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:45:19,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:45:19,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 13:45:19,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952324154] [2023-09-01 13:45:19,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:45:19,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 13:45:19,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:45:19,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 13:45:19,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 13:45:19,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 489 [2023-09-01 13:45:19,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 209.83333333333334) internal successors, (1259), 6 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:19,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:45:19,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 489 [2023-09-01 13:45:19,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:45:20,327 INFO L130 PetriNetUnfolder]: 7243/10629 cut-off events. [2023-09-01 13:45:20,327 INFO L131 PetriNetUnfolder]: For 4981/4981 co-relation queries the response was YES. [2023-09-01 13:45:20,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25276 conditions, 10629 events. 7243/10629 cut-off events. For 4981/4981 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 66846 event pairs, 2526 based on Foata normal form. 126/10585 useless extension candidates. Maximal degree in co-relation 17966. Up to 3867 conditions per place. [2023-09-01 13:45:20,369 INFO L137 encePairwiseOnDemand]: 482/489 looper letters, 105 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2023-09-01 13:45:20,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 117 transitions, 601 flow [2023-09-01 13:45:20,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 13:45:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 13:45:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1329 transitions. [2023-09-01 13:45:20,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45296523517382414 [2023-09-01 13:45:20,373 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1329 transitions. [2023-09-01 13:45:20,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1329 transitions. [2023-09-01 13:45:20,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:45:20,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1329 transitions. [2023-09-01 13:45:20,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 221.5) internal successors, (1329), 6 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:20,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:20,383 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:20,383 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 165 flow. Second operand 6 states and 1329 transitions. [2023-09-01 13:45:20,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 117 transitions, 601 flow [2023-09-01 13:45:20,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 117 transitions, 596 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 13:45:20,389 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 204 flow [2023-09-01 13:45:20,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2023-09-01 13:45:20,391 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2023-09-01 13:45:20,392 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 204 flow [2023-09-01 13:45:20,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.83333333333334) internal successors, (1259), 6 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:20,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:45:20,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:45:20,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 13:45:20,393 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:45:20,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:45:20,394 INFO L85 PathProgramCache]: Analyzing trace with hash -715595175, now seen corresponding path program 1 times [2023-09-01 13:45:20,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:45:20,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254653533] [2023-09-01 13:45:20,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:20,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:45:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:45:20,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:45:20,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254653533] [2023-09-01 13:45:20,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254653533] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:45:20,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:45:20,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 13:45:20,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471871461] [2023-09-01 13:45:20,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:45:20,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 13:45:20,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:45:20,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 13:45:20,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 13:45:20,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 489 [2023-09-01 13:45:20,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 209.83333333333334) internal successors, (1259), 6 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:20,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:45:20,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 489 [2023-09-01 13:45:20,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:45:21,957 INFO L130 PetriNetUnfolder]: 7179/10606 cut-off events. [2023-09-01 13:45:21,957 INFO L131 PetriNetUnfolder]: For 6220/6323 co-relation queries the response was YES. [2023-09-01 13:45:21,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26030 conditions, 10606 events. 7179/10606 cut-off events. For 6220/6323 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 66934 event pairs, 3230 based on Foata normal form. 156/10654 useless extension candidates. Maximal degree in co-relation 21090. Up to 5061 conditions per place. [2023-09-01 13:45:22,009 INFO L137 encePairwiseOnDemand]: 482/489 looper letters, 65 selfloop transitions, 5 changer transitions 32/107 dead transitions. [2023-09-01 13:45:22,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 107 transitions, 566 flow [2023-09-01 13:45:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 13:45:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 13:45:22,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1320 transitions. [2023-09-01 13:45:22,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4498977505112474 [2023-09-01 13:45:22,014 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1320 transitions. [2023-09-01 13:45:22,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1320 transitions. [2023-09-01 13:45:22,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:45:22,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1320 transitions. [2023-09-01 13:45:22,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:22,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:22,024 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:22,024 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 204 flow. Second operand 6 states and 1320 transitions. [2023-09-01 13:45:22,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 107 transitions, 566 flow [2023-09-01 13:45:22,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 107 transitions, 561 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 13:45:22,030 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 211 flow [2023-09-01 13:45:22,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2023-09-01 13:45:22,033 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2023-09-01 13:45:22,034 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 211 flow [2023-09-01 13:45:22,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.83333333333334) internal successors, (1259), 6 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:22,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:45:22,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:45:22,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 13:45:22,035 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:45:22,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:45:22,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2096325821, now seen corresponding path program 1 times [2023-09-01 13:45:22,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:45:22,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593911929] [2023-09-01 13:45:22,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:22,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:45:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:22,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 13:45:22,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:45:22,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593911929] [2023-09-01 13:45:22,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593911929] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:45:22,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:45:22,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 13:45:22,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880689889] [2023-09-01 13:45:22,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:45:22,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 13:45:22,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:45:22,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 13:45:22,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 13:45:22,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 489 [2023-09-01 13:45:22,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 50 transitions, 211 flow. Second operand has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:22,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:45:22,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 489 [2023-09-01 13:45:22,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:45:23,612 INFO L130 PetriNetUnfolder]: 8043/11090 cut-off events. [2023-09-01 13:45:23,612 INFO L131 PetriNetUnfolder]: For 7898/7924 co-relation queries the response was YES. [2023-09-01 13:45:23,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29546 conditions, 11090 events. 8043/11090 cut-off events. For 7898/7924 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 61199 event pairs, 1720 based on Foata normal form. 584/11614 useless extension candidates. Maximal degree in co-relation 24684. Up to 5964 conditions per place. [2023-09-01 13:45:23,662 INFO L137 encePairwiseOnDemand]: 481/489 looper letters, 90 selfloop transitions, 9 changer transitions 11/114 dead transitions. [2023-09-01 13:45:23,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 114 transitions, 665 flow [2023-09-01 13:45:23,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 13:45:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 13:45:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1498 transitions. [2023-09-01 13:45:23,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4376278118609407 [2023-09-01 13:45:23,667 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1498 transitions. [2023-09-01 13:45:23,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1498 transitions. [2023-09-01 13:45:23,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:45:23,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1498 transitions. [2023-09-01 13:45:23,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:23,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 489.0) internal successors, (3912), 8 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:23,676 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 489.0) internal successors, (3912), 8 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:23,676 INFO L175 Difference]: Start difference. First operand has 67 places, 50 transitions, 211 flow. Second operand 7 states and 1498 transitions. [2023-09-01 13:45:23,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 114 transitions, 665 flow [2023-09-01 13:45:23,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 114 transitions, 641 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-09-01 13:45:23,683 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 255 flow [2023-09-01 13:45:23,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-09-01 13:45:23,684 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2023-09-01 13:45:23,684 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 255 flow [2023-09-01 13:45:23,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:23,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:45:23,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:45:23,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 13:45:23,685 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:45:23,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:45:23,686 INFO L85 PathProgramCache]: Analyzing trace with hash -707382063, now seen corresponding path program 1 times [2023-09-01 13:45:23,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:45:23,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199314067] [2023-09-01 13:45:23,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:23,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:45:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:23,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:45:23,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:45:23,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199314067] [2023-09-01 13:45:23,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199314067] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:45:23,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673711840] [2023-09-01 13:45:23,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:23,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:45:23,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:45:23,982 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:45:24,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-09-01 13:45:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:24,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 12 conjunts are in the unsatisfiable core [2023-09-01 13:45:24,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:45:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 13:45:24,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:45:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-09-01 13:45:24,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673711840] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 13:45:24,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 13:45:24,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 5] total 14 [2023-09-01 13:45:24,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302118372] [2023-09-01 13:45:24,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:45:24,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 13:45:24,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:45:24,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 13:45:24,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-09-01 13:45:24,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 489 [2023-09-01 13:45:24,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 255 flow. Second operand has 7 states, 7 states have (on average 195.57142857142858) internal successors, (1369), 7 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:24,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:45:24,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 489 [2023-09-01 13:45:24,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:45:25,640 INFO L130 PetriNetUnfolder]: 6931/9341 cut-off events. [2023-09-01 13:45:25,640 INFO L131 PetriNetUnfolder]: For 8926/8926 co-relation queries the response was YES. [2023-09-01 13:45:25,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27807 conditions, 9341 events. 6931/9341 cut-off events. For 8926/8926 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 47070 event pairs, 1335 based on Foata normal form. 396/9735 useless extension candidates. Maximal degree in co-relation 24197. Up to 3536 conditions per place. [2023-09-01 13:45:25,733 INFO L137 encePairwiseOnDemand]: 479/489 looper letters, 163 selfloop transitions, 27 changer transitions 1/194 dead transitions. [2023-09-01 13:45:25,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 194 transitions, 1240 flow [2023-09-01 13:45:25,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 13:45:25,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 13:45:25,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2242 transitions. [2023-09-01 13:45:25,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4168060977876929 [2023-09-01 13:45:25,739 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2242 transitions. [2023-09-01 13:45:25,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2242 transitions. [2023-09-01 13:45:25,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:45:25,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2242 transitions. [2023-09-01 13:45:25,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 203.8181818181818) internal successors, (2242), 11 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:25,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 489.0) internal successors, (5868), 12 states have internal predecessors, (5868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:25,752 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 489.0) internal successors, (5868), 12 states have internal predecessors, (5868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:25,753 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 255 flow. Second operand 11 states and 2242 transitions. [2023-09-01 13:45:25,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 194 transitions, 1240 flow [2023-09-01 13:45:25,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 194 transitions, 1211 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-09-01 13:45:25,776 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 427 flow [2023-09-01 13:45:25,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=427, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2023-09-01 13:45:25,777 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2023-09-01 13:45:25,777 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 427 flow [2023-09-01 13:45:25,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 195.57142857142858) internal successors, (1369), 7 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:25,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:45:25,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:45:25,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-09-01 13:45:25,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:45:25,985 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:45:25,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:45:25,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1366342543, now seen corresponding path program 1 times [2023-09-01 13:45:25,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:45:25,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511972977] [2023-09-01 13:45:25,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:25,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:45:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:26,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:45:26,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:45:26,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511972977] [2023-09-01 13:45:26,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511972977] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:45:26,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:45:26,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 13:45:26,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859218672] [2023-09-01 13:45:26,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:45:26,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 13:45:26,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:45:26,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 13:45:26,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 13:45:26,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 489 [2023-09-01 13:45:26,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 427 flow. Second operand has 6 states, 6 states have (on average 218.5) internal successors, (1311), 6 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:26,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:45:26,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 489 [2023-09-01 13:45:26,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:45:27,385 INFO L130 PetriNetUnfolder]: 9922/13074 cut-off events. [2023-09-01 13:45:27,386 INFO L131 PetriNetUnfolder]: For 30042/30078 co-relation queries the response was YES. [2023-09-01 13:45:27,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46140 conditions, 13074 events. 9922/13074 cut-off events. For 30042/30078 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 66469 event pairs, 1483 based on Foata normal form. 234/13282 useless extension candidates. Maximal degree in co-relation 46102. Up to 4518 conditions per place. [2023-09-01 13:45:27,482 INFO L137 encePairwiseOnDemand]: 483/489 looper letters, 125 selfloop transitions, 26 changer transitions 0/156 dead transitions. [2023-09-01 13:45:27,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 156 transitions, 1157 flow [2023-09-01 13:45:27,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 13:45:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 13:45:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1372 transitions. [2023-09-01 13:45:27,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4676209952283572 [2023-09-01 13:45:27,487 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1372 transitions. [2023-09-01 13:45:27,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1372 transitions. [2023-09-01 13:45:27,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:45:27,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1372 transitions. [2023-09-01 13:45:27,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 228.66666666666666) internal successors, (1372), 6 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:27,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:27,495 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:27,495 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 427 flow. Second operand 6 states and 1372 transitions. [2023-09-01 13:45:27,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 156 transitions, 1157 flow [2023-09-01 13:45:27,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 156 transitions, 1111 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-09-01 13:45:27,549 INFO L231 Difference]: Finished difference. Result has 79 places, 89 transitions, 659 flow [2023-09-01 13:45:27,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=659, PETRI_PLACES=79, PETRI_TRANSITIONS=89} [2023-09-01 13:45:27,550 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2023-09-01 13:45:27,550 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 89 transitions, 659 flow [2023-09-01 13:45:27,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 218.5) internal successors, (1311), 6 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:27,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:45:27,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:45:27,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 13:45:27,552 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:45:27,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:45:27,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1457187879, now seen corresponding path program 1 times [2023-09-01 13:45:27,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:45:27,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660185278] [2023-09-01 13:45:27,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:27,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:45:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:45:27,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:45:27,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660185278] [2023-09-01 13:45:27,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660185278] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:45:27,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179621565] [2023-09-01 13:45:27,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:27,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:45:27,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:45:27,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:45:27,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-01 13:45:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:27,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 12 conjunts are in the unsatisfiable core [2023-09-01 13:45:27,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:45:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:45:28,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:45:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-09-01 13:45:28,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179621565] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 13:45:28,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 13:45:28,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 5] total 14 [2023-09-01 13:45:28,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799841090] [2023-09-01 13:45:28,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:45:28,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 13:45:28,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:45:28,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 13:45:28,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-09-01 13:45:28,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 489 [2023-09-01 13:45:28,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 89 transitions, 659 flow. Second operand has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:28,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:45:28,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 489 [2023-09-01 13:45:28,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:45:30,462 INFO L130 PetriNetUnfolder]: 14337/19035 cut-off events. [2023-09-01 13:45:30,463 INFO L131 PetriNetUnfolder]: For 70118/70162 co-relation queries the response was YES. [2023-09-01 13:45:30,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74954 conditions, 19035 events. 14337/19035 cut-off events. For 70118/70162 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 91563 event pairs, 1720 based on Foata normal form. 1294/20327 useless extension candidates. Maximal degree in co-relation 74914. Up to 8232 conditions per place. [2023-09-01 13:45:30,563 INFO L137 encePairwiseOnDemand]: 478/489 looper letters, 212 selfloop transitions, 55 changer transitions 0/270 dead transitions. [2023-09-01 13:45:30,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 270 transitions, 2518 flow [2023-09-01 13:45:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 13:45:30,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 13:45:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2250 transitions. [2023-09-01 13:45:30,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4182933630786392 [2023-09-01 13:45:30,570 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2250 transitions. [2023-09-01 13:45:30,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2250 transitions. [2023-09-01 13:45:30,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:45:30,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2250 transitions. [2023-09-01 13:45:30,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 204.54545454545453) internal successors, (2250), 11 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:30,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 489.0) internal successors, (5868), 12 states have internal predecessors, (5868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:30,582 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 489.0) internal successors, (5868), 12 states have internal predecessors, (5868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:30,582 INFO L175 Difference]: Start difference. First operand has 79 places, 89 transitions, 659 flow. Second operand 11 states and 2250 transitions. [2023-09-01 13:45:30,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 270 transitions, 2518 flow [2023-09-01 13:45:30,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 270 transitions, 2485 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-09-01 13:45:30,681 INFO L231 Difference]: Finished difference. Result has 96 places, 119 transitions, 1130 flow [2023-09-01 13:45:30,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1130, PETRI_PLACES=96, PETRI_TRANSITIONS=119} [2023-09-01 13:45:30,682 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2023-09-01 13:45:30,683 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 119 transitions, 1130 flow [2023-09-01 13:45:30,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:30,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:45:30,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:45:30,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-01 13:45:30,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-09-01 13:45:30,889 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:45:30,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:45:30,889 INFO L85 PathProgramCache]: Analyzing trace with hash -308222025, now seen corresponding path program 2 times [2023-09-01 13:45:30,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:45:30,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111723541] [2023-09-01 13:45:30,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:30,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:45:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:45:31,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:45:31,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111723541] [2023-09-01 13:45:31,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111723541] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:45:31,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112718715] [2023-09-01 13:45:31,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 13:45:31,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:45:31,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:45:31,081 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:45:31,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-01 13:45:31,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 13:45:31,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 13:45:31,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 5 conjunts are in the unsatisfiable core [2023-09-01 13:45:31,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:45:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-09-01 13:45:31,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-09-01 13:45:31,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112718715] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:45:31,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-09-01 13:45:31,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2023-09-01 13:45:31,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783649485] [2023-09-01 13:45:31,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:45:31,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 13:45:31,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:45:31,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 13:45:31,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-09-01 13:45:31,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 489 [2023-09-01 13:45:31,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 119 transitions, 1130 flow. Second operand has 5 states, 5 states have (on average 222.6) internal successors, (1113), 5 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:31,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:45:31,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 489 [2023-09-01 13:45:31,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:45:33,704 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), 109#L57true, Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 68#L119true, 228#L148-4true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8#L86true, Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 506#(< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:33,705 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-09-01 13:45:33,705 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 13:45:33,705 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-09-01 13:45:33,705 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 13:45:34,178 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), 109#L57true, Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 103#L149-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 506#(< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,178 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-09-01 13:45:34,178 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 13:45:34,178 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 13:45:34,178 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 13:45:34,463 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 81#L63true, 208#L101true, Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 103#L149-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,464 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,464 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:45:34,464 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:45:34,464 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-09-01 13:45:34,508 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 101#L80true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 115#L150-1true, Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,509 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,509 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 13:45:34,509 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,509 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,527 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 98#L149-2true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,527 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,527 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,528 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,528 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 13:45:34,534 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 81#L63true, Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 103#L149-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,535 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,535 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 13:45:34,535 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,535 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,537 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 81#L63true, Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, 228#L148-4true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,537 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,538 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 13:45:34,538 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,538 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,558 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 208#L101true, Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 103#L149-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 552#(<= ~q2_front~0 ~q2_back~0), 27#thread1EXITtrue, Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,558 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,558 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 13:45:34,558 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,558 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,561 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 101#L80true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 115#L150-1true, Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,561 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,561 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 13:45:34,561 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,561 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,562 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 98#L149-2true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,562 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,562 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,562 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,562 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-09-01 13:45:34,574 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 39#thread2EXITtrue, 98#L149-2true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,574 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,574 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 13:45:34,575 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,575 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,586 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 115#L150-1true, Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,586 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,586 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,586 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,586 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 13:45:34,587 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 101#L80true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), 115#L150-1true, Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,587 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,587 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:45:34,587 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,587 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,589 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 103#L149-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 552#(<= ~q2_front~0 ~q2_back~0), 27#thread1EXITtrue, Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,589 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,589 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,589 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,589 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 13:45:34,594 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 228#L148-4true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), 27#thread1EXITtrue, Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,594 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,594 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 13:45:34,594 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,594 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,598 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 98#L149-2true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,598 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,598 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,599 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 13:45:34,599 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,601 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 81#L63true, Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 103#L149-1true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,601 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,601 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 13:45:34,602 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,602 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,608 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 39#thread2EXITtrue, 98#L149-2true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 565#true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,608 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,608 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,608 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 13:45:34,608 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,612 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 208#L101true, Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 98#L149-2true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,612 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,612 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,612 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 13:45:34,612 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,614 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 115#L150-1true, Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,614 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,614 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,614 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,614 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-09-01 13:45:34,617 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 39#thread2EXITtrue, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 115#L150-1true, Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,617 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 13:45:34,617 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,617 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,617 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 13:45:34,623 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 39#thread2EXITtrue, 98#L149-2true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,623 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 13:45:34,623 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,623 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,623 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 13:45:34,629 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), 115#L150-1true, Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,629 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 13:45:34,629 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,629 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 13:45:34,630 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,630 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 103#L149-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8#L86true, Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 27#thread1EXITtrue, Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,630 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 13:45:34,630 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,630 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 13:45:34,630 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,631 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 98#L149-2true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,631 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 13:45:34,631 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,631 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,631 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 13:45:34,639 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 39#thread2EXITtrue, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 115#L150-1true, Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,639 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 13:45:34,639 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,639 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 13:45:34,639 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,641 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 208#L101true, Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 565#true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), 115#L150-1true, Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 249#(= ~total~0 0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,641 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2023-09-01 13:45:34,641 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,641 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,641 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-09-01 13:45:34,644 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 39#thread2EXITtrue, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), 115#L150-1true, Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,644 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-09-01 13:45:34,644 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:45:34,644 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,645 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,645 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 70#L150-2true, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 828#(<= ~q1_front~0 ~q1_back~0), Black: 249#(= ~total~0 0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,645 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-09-01 13:45:34,645 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:45:34,649 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,649 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,658 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 98#L149-2true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8#L86true, Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,658 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-09-01 13:45:34,658 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:45:34,658 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,658 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,659 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 8#L86true, Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 293#(= ~j~0 0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), 115#L150-1true, Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,659 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-09-01 13:45:34,659 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,659 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,659 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:45:34,666 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 70#L150-2true, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,666 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2023-09-01 13:45:34,666 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,666 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-09-01 13:45:34,666 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,670 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, 70#L150-2true, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,670 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-09-01 13:45:34,670 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 13:45:34,670 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 13:45:34,670 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,671 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 138#L151-1true, 68#L119true, Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 197#L104true, Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,671 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-09-01 13:45:34,671 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 13:45:34,671 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 13:45:34,671 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,676 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][226], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 8#L86true, Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), 565#true, Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, 822#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), 115#L150-1true, Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 249#(= ~total~0 0), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,676 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-09-01 13:45:34,676 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,676 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 13:45:34,676 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 13:45:34,678 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 138#L151-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 565#true, 197#L104true, Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,678 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2023-09-01 13:45:34,678 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 13:45:34,678 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-09-01 13:45:34,678 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-09-01 13:45:34,682 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 138#L151-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), 122#thread3EXITtrue, Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,683 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2023-09-01 13:45:34,683 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-09-01 13:45:34,683 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-09-01 13:45:34,683 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-09-01 13:45:34,690 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), 133#L151-2true, Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,690 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2023-09-01 13:45:34,691 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-09-01 13:45:34,691 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-09-01 13:45:34,691 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-09-01 13:45:34,694 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1033] L122-->L119: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork2_plus_~a#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|))) (and (= (select (select |v_#memory_int_118| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_59))) |v_thread4Thread1of1ForFork2_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (= v_~total~0_70 |v_thread4Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| .cse0) (= (+ v_~q2_front~0_59 1) v_~q2_front~0_58) (not (= (ite (and (<= 0 v_~q2_front~0_59) (< v_~q2_front~0_59 v_~n2~0_30) (< v_~q2_front~0_59 v_~q2_back~0_75)) 1 0) 0)) (not (= (mod |v_thread4Thread1of1ForFork2_~cond~3#1_13| 256) 0)) (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#in~b#1_5| |v_thread4Thread1of1ForFork2_plus_~b#1_5|) (= |v_thread4Thread1of1ForFork2_plus_#res#1_5| v_~total~0_69) (<= 0 (+ v_~total~0_69 2147483648)) (<= v_~total~0_69 2147483647) (= |v_thread4Thread1of1ForFork2_plus_#in~a#1_5| |v_thread4Thread1of1ForFork2_plus_~a#1_5|))) InVars {~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_118|, ~q2_front~0=v_~q2_front~0_59, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_75, ~total~0=v_~total~0_70, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|} OutVars{thread4Thread1of1ForFork2_plus_#in~b#1=|v_thread4Thread1of1ForFork2_plus_#in~b#1_5|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, ~n2~0=v_~n2~0_30, ~q2~0.offset=v_~q2~0.offset_43, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q2_front~0=v_~q2_front~0_58, thread4Thread1of1ForFork2_plus_~b#1=|v_thread4Thread1of1ForFork2_plus_~b#1_5|, thread4Thread1of1ForFork2_#t~post15#1=|v_thread4Thread1of1ForFork2_#t~post15#1_5|, ~total~0=v_~total~0_69, thread4Thread1of1ForFork2_~cond~3#1=|v_thread4Thread1of1ForFork2_~cond~3#1_13|, thread4Thread1of1ForFork2_#t~mem13#1=|v_thread4Thread1of1ForFork2_#t~mem13#1_5|, thread4Thread1of1ForFork2_#t~ret14#1=|v_thread4Thread1of1ForFork2_#t~ret14#1_5|, thread4Thread1of1ForFork2_plus_#in~a#1=|v_thread4Thread1of1ForFork2_plus_#in~a#1_5|, #memory_int=|v_#memory_int_118|, thread4Thread1of1ForFork2_plus_#res#1=|v_thread4Thread1of1ForFork2_plus_#res#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork2_plus_~a#1=|v_thread4Thread1of1ForFork2_plus_~a#1_5|, ~q2_back~0=v_~q2_back~0_75} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_plus_#in~b#1, thread4Thread1of1ForFork2_#t~mem13#1, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~ret14#1, thread4Thread1of1ForFork2_plus_#in~a#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~q2_front~0, thread4Thread1of1ForFork2_plus_#res#1, thread4Thread1of1ForFork2_plus_~b#1, thread4Thread1of1ForFork2_plus_~a#1, thread4Thread1of1ForFork2_#t~post15#1, ~total~0][211], [Black: 254#(= ~q1_back~0 ~q1_front~0), Black: 259#(<= ~q2_back~0 ~q2_front~0), Black: 264#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 271#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 317#true, 61#L152-1true, 68#L119true, Black: 537#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 279#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 543#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 535#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 539#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 565#true, Black: 454#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 807#(and (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 559#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= ~q2_front~0 ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 809#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 729#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)), Black: 801#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 293#(= ~j~0 0), Black: 751#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 553#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 805#(and (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0) (= (mod |thread4Thread1of1ForFork2_~cond~3#1| 256) 0)) (<= ~i~0 0) (< ~i~0 ~N~0) (< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 552#(<= ~q2_front~0 ~q2_back~0), Black: 803#(and (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 557#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 310#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|)), Black: 249#(= ~total~0 0), 828#(<= ~q1_front~0 ~q1_back~0), Black: 309#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 312#(and (<= (div |thread4Thread1of1ForFork2_~cond~3#1| 256) 0) (or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)) (<= 1 |thread4Thread1of1ForFork2_~cond~3#1|))]) [2023-09-01 13:45:34,695 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2023-09-01 13:45:34,695 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-09-01 13:45:34,696 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-09-01 13:45:34,696 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-09-01 13:45:34,698 INFO L130 PetriNetUnfolder]: 24670/33330 cut-off events. [2023-09-01 13:45:34,698 INFO L131 PetriNetUnfolder]: For 219217/221379 co-relation queries the response was YES. [2023-09-01 13:45:34,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155998 conditions, 33330 events. 24670/33330 cut-off events. For 219217/221379 co-relation queries the response was YES. Maximal size of possible extension queue 1161. Compared 187101 event pairs, 3539 based on Foata normal form. 2259/35082 useless extension candidates. Maximal degree in co-relation 155949. Up to 11407 conditions per place. [2023-09-01 13:45:35,143 INFO L137 encePairwiseOnDemand]: 483/489 looper letters, 270 selfloop transitions, 24 changer transitions 0/306 dead transitions. [2023-09-01 13:45:35,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 306 transitions, 3608 flow [2023-09-01 13:45:35,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 13:45:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 13:45:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1392 transitions. [2023-09-01 13:45:35,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47443762781186094 [2023-09-01 13:45:35,148 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1392 transitions. [2023-09-01 13:45:35,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1392 transitions. [2023-09-01 13:45:35,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:45:35,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1392 transitions. [2023-09-01 13:45:35,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:35,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:35,155 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:35,155 INFO L175 Difference]: Start difference. First operand has 96 places, 119 transitions, 1130 flow. Second operand 6 states and 1392 transitions. [2023-09-01 13:45:35,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 306 transitions, 3608 flow [2023-09-01 13:45:35,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 306 transitions, 3604 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 13:45:35,501 INFO L231 Difference]: Finished difference. Result has 103 places, 137 transitions, 1391 flow [2023-09-01 13:45:35,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1391, PETRI_PLACES=103, PETRI_TRANSITIONS=137} [2023-09-01 13:45:35,502 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 58 predicate places. [2023-09-01 13:45:35,502 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 137 transitions, 1391 flow [2023-09-01 13:45:35,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 222.6) internal successors, (1113), 5 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 13:45:35,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:45:35,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:45:35,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-01 13:45:35,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:45:35,709 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 13:45:35,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:45:35,709 INFO L85 PathProgramCache]: Analyzing trace with hash 48592162, now seen corresponding path program 1 times [2023-09-01 13:45:35,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:45:35,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112377472] [2023-09-01 13:45:35,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:35,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:45:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:45:39,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:45:39,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112377472] [2023-09-01 13:45:39,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112377472] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:45:39,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248102470] [2023-09-01 13:45:39,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:45:39,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:45:39,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:45:39,533 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:45:39,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-01 13:45:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:45:39,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 89 conjunts are in the unsatisfiable core [2023-09-01 13:45:39,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:45:39,819 INFO L321 Elim1Store]: treesize reduction 141, result has 23.8 percent of original size [2023-09-01 13:45:39,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 18 treesize of output 49 [2023-09-01 13:45:40,068 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-09-01 13:45:40,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-09-01 13:45:40,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 13:45:40,830 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-09-01 13:45:40,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2023-09-01 13:45:41,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 13:45:41,055 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-09-01 13:45:41,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2023-09-01 13:45:41,725 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 13:45:41,726 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 13:45:41,737 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-09-01 13:45:41,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 30 [2023-09-01 13:45:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:45:41,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:45:43,274 INFO L321 Elim1Store]: treesize reduction 22, result has 95.1 percent of original size [2023-09-01 13:45:43,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 2704 treesize of output 2732 [2023-09-01 13:45:43,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:45:43,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1513 treesize of output 1410 [2023-09-01 13:45:43,771 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:45:43,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1321 treesize of output 1314 [2023-09-01 13:45:43,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:45:43,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1225 treesize of output 1218 [2023-09-01 13:45:44,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:45:44,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1129 treesize of output 1026 [2023-09-01 13:56:04,851 WARN L222 SmtUtils]: Spent 7.74s on a formula simplification. DAG size of input: 1118 DAG size of output: 1155 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15