./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R --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 422a1b4addf42b15afc18c6b3ff87ab94cf45a5af46627fa0165a3dbe9c138e8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:32:06,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:32:06,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:32:06,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:32:06,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:32:06,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:32:06,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:32:06,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:32:06,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:32:06,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:32:06,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:32:06,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:32:06,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:32:06,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:32:06,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:32:06,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:32:06,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:32:06,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:32:06,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:32:06,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:32:06,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:32:06,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:32:06,556 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:32:06,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:32:06,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:32:06,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:32:06,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:32:06,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:32:06,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:32:06,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:32:06,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:32:06,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:32:06,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:32:06,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:32:06,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:32:06,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:32:06,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:32:06,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:32:06,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:32:06,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:32:06,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:32:06,585 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:32:06,624 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:32:06,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:32:06,626 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:32:06,626 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:32:06,627 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:32:06,627 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:32:06,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:32:06,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:32:06,629 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:32:06,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:32:06,631 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:32:06,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:32:06,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:32:06,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:32:06,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:32:06,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:32:06,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:32:06,633 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:32:06,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:32:06,633 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:32:06,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:32:06,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:32:06,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:32:06,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:32:06,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:32:06,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:32:06,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:32:06,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:32:06,636 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:32:06,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:32:06,637 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:32:06,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:32:06,637 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:32:06,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:32:06,638 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R 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 -> 422a1b4addf42b15afc18c6b3ff87ab94cf45a5af46627fa0165a3dbe9c138e8 [2022-11-25 17:32:06,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:32:07,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:32:07,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:32:07,028 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:32:07,028 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:32:07,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2022-11-25 17:32:10,072 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:32:10,356 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:32:10,357 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2022-11-25 17:32:10,365 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/data/86df8e934/e0e83e1c0cba48638584e13adcc735f1/FLAG8bab8aba4 [2022-11-25 17:32:10,380 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/data/86df8e934/e0e83e1c0cba48638584e13adcc735f1 [2022-11-25 17:32:10,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:32:10,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:32:10,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:32:10,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:32:10,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:32:10,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:32:10" (1/1) ... [2022-11-25 17:32:10,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39dd19f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:32:10, skipping insertion in model container [2022-11-25 17:32:10,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:32:10" (1/1) ... [2022-11-25 17:32:10,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:32:10,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:32:10,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,603 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,640 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c[4218,4231] [2022-11-25 17:32:10,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:32:10,664 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:32:10,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,678 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:32:10,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:32:10,718 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c[4218,4231] [2022-11-25 17:32:10,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:32:10,739 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:32:10,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:32:10 WrapperNode [2022-11-25 17:32:10,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:32:10,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:32:10,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:32:10,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:32:10,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:32:10" (1/1) ... [2022-11-25 17:32:10,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:32:10" (1/1) ... [2022-11-25 17:32:10,795 INFO L138 Inliner]: procedures = 27, calls = 80, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 307 [2022-11-25 17:32:10,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:32:10,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:32:10,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:32:10,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:32:10,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:32:10" (1/1) ... [2022-11-25 17:32:10,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:32:10" (1/1) ... [2022-11-25 17:32:10,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:32:10" (1/1) ... [2022-11-25 17:32:10,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:32:10" (1/1) ... [2022-11-25 17:32:10,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:32:10" (1/1) ... [2022-11-25 17:32:10,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:32:10" (1/1) ... [2022-11-25 17:32:10,831 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:32:10" (1/1) ... [2022-11-25 17:32:10,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:32:10" (1/1) ... [2022-11-25 17:32:10,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:32:10,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:32:10,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:32:10,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:32:10,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:32:10" (1/1) ... [2022-11-25 17:32:10,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:32:10,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:32:10,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:32:10,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:32:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:32:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:32:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:32:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:32:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-25 17:32:10,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-25 17:32:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-25 17:32:10,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-25 17:32:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-25 17:32:10,928 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-25 17:32:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-25 17:32:10,928 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-25 17:32:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:32:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:32:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:32:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:32:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:32:10,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:32:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:32:10,931 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:32:11,062 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:32:11,065 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:32:11,694 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:32:12,012 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:32:12,012 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-25 17:32:12,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:32:12 BoogieIcfgContainer [2022-11-25 17:32:12,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:32:12,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:32:12,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:32:12,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:32:12,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:32:10" (1/3) ... [2022-11-25 17:32:12,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efd1631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:32:12, skipping insertion in model container [2022-11-25 17:32:12,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:32:10" (2/3) ... [2022-11-25 17:32:12,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efd1631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:32:12, skipping insertion in model container [2022-11-25 17:32:12,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:32:12" (3/3) ... [2022-11-25 17:32:12,024 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c [2022-11-25 17:32:12,034 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 17:32:12,045 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:32:12,046 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:32:12,046 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:32:12,122 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-25 17:32:12,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 231 transitions, 494 flow [2022-11-25 17:32:12,253 INFO L130 PetriNetUnfolder]: 18/227 cut-off events. [2022-11-25 17:32:12,253 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-25 17:32:12,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 227 events. 18/227 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 114 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 188. Up to 2 conditions per place. [2022-11-25 17:32:12,261 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 231 transitions, 494 flow [2022-11-25 17:32:12,267 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 214 transitions, 452 flow [2022-11-25 17:32:12,271 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:32:12,288 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 214 transitions, 452 flow [2022-11-25 17:32:12,291 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 214 transitions, 452 flow [2022-11-25 17:32:12,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 214 transitions, 452 flow [2022-11-25 17:32:12,347 INFO L130 PetriNetUnfolder]: 18/214 cut-off events. [2022-11-25 17:32:12,347 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-25 17:32:12,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 214 events. 18/214 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 113 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 188. Up to 2 conditions per place. [2022-11-25 17:32:12,351 INFO L119 LiptonReduction]: Number of co-enabled transitions 2000 [2022-11-25 17:32:23,001 INFO L134 LiptonReduction]: Checked pairs total: 4075 [2022-11-25 17:32:23,002 INFO L136 LiptonReduction]: Total number of compositions: 210 [2022-11-25 17:32:23,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:32:23,025 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;@3384cdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:32:23,025 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-25 17:32:23,035 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-11-25 17:32:23,035 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-25 17:32:23,036 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:23,036 INFO L209 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] [2022-11-25 17:32:23,037 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)] === [2022-11-25 17:32:23,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:23,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2124543170, now seen corresponding path program 1 times [2022-11-25 17:32:23,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:23,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463376877] [2022-11-25 17:32:23,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:23,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:32:23,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:23,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463376877] [2022-11-25 17:32:23,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463376877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:23,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:23,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:32:23,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071785613] [2022-11-25 17:32:23,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:23,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:32:23,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:23,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:32:23,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:32:23,806 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 441 [2022-11-25 17:32:23,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:23,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:23,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 441 [2022-11-25 17:32:23,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:24,497 INFO L130 PetriNetUnfolder]: 2606/3582 cut-off events. [2022-11-25 17:32:24,498 INFO L131 PetriNetUnfolder]: For 189/189 co-relation queries the response was YES. [2022-11-25 17:32:24,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7115 conditions, 3582 events. 2606/3582 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 16064 event pairs, 498 based on Foata normal form. 1/2315 useless extension candidates. Maximal degree in co-relation 5886. Up to 2275 conditions per place. [2022-11-25 17:32:24,530 INFO L137 encePairwiseOnDemand]: 437/441 looper letters, 47 selfloop transitions, 3 changer transitions 1/57 dead transitions. [2022-11-25 17:32:24,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 255 flow [2022-11-25 17:32:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:32:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:32:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2022-11-25 17:32:24,557 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4996220710506425 [2022-11-25 17:32:24,558 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 661 transitions. [2022-11-25 17:32:24,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 661 transitions. [2022-11-25 17:32:24,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:24,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 661 transitions. [2022-11-25 17:32:24,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:24,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:24,581 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:24,583 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 98 flow. Second operand 3 states and 661 transitions. [2022-11-25 17:32:24,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 255 flow [2022-11-25 17:32:24,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 229 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-25 17:32:24,596 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 101 flow [2022-11-25 17:32:24,599 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2022-11-25 17:32:24,603 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2022-11-25 17:32:24,603 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 101 flow [2022-11-25 17:32:24,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:24,604 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:24,605 INFO L209 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] [2022-11-25 17:32:24,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:32:24,605 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)] === [2022-11-25 17:32:24,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1678597911, now seen corresponding path program 1 times [2022-11-25 17:32:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:24,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069829342] [2022-11-25 17:32:24,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:24,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:32:24,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:24,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069829342] [2022-11-25 17:32:24,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069829342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:24,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:24,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:32:24,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259873699] [2022-11-25 17:32:24,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:24,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:32:24,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:24,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:32:24,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:32:24,828 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 441 [2022-11-25 17:32:24,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:24,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:24,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 441 [2022-11-25 17:32:24,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:25,379 INFO L130 PetriNetUnfolder]: 2709/3665 cut-off events. [2022-11-25 17:32:25,379 INFO L131 PetriNetUnfolder]: For 718/718 co-relation queries the response was YES. [2022-11-25 17:32:25,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8144 conditions, 3665 events. 2709/3665 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 16532 event pairs, 624 based on Foata normal form. 112/3137 useless extension candidates. Maximal degree in co-relation 2693. Up to 2597 conditions per place. [2022-11-25 17:32:25,403 INFO L137 encePairwiseOnDemand]: 438/441 looper letters, 55 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2022-11-25 17:32:25,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 63 transitions, 277 flow [2022-11-25 17:32:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:32:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:32:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-11-25 17:32:25,406 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4950869236583522 [2022-11-25 17:32:25,406 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-11-25 17:32:25,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-11-25 17:32:25,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:25,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-11-25 17:32:25,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:25,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:25,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:25,414 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 101 flow. Second operand 3 states and 655 transitions. [2022-11-25 17:32:25,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 63 transitions, 277 flow [2022-11-25 17:32:25,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:32:25,416 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 112 flow [2022-11-25 17:32:25,416 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2022-11-25 17:32:25,417 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2022-11-25 17:32:25,417 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 112 flow [2022-11-25 17:32:25,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:25,418 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:25,418 INFO L209 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] [2022-11-25 17:32:25,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:32:25,419 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)] === [2022-11-25 17:32:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:25,420 INFO L85 PathProgramCache]: Analyzing trace with hash -338462573, now seen corresponding path program 1 times [2022-11-25 17:32:25,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:25,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101899259] [2022-11-25 17:32:25,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:25,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:32:25,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:25,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101899259] [2022-11-25 17:32:25,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101899259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:25,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:25,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:32:25,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008955660] [2022-11-25 17:32:25,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:25,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:32:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:25,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:32:25,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:32:25,552 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 441 [2022-11-25 17:32:25,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:25,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:25,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 441 [2022-11-25 17:32:25,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:26,124 INFO L130 PetriNetUnfolder]: 2667/3762 cut-off events. [2022-11-25 17:32:26,125 INFO L131 PetriNetUnfolder]: For 1536/1536 co-relation queries the response was YES. [2022-11-25 17:32:26,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8733 conditions, 3762 events. 2667/3762 cut-off events. For 1536/1536 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 18264 event pairs, 655 based on Foata normal form. 106/3520 useless extension candidates. Maximal degree in co-relation 6349. Up to 2665 conditions per place. [2022-11-25 17:32:26,151 INFO L137 encePairwiseOnDemand]: 438/441 looper letters, 55 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2022-11-25 17:32:26,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 63 transitions, 293 flow [2022-11-25 17:32:26,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:32:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:32:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 653 transitions. [2022-11-25 17:32:26,154 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4935752078609221 [2022-11-25 17:32:26,155 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 653 transitions. [2022-11-25 17:32:26,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 653 transitions. [2022-11-25 17:32:26,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:26,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 653 transitions. [2022-11-25 17:32:26,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:26,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:26,161 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 441.0) internal successors, (1764), 4 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:26,161 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 112 flow. Second operand 3 states and 653 transitions. [2022-11-25 17:32:26,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 63 transitions, 293 flow [2022-11-25 17:32:26,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:32:26,165 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 124 flow [2022-11-25 17:32:26,166 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2022-11-25 17:32:26,167 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, -1 predicate places. [2022-11-25 17:32:26,167 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 124 flow [2022-11-25 17:32:26,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:26,168 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:26,168 INFO L209 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] [2022-11-25 17:32:26,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:32:26,169 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)] === [2022-11-25 17:32:26,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:26,170 INFO L85 PathProgramCache]: Analyzing trace with hash -271219077, now seen corresponding path program 1 times [2022-11-25 17:32:26,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:26,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412088400] [2022-11-25 17:32:26,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:26,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:26,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:32:26,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:26,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412088400] [2022-11-25 17:32:26,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412088400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:26,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:26,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:32:26,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102108800] [2022-11-25 17:32:26,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:26,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:32:26,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:26,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:32:26,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:32:26,454 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 441 [2022-11-25 17:32:26,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 200.5) internal successors, (802), 4 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:26,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:26,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 441 [2022-11-25 17:32:26,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:27,325 INFO L130 PetriNetUnfolder]: 3800/5543 cut-off events. [2022-11-25 17:32:27,325 INFO L131 PetriNetUnfolder]: For 2945/2945 co-relation queries the response was YES. [2022-11-25 17:32:27,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13410 conditions, 5543 events. 3800/5543 cut-off events. For 2945/2945 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 31193 event pairs, 2883 based on Foata normal form. 191/5606 useless extension candidates. Maximal degree in co-relation 6587. Up to 3495 conditions per place. [2022-11-25 17:32:27,365 INFO L137 encePairwiseOnDemand]: 436/441 looper letters, 87 selfloop transitions, 4 changer transitions 0/97 dead transitions. [2022-11-25 17:32:27,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 97 transitions, 464 flow [2022-11-25 17:32:27,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:32:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:32:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1055 transitions. [2022-11-25 17:32:27,369 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47845804988662133 [2022-11-25 17:32:27,369 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1055 transitions. [2022-11-25 17:32:27,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1055 transitions. [2022-11-25 17:32:27,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:27,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1055 transitions. [2022-11-25 17:32:27,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:27,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 441.0) internal successors, (2646), 6 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:27,380 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 441.0) internal successors, (2646), 6 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:27,380 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 124 flow. Second operand 5 states and 1055 transitions. [2022-11-25 17:32:27,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 97 transitions, 464 flow [2022-11-25 17:32:27,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 97 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:32:27,386 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 152 flow [2022-11-25 17:32:27,386 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-11-25 17:32:27,388 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2022-11-25 17:32:27,388 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 152 flow [2022-11-25 17:32:27,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 200.5) internal successors, (802), 4 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:27,389 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:27,390 INFO L209 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] [2022-11-25 17:32:27,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:32:27,390 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)] === [2022-11-25 17:32:27,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:27,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1899873110, now seen corresponding path program 1 times [2022-11-25 17:32:27,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:27,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328102227] [2022-11-25 17:32:27,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:27,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:32:27,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:27,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328102227] [2022-11-25 17:32:27,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328102227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:27,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:27,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:32:27,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595618967] [2022-11-25 17:32:27,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:27,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:32:27,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:27,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:32:27,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:32:27,747 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 441 [2022-11-25 17:32:27,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 200.5) internal successors, (802), 4 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:27,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:27,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 441 [2022-11-25 17:32:27,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:28,606 INFO L130 PetriNetUnfolder]: 3929/5783 cut-off events. [2022-11-25 17:32:28,606 INFO L131 PetriNetUnfolder]: For 3559/3559 co-relation queries the response was YES. [2022-11-25 17:32:28,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13991 conditions, 5783 events. 3929/5783 cut-off events. For 3559/3559 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 33118 event pairs, 3012 based on Foata normal form. 166/5841 useless extension candidates. Maximal degree in co-relation 11362. Up to 4406 conditions per place. [2022-11-25 17:32:28,647 INFO L137 encePairwiseOnDemand]: 437/441 looper letters, 60 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2022-11-25 17:32:28,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 364 flow [2022-11-25 17:32:28,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:32:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:32:28,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 833 transitions. [2022-11-25 17:32:28,650 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-11-25 17:32:28,651 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 833 transitions. [2022-11-25 17:32:28,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 833 transitions. [2022-11-25 17:32:28,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:28,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 833 transitions. [2022-11-25 17:32:28,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 208.25) internal successors, (833), 4 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:28,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 441.0) internal successors, (2205), 5 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:28,658 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 441.0) internal successors, (2205), 5 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:28,658 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 152 flow. Second operand 4 states and 833 transitions. [2022-11-25 17:32:28,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 364 flow [2022-11-25 17:32:28,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 360 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 17:32:28,667 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 176 flow [2022-11-25 17:32:28,667 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2022-11-25 17:32:28,670 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2022-11-25 17:32:28,670 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 176 flow [2022-11-25 17:32:28,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 200.5) internal successors, (802), 4 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:28,671 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:28,671 INFO L209 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] [2022-11-25 17:32:28,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:32:28,673 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)] === [2022-11-25 17:32:28,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1319262912, now seen corresponding path program 1 times [2022-11-25 17:32:28,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:28,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137689401] [2022-11-25 17:32:28,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:28,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:32:29,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:29,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137689401] [2022-11-25 17:32:29,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137689401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:29,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:29,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:32:29,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104824075] [2022-11-25 17:32:29,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:29,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:32:29,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:29,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:32:29,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:32:29,551 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 441 [2022-11-25 17:32:29,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:29,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:29,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 441 [2022-11-25 17:32:29,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:31,461 INFO L130 PetriNetUnfolder]: 8945/12454 cut-off events. [2022-11-25 17:32:31,461 INFO L131 PetriNetUnfolder]: For 5805/5805 co-relation queries the response was YES. [2022-11-25 17:32:31,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29953 conditions, 12454 events. 8945/12454 cut-off events. For 5805/5805 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 71476 event pairs, 500 based on Foata normal form. 122/12548 useless extension candidates. Maximal degree in co-relation 24426. Up to 8545 conditions per place. [2022-11-25 17:32:31,542 INFO L137 encePairwiseOnDemand]: 433/441 looper letters, 116 selfloop transitions, 13 changer transitions 5/137 dead transitions. [2022-11-25 17:32:31,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 137 transitions, 737 flow [2022-11-25 17:32:31,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:32:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:32:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1477 transitions. [2022-11-25 17:32:31,547 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47845804988662133 [2022-11-25 17:32:31,547 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1477 transitions. [2022-11-25 17:32:31,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1477 transitions. [2022-11-25 17:32:31,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:31,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1477 transitions. [2022-11-25 17:32:31,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:31,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 441.0) internal successors, (3528), 8 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:31,560 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 441.0) internal successors, (3528), 8 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:31,560 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 176 flow. Second operand 7 states and 1477 transitions. [2022-11-25 17:32:31,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 137 transitions, 737 flow [2022-11-25 17:32:31,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 137 transitions, 729 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-25 17:32:31,569 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 262 flow [2022-11-25 17:32:31,569 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2022-11-25 17:32:31,572 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2022-11-25 17:32:31,572 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 262 flow [2022-11-25 17:32:31,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:31,573 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:31,573 INFO L209 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] [2022-11-25 17:32:31,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:32:31,573 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)] === [2022-11-25 17:32:31,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash 410426202, now seen corresponding path program 2 times [2022-11-25 17:32:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:31,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649254942] [2022-11-25 17:32:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:32:31,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:31,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649254942] [2022-11-25 17:32:31,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649254942] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:32:31,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314047701] [2022-11-25 17:32:31,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:32:31,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:31,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:32:31,954 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:32:31,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:32:32,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:32:32,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:32:32,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 17:32:32,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:32,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:32:32,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:32:32,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314047701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:32,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:32:32,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-11-25 17:32:32,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616397004] [2022-11-25 17:32:32,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:32,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:32:32,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:32,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:32:32,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:32:32,616 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 441 [2022-11-25 17:32:32,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 199.83333333333334) internal successors, (1199), 6 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:32,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:32,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 441 [2022-11-25 17:32:32,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:34,913 INFO L130 PetriNetUnfolder]: 9686/13693 cut-off events. [2022-11-25 17:32:34,913 INFO L131 PetriNetUnfolder]: For 15479/15761 co-relation queries the response was YES. [2022-11-25 17:32:34,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40557 conditions, 13693 events. 9686/13693 cut-off events. For 15479/15761 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 83271 event pairs, 748 based on Foata normal form. 206/13773 useless extension candidates. Maximal degree in co-relation 31008. Up to 5470 conditions per place. [2022-11-25 17:32:35,034 INFO L137 encePairwiseOnDemand]: 434/441 looper letters, 118 selfloop transitions, 11 changer transitions 3/139 dead transitions. [2022-11-25 17:32:35,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 139 transitions, 815 flow [2022-11-25 17:32:35,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:32:35,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:32:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1275 transitions. [2022-11-25 17:32:35,039 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.481859410430839 [2022-11-25 17:32:35,039 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1275 transitions. [2022-11-25 17:32:35,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1275 transitions. [2022-11-25 17:32:35,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:35,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1275 transitions. [2022-11-25 17:32:35,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 212.5) internal successors, (1275), 6 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:35,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 441.0) internal successors, (3087), 7 states have internal predecessors, (3087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:35,050 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 441.0) internal successors, (3087), 7 states have internal predecessors, (3087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:35,050 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 262 flow. Second operand 6 states and 1275 transitions. [2022-11-25 17:32:35,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 139 transitions, 815 flow [2022-11-25 17:32:35,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 139 transitions, 815 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:32:35,157 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 334 flow [2022-11-25 17:32:35,158 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=334, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2022-11-25 17:32:35,158 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places. [2022-11-25 17:32:35,159 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 334 flow [2022-11-25 17:32:35,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.83333333333334) internal successors, (1199), 6 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:35,159 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:35,160 INFO L209 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] [2022-11-25 17:32:35,179 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 17:32:35,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:35,365 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)] === [2022-11-25 17:32:35,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:35,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1671949302, now seen corresponding path program 3 times [2022-11-25 17:32:35,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:35,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958661776] [2022-11-25 17:32:35,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:35,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:32:35,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:35,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958661776] [2022-11-25 17:32:35,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958661776] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:32:35,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753175812] [2022-11-25 17:32:35,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:32:35,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:35,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:32:35,896 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:32:35,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:32:36,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 17:32:36,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:32:36,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 17:32:36,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:32:36,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:32:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:32:36,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753175812] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 17:32:36,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:32:36,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 14 [2022-11-25 17:32:36,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540175625] [2022-11-25 17:32:36,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:36,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:32:36,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:36,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:32:36,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:32:36,614 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 441 [2022-11-25 17:32:36,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 334 flow. Second operand has 6 states, 6 states have (on average 196.83333333333334) internal successors, (1181), 6 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:36,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:36,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 441 [2022-11-25 17:32:36,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:38,868 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_27| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_9| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_9|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_9|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][94], [281#true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), 88#L145-4true, Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), 70#L77true, Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 231#(= ~total~0 0), 84#L116true, 263#true, Black: 236#(= ~q1_back~0 ~q1_front~0), 106#thread3EXITtrue, Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 195#thread1EXITtrue, Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 393#true]) [2022-11-25 17:32:38,868 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 17:32:38,868 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:32:38,869 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:32:38,869 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:32:38,869 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([876] L101-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= v_~total~0_74 |v_thread3Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (not (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_11| 256) 0)) (= |v_thread3Thread1of1ForFork2_plus_#res#1_5| .cse0) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|) (= (+ v_~q1_front~0_51 1) v_~q1_front~0_50) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_5| |v_thread3Thread1of1ForFork2_plus_~a#1_5|) (= (select (select |v_#memory_int_71| v_~q1~0.base_25) (+ v_~q1~0.offset_25 (* 4 v_~q1_front~0_51))) |v_thread3Thread1of1ForFork2_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_51 v_~n1~0_22) (<= 0 v_~q1_front~0_51) (< v_~q1_front~0_51 v_~q1_back~0_54)) 1 0) 0)) (= v_~total~0_73 |v_thread3Thread1of1ForFork2_plus_#res#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_51, ~q1_back~0=v_~q1_back~0_54, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, ~total~0=v_~total~0_74} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_50, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_5|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_5|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_5|, ~total~0=v_~total~0_73, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_5|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_5|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_5|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_5|, ~q1_back~0=v_~q1_back~0_54, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][139], [281#true, 33#L98true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), 88#L145-4true, Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), 70#L77true, Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 231#(= ~total~0 0), 84#L116true, 263#true, Black: 236#(= ~q1_back~0 ~q1_front~0), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 195#thread1EXITtrue, Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 393#true]) [2022-11-25 17:32:38,869 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 17:32:38,870 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:32:38,870 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:32:38,870 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:32:39,009 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_27| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_9| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_9|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_9|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][94], [281#true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), 70#L77true, Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 231#(= ~total~0 0), 133#L146-1true, 84#L116true, 263#true, Black: 236#(= ~q1_back~0 ~q1_front~0), 106#thread3EXITtrue, Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 195#thread1EXITtrue, Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 393#true, Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:32:39,009 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 17:32:39,009 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:32:39,009 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:32:39,009 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 17:32:39,010 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([876] L101-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= v_~total~0_74 |v_thread3Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (not (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_11| 256) 0)) (= |v_thread3Thread1of1ForFork2_plus_#res#1_5| .cse0) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|) (= (+ v_~q1_front~0_51 1) v_~q1_front~0_50) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_5| |v_thread3Thread1of1ForFork2_plus_~a#1_5|) (= (select (select |v_#memory_int_71| v_~q1~0.base_25) (+ v_~q1~0.offset_25 (* 4 v_~q1_front~0_51))) |v_thread3Thread1of1ForFork2_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_51 v_~n1~0_22) (<= 0 v_~q1_front~0_51) (< v_~q1_front~0_51 v_~q1_back~0_54)) 1 0) 0)) (= v_~total~0_73 |v_thread3Thread1of1ForFork2_plus_#res#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_51, ~q1_back~0=v_~q1_back~0_54, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, ~total~0=v_~total~0_74} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_50, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_5|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_5|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_5|, ~total~0=v_~total~0_73, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_5|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_5|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_5|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_5|, ~q1_back~0=v_~q1_back~0_54, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][139], [281#true, 33#L98true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), 70#L77true, Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 231#(= ~total~0 0), 133#L146-1true, 84#L116true, 263#true, Black: 236#(= ~q1_back~0 ~q1_front~0), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 195#thread1EXITtrue, Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 393#true, Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:32:39,010 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 17:32:39,011 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:32:39,011 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:32:39,011 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 17:32:39,114 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_27| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_9| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_9|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_9|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][94], [281#true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), 70#L77true, Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 231#(= ~total~0 0), 84#L116true, 263#true, Black: 236#(= ~q1_back~0 ~q1_front~0), 106#thread3EXITtrue, Black: 241#(<= ~q2_back~0 ~q2_front~0), 200#L146-2true, Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 393#true]) [2022-11-25 17:32:39,114 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 17:32:39,114 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:32:39,114 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:32:39,114 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:32:39,115 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([876] L101-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= v_~total~0_74 |v_thread3Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (not (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_11| 256) 0)) (= |v_thread3Thread1of1ForFork2_plus_#res#1_5| .cse0) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|) (= (+ v_~q1_front~0_51 1) v_~q1_front~0_50) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_5| |v_thread3Thread1of1ForFork2_plus_~a#1_5|) (= (select (select |v_#memory_int_71| v_~q1~0.base_25) (+ v_~q1~0.offset_25 (* 4 v_~q1_front~0_51))) |v_thread3Thread1of1ForFork2_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_51 v_~n1~0_22) (<= 0 v_~q1_front~0_51) (< v_~q1_front~0_51 v_~q1_back~0_54)) 1 0) 0)) (= v_~total~0_73 |v_thread3Thread1of1ForFork2_plus_#res#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_51, ~q1_back~0=v_~q1_back~0_54, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, ~total~0=v_~total~0_74} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_50, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_5|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_5|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_5|, ~total~0=v_~total~0_73, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_5|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_5|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_5|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_5|, ~q1_back~0=v_~q1_back~0_54, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][139], [281#true, 33#L98true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), 70#L77true, Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 231#(= ~total~0 0), 84#L116true, 263#true, Black: 236#(= ~q1_back~0 ~q1_front~0), Black: 241#(<= ~q2_back~0 ~q2_front~0), 200#L146-2true, Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 393#true]) [2022-11-25 17:32:39,115 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 17:32:39,115 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:32:39,115 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:32:39,116 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:32:39,175 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_27| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_9| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_9|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_9|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][94], [281#true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), 70#L77true, Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 63#L147-1true, Black: 231#(= ~total~0 0), 84#L116true, 263#true, Black: 236#(= ~q1_back~0 ~q1_front~0), 106#thread3EXITtrue, Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 393#true, Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:32:39,175 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 17:32:39,175 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:32:39,175 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:32:39,175 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:32:39,176 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([876] L101-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= v_~total~0_74 |v_thread3Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (not (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_11| 256) 0)) (= |v_thread3Thread1of1ForFork2_plus_#res#1_5| .cse0) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|) (= (+ v_~q1_front~0_51 1) v_~q1_front~0_50) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_5| |v_thread3Thread1of1ForFork2_plus_~a#1_5|) (= (select (select |v_#memory_int_71| v_~q1~0.base_25) (+ v_~q1~0.offset_25 (* 4 v_~q1_front~0_51))) |v_thread3Thread1of1ForFork2_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_51 v_~n1~0_22) (<= 0 v_~q1_front~0_51) (< v_~q1_front~0_51 v_~q1_back~0_54)) 1 0) 0)) (= v_~total~0_73 |v_thread3Thread1of1ForFork2_plus_#res#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_51, ~q1_back~0=v_~q1_back~0_54, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, ~total~0=v_~total~0_74} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_50, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_5|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_5|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_5|, ~total~0=v_~total~0_73, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_5|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_5|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_5|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_5|, ~q1_back~0=v_~q1_back~0_54, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][139], [281#true, 33#L98true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), 70#L77true, Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 63#L147-1true, Black: 231#(= ~total~0 0), 84#L116true, 263#true, Black: 236#(= ~q1_back~0 ~q1_front~0), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 393#true, Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:32:39,176 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 17:32:39,176 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:32:39,176 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:32:39,176 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:32:39,270 INFO L130 PetriNetUnfolder]: 10500/15026 cut-off events. [2022-11-25 17:32:39,270 INFO L131 PetriNetUnfolder]: For 24248/24589 co-relation queries the response was YES. [2022-11-25 17:32:39,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49470 conditions, 15026 events. 10500/15026 cut-off events. For 24248/24589 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 92282 event pairs, 1041 based on Foata normal form. 321/15239 useless extension candidates. Maximal degree in co-relation 38792. Up to 3854 conditions per place. [2022-11-25 17:32:39,547 INFO L137 encePairwiseOnDemand]: 433/441 looper letters, 172 selfloop transitions, 21 changer transitions 8/208 dead transitions. [2022-11-25 17:32:39,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 208 transitions, 1287 flow [2022-11-25 17:32:39,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:32:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 17:32:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2282 transitions. [2022-11-25 17:32:39,554 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4704184704184704 [2022-11-25 17:32:39,555 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2282 transitions. [2022-11-25 17:32:39,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2282 transitions. [2022-11-25 17:32:39,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:39,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2282 transitions. [2022-11-25 17:32:39,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 207.45454545454547) internal successors, (2282), 11 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:39,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 441.0) internal successors, (5292), 12 states have internal predecessors, (5292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:39,571 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 441.0) internal successors, (5292), 12 states have internal predecessors, (5292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:39,571 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 334 flow. Second operand 11 states and 2282 transitions. [2022-11-25 17:32:39,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 208 transitions, 1287 flow [2022-11-25 17:32:39,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 208 transitions, 1273 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-25 17:32:39,625 INFO L231 Difference]: Finished difference. Result has 83 places, 74 transitions, 460 flow [2022-11-25 17:32:39,626 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=460, PETRI_PLACES=83, PETRI_TRANSITIONS=74} [2022-11-25 17:32:39,628 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2022-11-25 17:32:39,628 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 74 transitions, 460 flow [2022-11-25 17:32:39,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.83333333333334) internal successors, (1181), 6 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:39,629 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:39,629 INFO L209 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] [2022-11-25 17:32:39,640 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:39,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-25 17:32:39,835 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)] === [2022-11-25 17:32:39,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:39,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1861037050, now seen corresponding path program 4 times [2022-11-25 17:32:39,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:39,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944785066] [2022-11-25 17:32:39,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:39,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:32:40,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:40,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944785066] [2022-11-25 17:32:40,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944785066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:40,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:40,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:32:40,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337444885] [2022-11-25 17:32:40,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:40,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:32:40,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:40,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:32:40,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:32:40,420 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 441 [2022-11-25 17:32:40,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 460 flow. Second operand has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:40,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:40,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 441 [2022-11-25 17:32:40,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:43,561 INFO L130 PetriNetUnfolder]: 14157/20301 cut-off events. [2022-11-25 17:32:43,561 INFO L131 PetriNetUnfolder]: For 46091/46968 co-relation queries the response was YES. [2022-11-25 17:32:43,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72005 conditions, 20301 events. 14157/20301 cut-off events. For 46091/46968 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 127354 event pairs, 2278 based on Foata normal form. 937/21183 useless extension candidates. Maximal degree in co-relation 62737. Up to 13419 conditions per place. [2022-11-25 17:32:43,734 INFO L137 encePairwiseOnDemand]: 432/441 looper letters, 157 selfloop transitions, 32 changer transitions 57/250 dead transitions. [2022-11-25 17:32:43,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 250 transitions, 1968 flow [2022-11-25 17:32:43,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:32:43,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 17:32:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1881 transitions. [2022-11-25 17:32:43,740 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47392290249433106 [2022-11-25 17:32:43,740 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1881 transitions. [2022-11-25 17:32:43,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1881 transitions. [2022-11-25 17:32:43,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:43,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1881 transitions. [2022-11-25 17:32:43,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:43,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 441.0) internal successors, (4410), 10 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:43,753 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 441.0) internal successors, (4410), 10 states have internal predecessors, (4410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:43,753 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 460 flow. Second operand 9 states and 1881 transitions. [2022-11-25 17:32:43,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 250 transitions, 1968 flow [2022-11-25 17:32:44,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 250 transitions, 1882 flow, removed 25 selfloop flow, removed 2 redundant places. [2022-11-25 17:32:44,086 INFO L231 Difference]: Finished difference. Result has 96 places, 104 transitions, 829 flow [2022-11-25 17:32:44,086 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=829, PETRI_PLACES=96, PETRI_TRANSITIONS=104} [2022-11-25 17:32:44,087 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 52 predicate places. [2022-11-25 17:32:44,087 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 104 transitions, 829 flow [2022-11-25 17:32:44,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:44,088 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:44,089 INFO L209 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] [2022-11-25 17:32:44,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:32:44,089 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)] === [2022-11-25 17:32:44,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2050717712, now seen corresponding path program 5 times [2022-11-25 17:32:44,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:44,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056516861] [2022-11-25 17:32:44,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:44,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:32:44,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:44,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056516861] [2022-11-25 17:32:44,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056516861] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:32:44,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421845826] [2022-11-25 17:32:44,447 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:32:44,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:32:44,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:32:44,451 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:32:44,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:32:44,627 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-11-25 17:32:44,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:32:44,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 17:32:44,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:32:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:32:44,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:32:44,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:32:44,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421845826] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:32:44,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:32:44,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 11 [2022-11-25 17:32:44,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334196092] [2022-11-25 17:32:44,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:32:44,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 17:32:44,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:44,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 17:32:44,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:32:45,038 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 441 [2022-11-25 17:32:45,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 104 transitions, 829 flow. Second operand has 11 states, 11 states have (on average 193.36363636363637) internal successors, (2127), 11 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:45,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:45,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 441 [2022-11-25 17:32:45,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:49,856 INFO L130 PetriNetUnfolder]: 20112/28866 cut-off events. [2022-11-25 17:32:49,857 INFO L131 PetriNetUnfolder]: For 88616/90886 co-relation queries the response was YES. [2022-11-25 17:32:50,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111761 conditions, 28866 events. 20112/28866 cut-off events. For 88616/90886 co-relation queries the response was YES. Maximal size of possible extension queue 1217. Compared 181381 event pairs, 3451 based on Foata normal form. 2862/31501 useless extension candidates. Maximal degree in co-relation 108046. Up to 9925 conditions per place. [2022-11-25 17:32:50,160 INFO L137 encePairwiseOnDemand]: 432/441 looper letters, 243 selfloop transitions, 83 changer transitions 6/343 dead transitions. [2022-11-25 17:32:50,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 343 transitions, 3261 flow [2022-11-25 17:32:50,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:32:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-25 17:32:50,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2035 transitions. [2022-11-25 17:32:50,167 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4614512471655329 [2022-11-25 17:32:50,167 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2035 transitions. [2022-11-25 17:32:50,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2035 transitions. [2022-11-25 17:32:50,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:50,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2035 transitions. [2022-11-25 17:32:50,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 203.5) internal successors, (2035), 10 states have internal predecessors, (2035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:50,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 441.0) internal successors, (4851), 11 states have internal predecessors, (4851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:50,184 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 441.0) internal successors, (4851), 11 states have internal predecessors, (4851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:50,185 INFO L175 Difference]: Start difference. First operand has 96 places, 104 transitions, 829 flow. Second operand 10 states and 2035 transitions. [2022-11-25 17:32:50,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 343 transitions, 3261 flow [2022-11-25 17:32:50,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 343 transitions, 3211 flow, removed 25 selfloop flow, removed 2 redundant places. [2022-11-25 17:32:50,887 INFO L231 Difference]: Finished difference. Result has 105 places, 161 transitions, 1522 flow [2022-11-25 17:32:50,887 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1522, PETRI_PLACES=105, PETRI_TRANSITIONS=161} [2022-11-25 17:32:50,888 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 61 predicate places. [2022-11-25 17:32:50,888 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 161 transitions, 1522 flow [2022-11-25 17:32:50,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 193.36363636363637) internal successors, (2127), 11 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:50,889 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:32:50,889 INFO L209 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] [2022-11-25 17:32:50,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:32:51,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_281e388d-6973-492a-9959-887c1a89b4b2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 17:32:51,100 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)] === [2022-11-25 17:32:51,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:32:51,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1440263198, now seen corresponding path program 6 times [2022-11-25 17:32:51,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:32:51,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370274674] [2022-11-25 17:32:51,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:32:51,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:32:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:32:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:32:51,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:32:51,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370274674] [2022-11-25 17:32:51,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370274674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:32:51,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:32:51,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:32:51,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050873306] [2022-11-25 17:32:51,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:32:51,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:32:51,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:32:51,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:32:51,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:32:51,713 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 441 [2022-11-25 17:32:51,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 161 transitions, 1522 flow. Second operand has 6 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:51,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:32:51,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 441 [2022-11-25 17:32:51,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:32:58,502 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L77-->L83: Formula: (and (= v_~j~0_22 (+ v_~j~0_23 1)) (= |v_thread2Thread1of1ForFork1_~cond~1#1_15| (ite (= (ite (< v_~j~0_22 v_~N~0_18) 1 0) 0) 0 1))) InVars {~j~0=v_~j~0_23, ~N~0=v_~N~0_18} OutVars{thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~j~0=v_~j~0_22, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, ~j~0, thread2Thread1of1ForFork1_#t~post6#1][234], [114#L119true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 63#L147-1true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), 263#true, Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), 838#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 21#L83true, 393#true, Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 231#(= ~total~0 0), 6#L101true, Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:32:58,502 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 17:32:58,502 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:32:58,502 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:32:58,502 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:32:58,503 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([932] L119-->L116: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_5| |v_thread4Thread1of1ForFork0_plus_~b#1_5|))) (and (= |v_thread4Thread1of1ForFork0_plus_#in~a#1_5| v_~total~0_82) (= |v_thread4Thread1of1ForFork0_plus_#in~b#1_5| (select (select |v_#memory_int_101| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_67)))) (= |v_thread4Thread1of1ForFork0_plus_~a#1_5| |v_thread4Thread1of1ForFork0_plus_#in~a#1_5|) (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_~b#1_5| 0) (<= .cse0 2147483647)) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= (+ v_~q2_front~0_67 1) v_~q2_front~0_66) (= |v_thread4Thread1of1ForFork0_plus_#res#1_5| .cse0) (<= 0 (+ v_~total~0_81 2147483648)) (not (= (mod |v_thread4Thread1of1ForFork0_~cond~3#1_15| 256) 0)) (<= v_~total~0_81 2147483647) (= v_~total~0_81 |v_thread4Thread1of1ForFork0_plus_#res#1_5|) (= |v_thread4Thread1of1ForFork0_plus_~b#1_5| |v_thread4Thread1of1ForFork0_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (not (= (ite (and (< v_~q2_front~0_67 v_~n2~0_36) (< v_~q2_front~0_67 v_~q2_back~0_74) (<= 0 v_~q2_front~0_67)) 1 0) 0)))) InVars {thread4Thread1of1ForFork0_~cond~3#1=|v_thread4Thread1of1ForFork0_~cond~3#1_15|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_101|, ~q2_front~0=v_~q2_front~0_67, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_74, ~total~0=v_~total~0_82} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_5|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_43, ~q2_front~0=v_~q2_front~0_66, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_5|, thread4Thread1of1ForFork0_#t~mem10#1=|v_thread4Thread1of1ForFork0_#t~mem10#1_5|, ~total~0=v_~total~0_81, thread4Thread1of1ForFork0_#t~post12#1=|v_thread4Thread1of1ForFork0_#t~post12#1_5|, thread4Thread1of1ForFork0_~cond~3#1=|v_thread4Thread1of1ForFork0_~cond~3#1_15|, thread4Thread1of1ForFork0_#t~ret11#1=|v_thread4Thread1of1ForFork0_#t~ret11#1_5|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_5|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #memory_int=|v_#memory_int_101|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_5|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_74} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#t~post12#1, thread4Thread1of1ForFork0_#t~ret11#1, thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork0_#t~mem10#1, ~total~0][294], [Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 63#L147-1true, 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), 263#true, Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 393#true, Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), 70#L77true, Black: 231#(= ~total~0 0), 6#L101true, Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), 836#(and (= |thread4Thread1of1ForFork0_~cond~3#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:32:58,503 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 17:32:58,503 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:32:58,503 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:32:58,503 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:32:58,584 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L77-->L83: Formula: (and (= v_~j~0_22 (+ v_~j~0_23 1)) (= |v_thread2Thread1of1ForFork1_~cond~1#1_15| (ite (= (ite (< v_~j~0_22 v_~N~0_18) 1 0) 0) 0 1))) InVars {~j~0=v_~j~0_23, ~N~0=v_~N~0_18} OutVars{thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~j~0=v_~j~0_22, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, ~j~0, thread2Thread1of1ForFork1_#t~post6#1][234], [114#L119true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 63#L147-1true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 106#thread3EXITtrue, Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 838#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 21#L83true, 393#true, Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:32:58,584 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-11-25 17:32:58,584 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:32:58,585 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:32:58,585 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:32:58,585 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([932] L119-->L116: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_5| |v_thread4Thread1of1ForFork0_plus_~b#1_5|))) (and (= |v_thread4Thread1of1ForFork0_plus_#in~a#1_5| v_~total~0_82) (= |v_thread4Thread1of1ForFork0_plus_#in~b#1_5| (select (select |v_#memory_int_101| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_67)))) (= |v_thread4Thread1of1ForFork0_plus_~a#1_5| |v_thread4Thread1of1ForFork0_plus_#in~a#1_5|) (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_~b#1_5| 0) (<= .cse0 2147483647)) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= (+ v_~q2_front~0_67 1) v_~q2_front~0_66) (= |v_thread4Thread1of1ForFork0_plus_#res#1_5| .cse0) (<= 0 (+ v_~total~0_81 2147483648)) (not (= (mod |v_thread4Thread1of1ForFork0_~cond~3#1_15| 256) 0)) (<= v_~total~0_81 2147483647) (= v_~total~0_81 |v_thread4Thread1of1ForFork0_plus_#res#1_5|) (= |v_thread4Thread1of1ForFork0_plus_~b#1_5| |v_thread4Thread1of1ForFork0_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (not (= (ite (and (< v_~q2_front~0_67 v_~n2~0_36) (< v_~q2_front~0_67 v_~q2_back~0_74) (<= 0 v_~q2_front~0_67)) 1 0) 0)))) InVars {thread4Thread1of1ForFork0_~cond~3#1=|v_thread4Thread1of1ForFork0_~cond~3#1_15|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_101|, ~q2_front~0=v_~q2_front~0_67, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_74, ~total~0=v_~total~0_82} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_5|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_43, ~q2_front~0=v_~q2_front~0_66, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_5|, thread4Thread1of1ForFork0_#t~mem10#1=|v_thread4Thread1of1ForFork0_#t~mem10#1_5|, ~total~0=v_~total~0_81, thread4Thread1of1ForFork0_#t~post12#1=|v_thread4Thread1of1ForFork0_#t~post12#1_5|, thread4Thread1of1ForFork0_~cond~3#1=|v_thread4Thread1of1ForFork0_~cond~3#1_15|, thread4Thread1of1ForFork0_#t~ret11#1=|v_thread4Thread1of1ForFork0_#t~ret11#1_5|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_5|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #memory_int=|v_#memory_int_101|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_5|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_74} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#t~post12#1, thread4Thread1of1ForFork0_#t~ret11#1, thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork0_#t~mem10#1, ~total~0][294], [Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 63#L147-1true, 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 106#thread3EXITtrue, Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 393#true, Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), 70#L77true, Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), 836#(and (= |thread4Thread1of1ForFork0_~cond~3#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:32:58,585 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-11-25 17:32:58,585 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:32:58,585 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:32:58,586 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:32:58,740 INFO L130 PetriNetUnfolder]: 30766/43748 cut-off events. [2022-11-25 17:32:58,740 INFO L131 PetriNetUnfolder]: For 192325/195285 co-relation queries the response was YES. [2022-11-25 17:32:58,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198205 conditions, 43748 events. 30766/43748 cut-off events. For 192325/195285 co-relation queries the response was YES. Maximal size of possible extension queue 1973. Compared 291316 event pairs, 4994 based on Foata normal form. 3263/46237 useless extension candidates. Maximal degree in co-relation 187987. Up to 22298 conditions per place. [2022-11-25 17:32:59,230 INFO L137 encePairwiseOnDemand]: 432/441 looper letters, 263 selfloop transitions, 108 changer transitions 12/391 dead transitions. [2022-11-25 17:32:59,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 391 transitions, 4110 flow [2022-11-25 17:32:59,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:32:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:32:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1704 transitions. [2022-11-25 17:32:59,239 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48299319727891155 [2022-11-25 17:32:59,239 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1704 transitions. [2022-11-25 17:32:59,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1704 transitions. [2022-11-25 17:32:59,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:32:59,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1704 transitions. [2022-11-25 17:32:59,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 213.0) internal successors, (1704), 8 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:59,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 441.0) internal successors, (3969), 9 states have internal predecessors, (3969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:59,250 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 441.0) internal successors, (3969), 9 states have internal predecessors, (3969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:32:59,251 INFO L175 Difference]: Start difference. First operand has 105 places, 161 transitions, 1522 flow. Second operand 8 states and 1704 transitions. [2022-11-25 17:32:59,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 391 transitions, 4110 flow [2022-11-25 17:33:01,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 391 transitions, 3969 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-11-25 17:33:01,187 INFO L231 Difference]: Finished difference. Result has 116 places, 210 transitions, 2403 flow [2022-11-25 17:33:01,187 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2403, PETRI_PLACES=116, PETRI_TRANSITIONS=210} [2022-11-25 17:33:01,188 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 72 predicate places. [2022-11-25 17:33:01,188 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 210 transitions, 2403 flow [2022-11-25 17:33:01,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:33:01,189 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:33:01,189 INFO L209 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] [2022-11-25 17:33:01,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:33:01,189 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)] === [2022-11-25 17:33:01,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:33:01,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1764085292, now seen corresponding path program 7 times [2022-11-25 17:33:01,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:33:01,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226588546] [2022-11-25 17:33:01,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:33:01,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:33:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:33:01,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:33:01,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226588546] [2022-11-25 17:33:01,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226588546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:33:01,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:33:01,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:33:01,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490890096] [2022-11-25 17:33:01,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:33:01,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:33:01,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:33:01,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:33:01,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:33:01,673 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 441 [2022-11-25 17:33:01,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 210 transitions, 2403 flow. Second operand has 6 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:33:01,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:33:01,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 441 [2022-11-25 17:33:01,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:33:07,164 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([876] L101-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= v_~total~0_74 |v_thread3Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (not (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_11| 256) 0)) (= |v_thread3Thread1of1ForFork2_plus_#res#1_5| .cse0) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|) (= (+ v_~q1_front~0_51 1) v_~q1_front~0_50) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_5| |v_thread3Thread1of1ForFork2_plus_~a#1_5|) (= (select (select |v_#memory_int_71| v_~q1~0.base_25) (+ v_~q1~0.offset_25 (* 4 v_~q1_front~0_51))) |v_thread3Thread1of1ForFork2_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_51 v_~n1~0_22) (<= 0 v_~q1_front~0_51) (< v_~q1_front~0_51 v_~q1_back~0_54)) 1 0) 0)) (= v_~total~0_73 |v_thread3Thread1of1ForFork2_plus_#res#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_51, ~q1_back~0=v_~q1_back~0_54, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, ~total~0=v_~total~0_74} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_50, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_5|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_5|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_5|, ~total~0=v_~total~0_73, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_5|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_5|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_5|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_5|, ~q1_back~0=v_~q1_back~0_54, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][239], [33#L98true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 88#L145-4true, Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 840#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 138#L62true, 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), 393#true, Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:07,164 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 17:33:07,164 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 17:33:07,164 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 17:33:07,165 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:33:07,165 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_27| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_9| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_9|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_9|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][147], [Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 88#L145-4true, Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 840#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), 106#thread3EXITtrue, Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 138#L62true, 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), 393#true, Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:07,165 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 17:33:07,165 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 17:33:07,165 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 17:33:07,165 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 17:33:07,885 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([876] L101-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= v_~total~0_74 |v_thread3Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (not (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_11| 256) 0)) (= |v_thread3Thread1of1ForFork2_plus_#res#1_5| .cse0) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|) (= (+ v_~q1_front~0_51 1) v_~q1_front~0_50) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_5| |v_thread3Thread1of1ForFork2_plus_~a#1_5|) (= (select (select |v_#memory_int_71| v_~q1~0.base_25) (+ v_~q1~0.offset_25 (* 4 v_~q1_front~0_51))) |v_thread3Thread1of1ForFork2_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_51 v_~n1~0_22) (<= 0 v_~q1_front~0_51) (< v_~q1_front~0_51 v_~q1_back~0_54)) 1 0) 0)) (= v_~total~0_73 |v_thread3Thread1of1ForFork2_plus_#res#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_51, ~q1_back~0=v_~q1_back~0_54, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, ~total~0=v_~total~0_74} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_50, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_5|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_5|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_5|, ~total~0=v_~total~0_73, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_5|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_5|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_5|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_5|, ~q1_back~0=v_~q1_back~0_54, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][239], [523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), 33#L98true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 88#L145-4true, Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 840#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 393#true, Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 146#L56true, 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:07,886 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 17:33:07,886 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:33:07,886 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:07,886 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:07,886 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_27| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_9| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_9|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_9|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][147], [523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 88#L145-4true, Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 840#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), 106#thread3EXITtrue, Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 393#true, Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 146#L56true, 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:07,886 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 17:33:07,886 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:33:07,886 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:07,886 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:07,948 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([876] L101-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= v_~total~0_74 |v_thread3Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (not (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_11| 256) 0)) (= |v_thread3Thread1of1ForFork2_plus_#res#1_5| .cse0) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|) (= (+ v_~q1_front~0_51 1) v_~q1_front~0_50) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_5| |v_thread3Thread1of1ForFork2_plus_~a#1_5|) (= (select (select |v_#memory_int_71| v_~q1~0.base_25) (+ v_~q1~0.offset_25 (* 4 v_~q1_front~0_51))) |v_thread3Thread1of1ForFork2_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_51 v_~n1~0_22) (<= 0 v_~q1_front~0_51) (< v_~q1_front~0_51 v_~q1_back~0_54)) 1 0) 0)) (= v_~total~0_73 |v_thread3Thread1of1ForFork2_plus_#res#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_51, ~q1_back~0=v_~q1_back~0_54, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, ~total~0=v_~total~0_74} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_50, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_5|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_5|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_5|, ~total~0=v_~total~0_73, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_5|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_5|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_5|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_5|, ~q1_back~0=v_~q1_back~0_54, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][239], [33#L98true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), 88#L145-4true, Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 840#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), 393#true, Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), 195#thread1EXITtrue, Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:07,948 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 17:33:07,948 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:33:07,948 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:07,948 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:07,949 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_27| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_9| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_9|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_9|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][147], [Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), 88#L145-4true, Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 840#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), 106#thread3EXITtrue, Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 866#true, 393#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), 195#thread1EXITtrue, Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:07,949 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 17:33:07,949 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:07,949 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:33:07,949 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:08,043 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([876] L101-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= v_~total~0_74 |v_thread3Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (not (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_11| 256) 0)) (= |v_thread3Thread1of1ForFork2_plus_#res#1_5| .cse0) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|) (= (+ v_~q1_front~0_51 1) v_~q1_front~0_50) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_5| |v_thread3Thread1of1ForFork2_plus_~a#1_5|) (= (select (select |v_#memory_int_71| v_~q1~0.base_25) (+ v_~q1~0.offset_25 (* 4 v_~q1_front~0_51))) |v_thread3Thread1of1ForFork2_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_51 v_~n1~0_22) (<= 0 v_~q1_front~0_51) (< v_~q1_front~0_51 v_~q1_back~0_54)) 1 0) 0)) (= v_~total~0_73 |v_thread3Thread1of1ForFork2_plus_#res#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_51, ~q1_back~0=v_~q1_back~0_54, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, ~total~0=v_~total~0_74} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_50, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_5|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_5|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_5|, ~total~0=v_~total~0_73, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_5|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_5|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_5|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_5|, ~q1_back~0=v_~q1_back~0_54, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][239], [33#L98true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 133#L146-1true, 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 840#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), 138#L62true, Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 866#true, 393#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:08,043 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 17:33:08,043 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:08,043 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:08,044 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:33:08,044 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_27| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_9| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_9|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_9|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][147], [Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 133#L146-1true, 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 840#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), 106#thread3EXITtrue, Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), 138#L62true, Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 866#true, 393#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:08,044 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 17:33:08,050 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:08,050 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:08,050 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:33:08,054 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L77-->L83: Formula: (and (= v_~j~0_22 (+ v_~j~0_23 1)) (= |v_thread2Thread1of1ForFork1_~cond~1#1_15| (ite (= (ite (< v_~j~0_22 v_~N~0_18) 1 0) 0) 0 1))) InVars {~j~0=v_~j~0_23, ~N~0=v_~N~0_18} OutVars{thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~j~0=v_~j~0_22, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, ~j~0, thread2Thread1of1ForFork1_#t~post6#1][276], [114#L119true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), 88#L145-4true, Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 838#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 138#L62true, 21#L83true, 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), 393#true, Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), 6#L101true, Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:08,054 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 17:33:08,054 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 17:33:08,054 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:08,054 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:08,739 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([876] L101-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= v_~total~0_74 |v_thread3Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (not (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_11| 256) 0)) (= |v_thread3Thread1of1ForFork2_plus_#res#1_5| .cse0) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|) (= (+ v_~q1_front~0_51 1) v_~q1_front~0_50) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_5| |v_thread3Thread1of1ForFork2_plus_~a#1_5|) (= (select (select |v_#memory_int_71| v_~q1~0.base_25) (+ v_~q1~0.offset_25 (* 4 v_~q1_front~0_51))) |v_thread3Thread1of1ForFork2_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_51 v_~n1~0_22) (<= 0 v_~q1_front~0_51) (< v_~q1_front~0_51 v_~q1_back~0_54)) 1 0) 0)) (= v_~total~0_73 |v_thread3Thread1of1ForFork2_plus_#res#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_51, ~q1_back~0=v_~q1_back~0_54, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, ~total~0=v_~total~0_74} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_50, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_5|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_5|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_5|, ~total~0=v_~total~0_73, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_5|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_5|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_5|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_5|, ~q1_back~0=v_~q1_back~0_54, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][239], [523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), 33#L98true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 133#L146-1true, 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 840#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 393#true, Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 146#L56true, 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:08,739 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,740 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 17:33:08,740 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,740 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,740 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_27| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_9| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_9|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_9|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][147], [523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 133#L146-1true, 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 840#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), 106#thread3EXITtrue, Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 393#true, Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 146#L56true, 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:08,741 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,741 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 17:33:08,741 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,741 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,744 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L77-->L83: Formula: (and (= v_~j~0_22 (+ v_~j~0_23 1)) (= |v_thread2Thread1of1ForFork1_~cond~1#1_15| (ite (= (ite (< v_~j~0_22 v_~N~0_18) 1 0) 0) 0 1))) InVars {~j~0=v_~j~0_23, ~N~0=v_~N~0_18} OutVars{thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~j~0=v_~j~0_22, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, ~j~0, thread2Thread1of1ForFork1_#t~post6#1][276], [523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), 114#L119true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), 88#L145-4true, Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 838#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 21#L83true, 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 393#true, 6#L101true, Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 146#L56true, 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:08,744 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,744 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,744 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,745 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 17:33:08,835 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([876] L101-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= v_~total~0_74 |v_thread3Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (not (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_11| 256) 0)) (= |v_thread3Thread1of1ForFork2_plus_#res#1_5| .cse0) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|) (= (+ v_~q1_front~0_51 1) v_~q1_front~0_50) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_5| |v_thread3Thread1of1ForFork2_plus_~a#1_5|) (= (select (select |v_#memory_int_71| v_~q1~0.base_25) (+ v_~q1~0.offset_25 (* 4 v_~q1_front~0_51))) |v_thread3Thread1of1ForFork2_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_51 v_~n1~0_22) (<= 0 v_~q1_front~0_51) (< v_~q1_front~0_51 v_~q1_back~0_54)) 1 0) 0)) (= v_~total~0_73 |v_thread3Thread1of1ForFork2_plus_#res#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_51, ~q1_back~0=v_~q1_back~0_54, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, ~total~0=v_~total~0_74} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_50, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_5|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_5|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_5|, ~total~0=v_~total~0_73, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_5|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_5|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_5|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_5|, ~q1_back~0=v_~q1_back~0_54, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][239], [33#L98true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 84#L116true, 133#L146-1true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 840#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 866#true, 393#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), 195#thread1EXITtrue, Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:08,836 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,836 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 17:33:08,836 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,836 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,837 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_27| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_9| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_9|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_9|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][147], [Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 133#L146-1true, 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 840#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), 106#thread3EXITtrue, Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 866#true, 393#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), 195#thread1EXITtrue, Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:08,837 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,837 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 17:33:08,837 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,837 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,841 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L77-->L83: Formula: (and (= v_~j~0_22 (+ v_~j~0_23 1)) (= |v_thread2Thread1of1ForFork1_~cond~1#1_15| (ite (= (ite (< v_~j~0_22 v_~N~0_18) 1 0) 0) 0 1))) InVars {~j~0=v_~j~0_23, ~N~0=v_~N~0_18} OutVars{thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~j~0=v_~j~0_22, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, ~j~0, thread2Thread1of1ForFork1_#t~post6#1][276], [114#L119true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), 88#L145-4true, Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), 263#true, Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 838#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 21#L83true, 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), 393#true, Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 6#L101true, Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), 195#thread1EXITtrue, Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:08,842 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,842 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,842 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,843 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 17:33:08,963 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L77-->L83: Formula: (and (= v_~j~0_22 (+ v_~j~0_23 1)) (= |v_thread2Thread1of1ForFork1_~cond~1#1_15| (ite (= (ite (< v_~j~0_22 v_~N~0_18) 1 0) 0) 0 1))) InVars {~j~0=v_~j~0_23, ~N~0=v_~N~0_18} OutVars{thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~j~0=v_~j~0_22, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, ~j~0, thread2Thread1of1ForFork1_#t~post6#1][276], [114#L119true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 133#L146-1true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 838#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), 138#L62true, Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 21#L83true, 866#true, 393#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 6#L101true, Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:08,963 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,963 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 17:33:08,963 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:08,964 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:09,302 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L77-->L83: Formula: (and (= v_~j~0_22 (+ v_~j~0_23 1)) (= |v_thread2Thread1of1ForFork1_~cond~1#1_15| (ite (= (ite (< v_~j~0_22 v_~N~0_18) 1 0) 0) 0 1))) InVars {~j~0=v_~j~0_23, ~N~0=v_~N~0_18} OutVars{thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~j~0=v_~j~0_22, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, ~j~0, thread2Thread1of1ForFork1_#t~post6#1][276], [523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), 114#L119true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 133#L146-1true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 838#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 21#L83true, 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 393#true, 6#L101true, Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 146#L56true, 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:09,302 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 17:33:09,302 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:09,302 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:33:09,302 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:33:09,365 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L77-->L83: Formula: (and (= v_~j~0_22 (+ v_~j~0_23 1)) (= |v_thread2Thread1of1ForFork1_~cond~1#1_15| (ite (= (ite (< v_~j~0_22 v_~N~0_18) 1 0) 0) 0 1))) InVars {~j~0=v_~j~0_23, ~N~0=v_~N~0_18} OutVars{thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~j~0=v_~j~0_22, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, ~j~0, thread2Thread1of1ForFork1_#t~post6#1][276], [114#L119true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 133#L146-1true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), 263#true, Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 838#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 21#L83true, 866#true, 393#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 6#L101true, Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), 195#thread1EXITtrue, Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:09,365 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 17:33:09,366 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:33:09,366 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:09,366 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:33:09,367 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([876] L101-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= v_~total~0_74 |v_thread3Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (not (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_11| 256) 0)) (= |v_thread3Thread1of1ForFork2_plus_#res#1_5| .cse0) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|) (= (+ v_~q1_front~0_51 1) v_~q1_front~0_50) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_5| |v_thread3Thread1of1ForFork2_plus_~a#1_5|) (= (select (select |v_#memory_int_71| v_~q1~0.base_25) (+ v_~q1~0.offset_25 (* 4 v_~q1_front~0_51))) |v_thread3Thread1of1ForFork2_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_51 v_~n1~0_22) (<= 0 v_~q1_front~0_51) (< v_~q1_front~0_51 v_~q1_back~0_54)) 1 0) 0)) (= v_~total~0_73 |v_thread3Thread1of1ForFork2_plus_#res#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_51, ~q1_back~0=v_~q1_back~0_54, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, ~total~0=v_~total~0_74} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_50, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_5|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_5|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_5|, ~total~0=v_~total~0_73, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_5|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_5|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_5|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_5|, ~q1_back~0=v_~q1_back~0_54, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][239], [33#L98true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 840#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 866#true, 393#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), 200#L146-2true, Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:09,367 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 17:33:09,367 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:33:09,367 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:09,367 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:33:09,368 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_27| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_9| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_9|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_9|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][147], [Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 840#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), 106#thread3EXITtrue, Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), 393#true, Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), 200#L146-2true, Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:09,368 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-11-25 17:33:09,368 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:33:09,368 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:09,368 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:33:09,535 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L77-->L83: Formula: (and (= v_~j~0_22 (+ v_~j~0_23 1)) (= |v_thread2Thread1of1ForFork1_~cond~1#1_15| (ite (= (ite (< v_~j~0_22 v_~N~0_18) 1 0) 0) 0 1))) InVars {~j~0=v_~j~0_23, ~N~0=v_~N~0_18} OutVars{thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~j~0=v_~j~0_22, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, ~j~0, thread2Thread1of1ForFork1_#t~post6#1][276], [114#L119true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), 263#true, Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), 838#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 21#L83true, 866#true, 393#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), 6#L101true, Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), 200#L146-2true, Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:09,535 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 17:33:09,535 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:33:09,535 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:33:09,535 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:09,940 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([876] L101-->L98: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|))) (and (<= |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483647) (= v_~total~0_74 |v_thread3Thread1of1ForFork2_plus_#in~a#1_5|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_5| 0)) 1 0)) (not (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_11| 256) 0)) (= |v_thread3Thread1of1ForFork2_plus_#res#1_5| .cse0) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_5| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_5| |v_thread3Thread1of1ForFork2_plus_~b#1_5|) (= (+ v_~q1_front~0_51 1) v_~q1_front~0_50) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_5| |v_thread3Thread1of1ForFork2_plus_~a#1_5|) (= (select (select |v_#memory_int_71| v_~q1~0.base_25) (+ v_~q1~0.offset_25 (* 4 v_~q1_front~0_51))) |v_thread3Thread1of1ForFork2_plus_#in~b#1_5|) (not (= (ite (and (< v_~q1_front~0_51 v_~n1~0_22) (<= 0 v_~q1_front~0_51) (< v_~q1_front~0_51 v_~q1_back~0_54)) 1 0) 0)) (= v_~total~0_73 |v_thread3Thread1of1ForFork2_plus_#res#1_5|))) InVars {~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_51, ~q1_back~0=v_~q1_back~0_54, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, ~total~0=v_~total~0_74} OutVars{thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_5|, ~q1~0.offset=v_~q1~0.offset_25, ~q1_front~0=v_~q1_front~0_50, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_5|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_5|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_11|, thread3Thread1of1ForFork2_#t~mem7#1=|v_thread3Thread1of1ForFork2_#t~mem7#1_5|, ~total~0=v_~total~0_73, thread3Thread1of1ForFork2_#t~ret8#1=|v_thread3Thread1of1ForFork2_#t~ret8#1_5|, thread3Thread1of1ForFork2_#t~post9#1=|v_thread3Thread1of1ForFork2_#t~post9#1_5|, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_5|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_5|, ~q1_back~0=v_~q1_back~0_54, ~q1~0.base=v_~q1~0.base_25, #memory_int=|v_#memory_int_71|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_#t~ret8#1, thread3Thread1of1ForFork2_#t~post9#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~mem7#1, ~total~0][239], [33#L98true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), 63#L147-1true, Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 840#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 866#true, 393#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:09,940 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 17:33:09,940 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:33:09,941 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:33:09,941 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:09,941 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L101-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res#1.base_9| 0) (= (mod |v_thread3Thread1of1ForFork2_~cond~2#1_27| 256) 0) (= |v_thread3Thread1of1ForFork2_#res#1.offset_9| 0)) InVars {thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} OutVars{thread3Thread1of1ForFork2_#res#1.offset=|v_thread3Thread1of1ForFork2_#res#1.offset_9|, thread3Thread1of1ForFork2_#res#1.base=|v_thread3Thread1of1ForFork2_#res#1.base_9|, thread3Thread1of1ForFork2_~cond~2#1=|v_thread3Thread1of1ForFork2_~cond~2#1_27|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res#1.offset, thread3Thread1of1ForFork2_#res#1.base][147], [Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), 63#L147-1true, Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 840#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), 106#thread3EXITtrue, Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 866#true, 393#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:09,941 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 17:33:09,941 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:33:09,941 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:33:09,941 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:09,960 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([909] L77-->L83: Formula: (and (= v_~j~0_22 (+ v_~j~0_23 1)) (= |v_thread2Thread1of1ForFork1_~cond~1#1_15| (ite (= (ite (< v_~j~0_22 v_~N~0_18) 1 0) 0) 0 1))) InVars {~j~0=v_~j~0_23, ~N~0=v_~N~0_18} OutVars{thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~j~0=v_~j~0_22, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, ~j~0, thread2Thread1of1ForFork1_#t~post6#1][276], [114#L119true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), 263#true, Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 838#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 21#L83true, 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), 393#true, Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 6#L101true, Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), 200#L146-2true, Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:09,960 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-11-25 17:33:09,960 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:33:09,960 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:33:09,961 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:33:09,961 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 17:33:10,025 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L77-->L83: Formula: (and (= v_~j~0_22 (+ v_~j~0_23 1)) (= |v_thread2Thread1of1ForFork1_~cond~1#1_15| (ite (= (ite (< v_~j~0_22 v_~N~0_18) 1 0) 0) 0 1))) InVars {~j~0=v_~j~0_23, ~N~0=v_~N~0_18} OutVars{thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~j~0=v_~j~0_22, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, ~j~0, thread2Thread1of1ForFork1_#t~post6#1][276], [114#L119true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 63#L147-1true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), 263#true, Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), 838#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 21#L83true, 866#true, 393#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 6#L101true, Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:10,026 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 17:33:10,026 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:33:10,026 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:33:10,026 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:33:10,116 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([909] L77-->L83: Formula: (and (= v_~j~0_22 (+ v_~j~0_23 1)) (= |v_thread2Thread1of1ForFork1_~cond~1#1_15| (ite (= (ite (< v_~j~0_22 v_~N~0_18) 1 0) 0) 0 1))) InVars {~j~0=v_~j~0_23, ~N~0=v_~N~0_18} OutVars{thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~j~0=v_~j~0_22, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, ~j~0, thread2Thread1of1ForFork1_#t~post6#1][276], [114#L119true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), 63#L147-1true, Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), 263#true, Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 838#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 21#L83true, 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), 393#true, Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 6#L101true, Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:10,117 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 17:33:10,117 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 17:33:10,117 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:33:10,117 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:33:10,117 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 17:33:10,208 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L77-->L83: Formula: (and (= v_~j~0_22 (+ v_~j~0_23 1)) (= |v_thread2Thread1of1ForFork1_~cond~1#1_15| (ite (= (ite (< v_~j~0_22 v_~N~0_18) 1 0) 0) 0 1))) InVars {~j~0=v_~j~0_23, ~N~0=v_~N~0_18} OutVars{thread2Thread1of1ForFork1_~cond~1#1=|v_thread2Thread1of1ForFork1_~cond~1#1_15|, ~j~0=v_~j~0_22, ~N~0=v_~N~0_18, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~1#1, ~j~0, thread2Thread1of1ForFork1_#t~post6#1][276], [114#L119true, Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), 63#L147-1true, Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), 263#true, Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 106#thread3EXITtrue, Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 838#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (= |thread4Thread1of1ForFork0_~cond~3#1| 1)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 21#L83true, 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), 393#true, Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:10,208 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-11-25 17:33:10,209 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:33:10,209 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:33:10,209 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:33:10,209 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([932] L119-->L116: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_5| |v_thread4Thread1of1ForFork0_plus_~b#1_5|))) (and (= |v_thread4Thread1of1ForFork0_plus_#in~a#1_5| v_~total~0_82) (= |v_thread4Thread1of1ForFork0_plus_#in~b#1_5| (select (select |v_#memory_int_101| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_67)))) (= |v_thread4Thread1of1ForFork0_plus_~a#1_5| |v_thread4Thread1of1ForFork0_plus_#in~a#1_5|) (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_~b#1_5| 0) (<= .cse0 2147483647)) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= (+ v_~q2_front~0_67 1) v_~q2_front~0_66) (= |v_thread4Thread1of1ForFork0_plus_#res#1_5| .cse0) (<= 0 (+ v_~total~0_81 2147483648)) (not (= (mod |v_thread4Thread1of1ForFork0_~cond~3#1_15| 256) 0)) (<= v_~total~0_81 2147483647) (= v_~total~0_81 |v_thread4Thread1of1ForFork0_plus_#res#1_5|) (= |v_thread4Thread1of1ForFork0_plus_~b#1_5| |v_thread4Thread1of1ForFork0_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (not (= (ite (and (< v_~q2_front~0_67 v_~n2~0_36) (< v_~q2_front~0_67 v_~q2_back~0_74) (<= 0 v_~q2_front~0_67)) 1 0) 0)))) InVars {thread4Thread1of1ForFork0_~cond~3#1=|v_thread4Thread1of1ForFork0_~cond~3#1_15|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_101|, ~q2_front~0=v_~q2_front~0_67, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_74, ~total~0=v_~total~0_82} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_5|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_43, ~q2_front~0=v_~q2_front~0_66, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_5|, thread4Thread1of1ForFork0_#t~mem10#1=|v_thread4Thread1of1ForFork0_#t~mem10#1_5|, ~total~0=v_~total~0_81, thread4Thread1of1ForFork0_#t~post12#1=|v_thread4Thread1of1ForFork0_#t~post12#1_5|, thread4Thread1of1ForFork0_~cond~3#1=|v_thread4Thread1of1ForFork0_~cond~3#1_15|, thread4Thread1of1ForFork0_#t~ret11#1=|v_thread4Thread1of1ForFork0_#t~ret11#1_5|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_5|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #memory_int=|v_#memory_int_101|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_5|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_74} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#t~post12#1, thread4Thread1of1ForFork0_#t~ret11#1, thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork0_#t~mem10#1, ~total~0][331], [Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), 63#L147-1true, Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 84#L116true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), 263#true, Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 106#thread3EXITtrue, Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), 393#true, Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), 848#true, 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), 836#(and (= |thread4Thread1of1ForFork0_~cond~3#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:10,209 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-11-25 17:33:10,209 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:33:10,209 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:33:10,209 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 17:33:10,401 INFO L130 PetriNetUnfolder]: 34607/50357 cut-off events. [2022-11-25 17:33:10,401 INFO L131 PetriNetUnfolder]: For 309278/312592 co-relation queries the response was YES. [2022-11-25 17:33:10,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257483 conditions, 50357 events. 34607/50357 cut-off events. For 309278/312592 co-relation queries the response was YES. Maximal size of possible extension queue 2425. Compared 361389 event pairs, 5555 based on Foata normal form. 2212/50926 useless extension candidates. Maximal degree in co-relation 246301. Up to 36829 conditions per place. [2022-11-25 17:33:10,873 INFO L137 encePairwiseOnDemand]: 434/441 looper letters, 207 selfloop transitions, 186 changer transitions 17/432 dead transitions. [2022-11-25 17:33:10,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 432 transitions, 5590 flow [2022-11-25 17:33:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:33:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:33:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1481 transitions. [2022-11-25 17:33:10,879 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47975380628441855 [2022-11-25 17:33:10,879 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1481 transitions. [2022-11-25 17:33:10,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1481 transitions. [2022-11-25 17:33:10,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:33:10,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1481 transitions. [2022-11-25 17:33:10,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 211.57142857142858) internal successors, (1481), 7 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:33:10,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 441.0) internal successors, (3528), 8 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:33:10,888 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 441.0) internal successors, (3528), 8 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:33:10,889 INFO L175 Difference]: Start difference. First operand has 116 places, 210 transitions, 2403 flow. Second operand 7 states and 1481 transitions. [2022-11-25 17:33:10,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 432 transitions, 5590 flow [2022-11-25 17:33:17,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 432 transitions, 5458 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-11-25 17:33:17,497 INFO L231 Difference]: Finished difference. Result has 124 places, 308 transitions, 4397 flow [2022-11-25 17:33:17,497 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=2337, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4397, PETRI_PLACES=124, PETRI_TRANSITIONS=308} [2022-11-25 17:33:17,498 INFO L288 CegarLoopForPetriNet]: 44 programPoint places, 80 predicate places. [2022-11-25 17:33:17,498 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 308 transitions, 4397 flow [2022-11-25 17:33:17,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.83333333333334) internal successors, (1193), 6 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:33:17,499 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:33:17,499 INFO L209 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] [2022-11-25 17:33:17,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:33:17,499 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)] === [2022-11-25 17:33:17,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:33:17,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1038744414, now seen corresponding path program 8 times [2022-11-25 17:33:17,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:33:17,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358642823] [2022-11-25 17:33:17,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:33:17,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:33:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:33:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:33:18,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:33:18,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358642823] [2022-11-25 17:33:18,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358642823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:33:18,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:33:18,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:33:18,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584683932] [2022-11-25 17:33:18,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:33:18,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:33:18,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:33:18,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:33:18,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:33:18,152 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 441 [2022-11-25 17:33:18,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 308 transitions, 4397 flow. Second operand has 7 states, 7 states have (on average 194.28571428571428) internal successors, (1360), 7 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:33:18,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:33:18,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 441 [2022-11-25 17:33:18,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:33:26,142 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1016] L119-->thread4EXIT: Formula: (and (= (mod |v_thread4Thread1of1ForFork0_~cond~3#1_23| 256) 0) (= |v_thread4Thread1of1ForFork0_#res#1.offset_9| 0) (= |v_thread4Thread1of1ForFork0_#res#1.base_9| 0)) InVars {thread4Thread1of1ForFork0_~cond~3#1=|v_thread4Thread1of1ForFork0_~cond~3#1_23|} OutVars{thread4Thread1of1ForFork0_#res#1.base=|v_thread4Thread1of1ForFork0_#res#1.base_9|, thread4Thread1of1ForFork0_~cond~3#1=|v_thread4Thread1of1ForFork0_~cond~3#1_23|, thread4Thread1of1ForFork0_#res#1.offset=|v_thread4Thread1of1ForFork0_#res#1.offset_9|} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#res#1.base, thread4Thread1of1ForFork0_#res#1.offset][217], [Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), 88#L145-4true, Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 561#(or (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (< ~i~0 ~N~0)), Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), 263#true, Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 138#L62true, 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 23#thread4EXITtrue, Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 393#true, Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), Black: 231#(= ~total~0 0), 6#L101true, 117#thread2EXITtrue, Black: 236#(= ~q1_back~0 ~q1_front~0), Black: 868#(and (= ~j~0 0) (= ~i~0 0)), Black: 873#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~N~0 0) (and (<= (div |thread1Thread1of1ForFork3_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork3_~cond~0#1|)))), Black: 877#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 875#(and (or (= |thread2Thread1of1ForFork1_~cond~1#1| 0) (and (<= (div |thread1Thread1of1ForFork3_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork3_~cond~0#1|))) (= ~j~0 0) (= ~i~0 0) (or (<= ~N~0 0) (and (<= (div |thread1Thread1of1ForFork3_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork3_~cond~0#1|)))), 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 883#true]) [2022-11-25 17:33:26,143 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 17:33:26,143 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:26,143 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:26,143 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:26,143 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([932] L119-->L116: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork0_plus_~a#1_5| |v_thread4Thread1of1ForFork0_plus_~b#1_5|))) (and (= |v_thread4Thread1of1ForFork0_plus_#in~a#1_5| v_~total~0_82) (= |v_thread4Thread1of1ForFork0_plus_#in~b#1_5| (select (select |v_#memory_int_101| v_~q2~0.base_43) (+ v_~q2~0.offset_43 (* 4 v_~q2_front~0_67)))) (= |v_thread4Thread1of1ForFork0_plus_~a#1_5| |v_thread4Thread1of1ForFork0_plus_#in~a#1_5|) (= (ite (or (<= |v_thread4Thread1of1ForFork0_plus_~b#1_5| 0) (<= .cse0 2147483647)) 1 0) |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= (+ v_~q2_front~0_67 1) v_~q2_front~0_66) (= |v_thread4Thread1of1ForFork0_plus_#res#1_5| .cse0) (<= 0 (+ v_~total~0_81 2147483648)) (not (= (mod |v_thread4Thread1of1ForFork0_~cond~3#1_15| 256) 0)) (<= v_~total~0_81 2147483647) (= v_~total~0_81 |v_thread4Thread1of1ForFork0_plus_#res#1_5|) (= |v_thread4Thread1of1ForFork0_plus_~b#1_5| |v_thread4Thread1of1ForFork0_plus_#in~b#1_5|) (= |v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| |v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (not (= (ite (and (< v_~q2_front~0_67 v_~n2~0_36) (< v_~q2_front~0_67 v_~q2_back~0_74) (<= 0 v_~q2_front~0_67)) 1 0) 0)))) InVars {thread4Thread1of1ForFork0_~cond~3#1=|v_thread4Thread1of1ForFork0_~cond~3#1_15|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_43, #memory_int=|v_#memory_int_101|, ~q2_front~0=v_~q2_front~0_67, ~q2~0.base=v_~q2~0.base_43, ~q2_back~0=v_~q2_back~0_74, ~total~0=v_~total~0_82} OutVars{thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_5|, ~n2~0=v_~n2~0_36, ~q2~0.offset=v_~q2~0.offset_43, ~q2_front~0=v_~q2_front~0_66, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_5|, thread4Thread1of1ForFork0_#t~mem10#1=|v_thread4Thread1of1ForFork0_#t~mem10#1_5|, ~total~0=v_~total~0_81, thread4Thread1of1ForFork0_#t~post12#1=|v_thread4Thread1of1ForFork0_#t~post12#1_5|, thread4Thread1of1ForFork0_~cond~3#1=|v_thread4Thread1of1ForFork0_~cond~3#1_15|, thread4Thread1of1ForFork0_#t~ret11#1=|v_thread4Thread1of1ForFork0_#t~ret11#1_5|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_5|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, #memory_int=|v_#memory_int_101|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_5|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_5|, ~q2~0.base=v_~q2~0.base_43, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~q2_back~0=v_~q2_back~0_74} AuxVars[] AssignedVars[thread4Thread1of1ForFork0_#t~post12#1, thread4Thread1of1ForFork0_#t~ret11#1, thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, ~q2_front~0, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork0_#t~mem10#1, ~total~0][350], [Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 384#(and (<= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 0))) (<= 0 ~j~0)), Black: 256#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 386#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0)), Black: 388#(and (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1)) (<= ~i~0 0) (<= 0 ~j~0) (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 84#L116true, 561#(or (= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0) (< ~i~0 ~N~0)), 842#(and (not (<= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 265#(and (= ~j~0 0) (= ~i~0 0)), Black: 268#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 274#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 272#(and (<= (+ ~j~0 1) ~N~0) (= ~j~0 0) (= ~i~0 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 270#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), 138#L62true, 6#L101true, 117#thread2EXITtrue, 883#true, 88#L145-4true, Black: 832#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0)))), Black: 772#(or (not (< ~q2_front~0 ~q2_back~0)) (not (<= 0 ~q2_front~0)) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (not (<= ~N~0 ~j~0))), 263#true, Black: 834#(and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (<= 1 ~q2_back~0) (not (<= ~N~0 ~j~0))), Black: 636#(or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))), 866#true, Black: 859#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 523#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 852#(and (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (<= |thread2Thread1of1ForFork1_~cond~1#1| (* (div |thread2Thread1of1ForFork1_~cond~1#1| 256) 256)))), Black: 598#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0)), Black: 853#(and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 600#(and (< ~i~0 (+ ~j~0 1)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 857#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 393#true, Black: 855#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 231#(= ~total~0 0), Black: 236#(= ~q1_back~0 ~q1_front~0), Black: 868#(and (= ~j~0 0) (= ~i~0 0)), Black: 873#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~N~0 0) (and (<= (div |thread1Thread1of1ForFork3_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork3_~cond~0#1|)))), Black: 877#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 875#(and (or (= |thread2Thread1of1ForFork1_~cond~1#1| 0) (and (<= (div |thread1Thread1of1ForFork3_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork3_~cond~0#1|))) (= ~j~0 0) (= ~i~0 0) (or (<= ~N~0 0) (and (<= (div |thread1Thread1of1ForFork3_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork3_~cond~0#1|)))), 610#true, Black: 623#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= ~N~0 0)), Black: 241#(<= ~q2_back~0 ~q2_front~0), Black: 617#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)) (or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0)))), Black: 612#(or (and (= ~j~0 0) (= ~i~0 0)) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))), Black: 613#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (and (= ~j~0 0) (<= ~N~0 0)) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|))), Black: 619#(and (= ~j~0 0) (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (or (= ~i~0 0) (not (<= ~q1_back~0 ~q1_front~0)) (not (<= ~N~0 ~i~0))) (<= ~N~0 0)), Black: 247#(<= ~n1~0 0), Black: 249#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 246#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0))]) [2022-11-25 17:33:26,143 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-11-25 17:33:26,144 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:26,144 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-11-25 17:33:26,144 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event