./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 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_8b5a2107-e857-476e-a4f9-f52f63e40a4b/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5a2107-e857-476e-a4f9-f52f63e40a4b/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5a2107-e857-476e-a4f9-f52f63e40a4b/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5a2107-e857-476e-a4f9-f52f63e40a4b/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5a2107-e857-476e-a4f9-f52f63e40a4b/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5a2107-e857-476e-a4f9-f52f63e40a4b/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6b55d0b1c42ab7aaefa2efb35454af77e64d43e1c106bfebef7445a043c9409 --- 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-2329fc7 [2022-12-13 13:41:02,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:41:02,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:41:02,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:41:02,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:41:02,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:41:02,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:41:02,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:41:02,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:41:02,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:41:02,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:41:02,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:41:02,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:41:02,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:41:02,593 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:41:02,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:41:02,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:41:02,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:41:02,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:41:02,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:41:02,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:41:02,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:41:02,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:41:02,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:41:02,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:41:02,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:41:02,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:41:02,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:41:02,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:41:02,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:41:02,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:41:02,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:41:02,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:41:02,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:41:02,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:41:02,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:41:02,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:41:02,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:41:02,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:41:02,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:41:02,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:41:02,609 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5a2107-e857-476e-a4f9-f52f63e40a4b/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-12-13 13:41:02,623 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:41:02,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:41:02,623 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:41:02,623 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:41:02,623 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:41:02,624 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:41:02,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:41:02,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:41:02,624 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:41:02,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:41:02,625 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:41:02,625 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:41:02,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:41:02,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:41:02,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:41:02,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:41:02,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:41:02,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:41:02,625 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 13:41:02,625 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:41:02,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:41:02,626 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:41:02,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:41:02,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:41:02,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:41:02,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:41:02,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:41:02,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:41:02,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:41:02,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:41:02,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:41:02,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:41:02,627 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:41:02,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:41:02,627 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:41:02,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:41:02,627 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:41:02,627 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_8b5a2107-e857-476e-a4f9-f52f63e40a4b/bin/uautomizer-uyxdKDjOR8/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_8b5a2107-e857-476e-a4f9-f52f63e40a4b/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6b55d0b1c42ab7aaefa2efb35454af77e64d43e1c106bfebef7445a043c9409 [2022-12-13 13:41:02,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:41:02,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:41:02,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:41:02,821 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:41:02,821 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:41:02,822 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5a2107-e857-476e-a4f9-f52f63e40a4b/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c [2022-12-13 13:41:05,506 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:41:05,684 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:41:05,685 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5a2107-e857-476e-a4f9-f52f63e40a4b/sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c [2022-12-13 13:41:05,691 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5a2107-e857-476e-a4f9-f52f63e40a4b/bin/uautomizer-uyxdKDjOR8/data/fb268fab7/147c60c783eb4d67a2268d4d11984543/FLAGec07049b2 [2022-12-13 13:41:05,702 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5a2107-e857-476e-a4f9-f52f63e40a4b/bin/uautomizer-uyxdKDjOR8/data/fb268fab7/147c60c783eb4d67a2268d4d11984543 [2022-12-13 13:41:05,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:41:05,705 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:41:05,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:41:05,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:41:05,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:41:05,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:41:05" (1/1) ... [2022-12-13 13:41:05,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa5caeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:05, skipping insertion in model container [2022-12-13 13:41:05,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:41:05" (1/1) ... [2022-12-13 13:41:05,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:41:05,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:41:05,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,840 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,844 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,870 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_8b5a2107-e857-476e-a4f9-f52f63e40a4b/sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c[5426,5439] [2022-12-13 13:41:05,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:41:05,878 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:41:05,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:41:05,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:41:05,907 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_8b5a2107-e857-476e-a4f9-f52f63e40a4b/sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c[5426,5439] [2022-12-13 13:41:05,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:41:05,918 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:41:05,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:05 WrapperNode [2022-12-13 13:41:05,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:41:05,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:41:05,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:41:05,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:41:05,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:05" (1/1) ... [2022-12-13 13:41:05,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:05" (1/1) ... [2022-12-13 13:41:05,950 INFO L138 Inliner]: procedures = 22, calls = 110, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 267 [2022-12-13 13:41:05,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:41:05,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:41:05,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:41:05,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:41:05,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:05" (1/1) ... [2022-12-13 13:41:05,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:05" (1/1) ... [2022-12-13 13:41:05,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:05" (1/1) ... [2022-12-13 13:41:05,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:05" (1/1) ... [2022-12-13 13:41:05,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:05" (1/1) ... [2022-12-13 13:41:05,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:05" (1/1) ... [2022-12-13 13:41:05,973 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:05" (1/1) ... [2022-12-13 13:41:05,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:05" (1/1) ... [2022-12-13 13:41:05,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:41:05,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:41:05,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:41:05,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:41:05,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:05" (1/1) ... [2022-12-13 13:41:05,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:41:05,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5a2107-e857-476e-a4f9-f52f63e40a4b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:41:06,003 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5a2107-e857-476e-a4f9-f52f63e40a4b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:41:06,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b5a2107-e857-476e-a4f9-f52f63e40a4b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:41:06,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:41:06,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 13:41:06,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 13:41:06,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 13:41:06,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 13:41:06,032 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 13:41:06,032 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 13:41:06,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:41:06,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:41:06,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:41:06,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:41:06,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:41:06,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:41:06,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:41:06,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:41:06,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:41:06,034 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 13:41:06,117 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:41:06,119 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:41:06,403 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:41:06,531 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:41:06,531 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 13:41:06,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:41:06 BoogieIcfgContainer [2022-12-13 13:41:06,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:41:06,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:41:06,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:41:06,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:41:06,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:41:05" (1/3) ... [2022-12-13 13:41:06,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d71dab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:41:06, skipping insertion in model container [2022-12-13 13:41:06,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:41:05" (2/3) ... [2022-12-13 13:41:06,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d71dab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:41:06, skipping insertion in model container [2022-12-13 13:41:06,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:41:06" (3/3) ... [2022-12-13 13:41:06,542 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2022-12-13 13:41:06,550 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 13:41:06,559 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:41:06,559 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-12-13 13:41:06,559 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:41:06,624 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 13:41:06,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 163 transitions, 350 flow [2022-12-13 13:41:06,740 INFO L130 PetriNetUnfolder]: 2/160 cut-off events. [2022-12-13 13:41:06,741 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 13:41:06,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 160 events. 2/160 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 158 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-13 13:41:06,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 163 transitions, 350 flow [2022-12-13 13:41:06,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 139 transitions, 293 flow [2022-12-13 13:41:06,754 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 13:41:06,764 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 139 transitions, 293 flow [2022-12-13 13:41:06,766 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 139 transitions, 293 flow [2022-12-13 13:41:06,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 139 transitions, 293 flow [2022-12-13 13:41:06,794 INFO L130 PetriNetUnfolder]: 1/139 cut-off events. [2022-12-13 13:41:06,794 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:41:06,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 139 events. 1/139 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 156 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-13 13:41:06,796 INFO L119 LiptonReduction]: Number of co-enabled transitions 3240 [2022-12-13 13:41:10,031 INFO L134 LiptonReduction]: Checked pairs total: 34046 [2022-12-13 13:41:10,032 INFO L136 LiptonReduction]: Total number of compositions: 98 [2022-12-13 13:41:10,041 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:41:10,045 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;@4f69be7f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:41:10,045 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-12-13 13:41:10,048 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-13 13:41:10,048 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:41:10,048 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:10,048 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 13:41:10,049 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:10,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:10,052 INFO L85 PathProgramCache]: Analyzing trace with hash 742979697, now seen corresponding path program 1 times [2022-12-13 13:41:10,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:10,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842994871] [2022-12-13 13:41:10,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:10,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:10,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:10,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842994871] [2022-12-13 13:41:10,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842994871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:10,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:10,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:41:10,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930242680] [2022-12-13 13:41:10,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:10,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:10,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:10,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:10,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:10,371 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 261 [2022-12-13 13:41:10,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:10,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:10,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 261 [2022-12-13 13:41:10,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:11,388 INFO L130 PetriNetUnfolder]: 6850/10517 cut-off events. [2022-12-13 13:41:11,389 INFO L131 PetriNetUnfolder]: For 366/366 co-relation queries the response was YES. [2022-12-13 13:41:11,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20961 conditions, 10517 events. 6850/10517 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 69402 event pairs, 6850 based on Foata normal form. 0/9547 useless extension candidates. Maximal degree in co-relation 19370. Up to 10041 conditions per place. [2022-12-13 13:41:11,464 INFO L137 encePairwiseOnDemand]: 257/261 looper letters, 40 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2022-12-13 13:41:11,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 56 transitions, 209 flow [2022-12-13 13:41:11,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:41:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-12-13 13:41:11,475 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5312899106002554 [2022-12-13 13:41:11,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2022-12-13 13:41:11,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2022-12-13 13:41:11,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:41:11,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2022-12-13 13:41:11,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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-12-13 13:41:11,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 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-12-13 13:41:11,486 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 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-12-13 13:41:11,488 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 133 flow. Second operand 3 states and 416 transitions. [2022-12-13 13:41:11,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 56 transitions, 209 flow [2022-12-13 13:41:11,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 56 transitions, 200 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-13 13:41:11,497 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 120 flow [2022-12-13 13:41:11,499 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2022-12-13 13:41:11,501 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, -6 predicate places. [2022-12-13 13:41:11,501 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 120 flow [2022-12-13 13:41:11,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:11,502 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:11,502 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 13:41:11,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:41:11,502 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:11,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:11,503 INFO L85 PathProgramCache]: Analyzing trace with hash 742979698, now seen corresponding path program 1 times [2022-12-13 13:41:11,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:11,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095975261] [2022-12-13 13:41:11,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:11,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:11,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:11,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:11,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095975261] [2022-12-13 13:41:11,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095975261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:11,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:11,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:41:11,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810089637] [2022-12-13 13:41:11,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:11,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:41:11,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:11,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:41:11,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:41:11,710 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 261 [2022-12-13 13:41:11,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 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-12-13 13:41:11,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:11,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 261 [2022-12-13 13:41:11,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:12,577 INFO L130 PetriNetUnfolder]: 8202/12634 cut-off events. [2022-12-13 13:41:12,578 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2022-12-13 13:41:12,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24905 conditions, 12634 events. 8202/12634 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 82407 event pairs, 4529 based on Foata normal form. 70/11425 useless extension candidates. Maximal degree in co-relation 24899. Up to 11766 conditions per place. [2022-12-13 13:41:12,625 INFO L137 encePairwiseOnDemand]: 251/261 looper letters, 59 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2022-12-13 13:41:12,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 315 flow [2022-12-13 13:41:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:41:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:41:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2022-12-13 13:41:12,628 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5296934865900383 [2022-12-13 13:41:12,628 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 553 transitions. [2022-12-13 13:41:12,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 553 transitions. [2022-12-13 13:41:12,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:41:12,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 553 transitions. [2022-12-13 13:41:12,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 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-12-13 13:41:12,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 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-12-13 13:41:12,631 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 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-12-13 13:41:12,632 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 120 flow. Second operand 4 states and 553 transitions. [2022-12-13 13:41:12,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 315 flow [2022-12-13 13:41:12,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 82 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:41:12,633 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 191 flow [2022-12-13 13:41:12,633 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2022-12-13 13:41:12,634 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, -2 predicate places. [2022-12-13 13:41:12,634 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 191 flow [2022-12-13 13:41:12,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 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-12-13 13:41:12,634 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:12,634 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:12,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:41:12,635 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:12,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:12,635 INFO L85 PathProgramCache]: Analyzing trace with hash 384549021, now seen corresponding path program 1 times [2022-12-13 13:41:12,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:12,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556767109] [2022-12-13 13:41:12,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:12,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:12,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:12,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556767109] [2022-12-13 13:41:12,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556767109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:12,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:12,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:12,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511044727] [2022-12-13 13:41:12,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:12,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:12,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:12,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:12,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:12,866 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 261 [2022-12-13 13:41:12,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:12,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:12,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 261 [2022-12-13 13:41:12,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:13,889 INFO L130 PetriNetUnfolder]: 9521/14671 cut-off events. [2022-12-13 13:41:13,889 INFO L131 PetriNetUnfolder]: For 3696/3810 co-relation queries the response was YES. [2022-12-13 13:41:13,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32640 conditions, 14671 events. 9521/14671 cut-off events. For 3696/3810 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 94187 event pairs, 3273 based on Foata normal form. 244/13780 useless extension candidates. Maximal degree in co-relation 32631. Up to 13394 conditions per place. [2022-12-13 13:41:13,934 INFO L137 encePairwiseOnDemand]: 251/261 looper letters, 84 selfloop transitions, 13 changer transitions 0/110 dead transitions. [2022-12-13 13:41:13,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 110 transitions, 504 flow [2022-12-13 13:41:13,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:41:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:41:13,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2022-12-13 13:41:13,936 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5126436781609195 [2022-12-13 13:41:13,937 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2022-12-13 13:41:13,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2022-12-13 13:41:13,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:41:13,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2022-12-13 13:41:13,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 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-12-13 13:41:13,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 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-12-13 13:41:13,942 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 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-12-13 13:41:13,942 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 191 flow. Second operand 5 states and 669 transitions. [2022-12-13 13:41:13,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 110 transitions, 504 flow [2022-12-13 13:41:13,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 110 transitions, 504 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 13:41:13,948 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 296 flow [2022-12-13 13:41:13,948 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2022-12-13 13:41:13,949 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places. [2022-12-13 13:41:13,949 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 296 flow [2022-12-13 13:41:13,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:13,950 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:13,950 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:13,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:41:13,950 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:13,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:13,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1379896411, now seen corresponding path program 1 times [2022-12-13 13:41:13,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:13,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758046490] [2022-12-13 13:41:13,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:13,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:14,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:14,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758046490] [2022-12-13 13:41:14,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758046490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:14,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:14,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:14,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546516936] [2022-12-13 13:41:14,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:14,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:14,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:14,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:14,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:14,204 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 261 [2022-12-13 13:41:14,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 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-12-13 13:41:14,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:14,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 261 [2022-12-13 13:41:14,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:15,351 INFO L130 PetriNetUnfolder]: 11393/17497 cut-off events. [2022-12-13 13:41:15,351 INFO L131 PetriNetUnfolder]: For 14049/14524 co-relation queries the response was YES. [2022-12-13 13:41:15,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45178 conditions, 17497 events. 11393/17497 cut-off events. For 14049/14524 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 116749 event pairs, 1488 based on Foata normal form. 209/16414 useless extension candidates. Maximal degree in co-relation 45164. Up to 13712 conditions per place. [2022-12-13 13:41:15,416 INFO L137 encePairwiseOnDemand]: 251/261 looper letters, 95 selfloop transitions, 21 changer transitions 0/129 dead transitions. [2022-12-13 13:41:15,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 129 transitions, 713 flow [2022-12-13 13:41:15,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:41:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:41:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2022-12-13 13:41:15,418 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5348659003831417 [2022-12-13 13:41:15,418 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2022-12-13 13:41:15,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2022-12-13 13:41:15,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:41:15,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2022-12-13 13:41:15,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 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-12-13 13:41:15,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 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-12-13 13:41:15,421 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 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-12-13 13:41:15,421 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 296 flow. Second operand 5 states and 698 transitions. [2022-12-13 13:41:15,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 129 transitions, 713 flow [2022-12-13 13:41:15,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 129 transitions, 695 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-12-13 13:41:15,433 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 395 flow [2022-12-13 13:41:15,433 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=395, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2022-12-13 13:41:15,433 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 10 predicate places. [2022-12-13 13:41:15,434 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 395 flow [2022-12-13 13:41:15,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 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-12-13 13:41:15,435 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:15,435 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:15,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:41:15,435 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:15,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:15,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1231391489, now seen corresponding path program 1 times [2022-12-13 13:41:15,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:15,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191159764] [2022-12-13 13:41:15,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:15,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:15,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:15,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191159764] [2022-12-13 13:41:15,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191159764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:15,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:15,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:41:15,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168889669] [2022-12-13 13:41:15,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:15,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:15,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:15,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:15,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:15,530 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 261 [2022-12-13 13:41:15,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 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-12-13 13:41:15,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:15,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 261 [2022-12-13 13:41:15,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:15,810 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 52#L190-4true, 203#(<= 0 ~i~0), 185#true, 74#L96true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:15,810 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 13:41:15,810 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 13:41:15,810 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 13:41:15,810 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 13:41:15,853 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 153#L69true, thread3Thread1of1ForFork2InUse, 203#(<= 0 ~i~0), 185#true, 194#true, 74#L96true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:15,854 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 13:41:15,854 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 13:41:15,854 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 13:41:15,854 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 13:41:15,855 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 203#(<= 0 ~i~0), 74#L96true, 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:15,855 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 13:41:15,855 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 13:41:15,855 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 13:41:15,855 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 13:41:15,903 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 52#L190-4true, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 21#L103true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:15,903 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-13 13:41:15,903 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 13:41:15,903 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 13:41:15,903 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 13:41:15,904 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 203#(<= 0 ~i~0), 185#true, 194#true, 74#L96true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:15,904 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-13 13:41:15,905 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 13:41:15,905 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 13:41:15,905 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 13:41:15,905 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 185#true, 74#L96true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:15,906 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-13 13:41:15,906 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 13:41:15,906 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 13:41:15,906 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 13:41:15,985 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, 21#L103true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:15,985 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-12-13 13:41:15,985 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:15,985 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:15,985 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:15,987 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 52#L190-4true, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 142#L106true, 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:15,987 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-12-13 13:41:15,987 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:15,987 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:15,987 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:15,988 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 21#L103true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:15,988 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-12-13 13:41:15,988 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:15,988 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:15,988 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:15,990 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 185#true, 194#true, 74#L96true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:15,990 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-12-13 13:41:15,990 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:15,990 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:15,990 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:16,057 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 176#(<= 0 ~n3~0), 142#L106true, 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,057 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,057 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,057 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,057 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,058 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, 21#L103true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,058 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,058 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,058 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,058 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,059 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 52#L190-4true, 203#(<= 0 ~i~0), 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 176#(<= 0 ~n3~0), 178#true, 23#L109true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,059 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,059 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,060 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,060 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,060 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), 142#L106true, 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,060 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,060 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,060 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,060 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,061 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 21#L103true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,061 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,061 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,062 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,062 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:16,131 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 203#(<= 0 ~i~0), 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 176#(<= 0 ~n3~0), 178#true, 23#L109true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,131 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,131 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,131 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,131 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,132 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 138#L191-1true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), 142#L106true, 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,132 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,132 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,132 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,132 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,133 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, 21#L103true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,133 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,133 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,133 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,133 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,134 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 203#(<= 0 ~i~0), 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), 178#true, 23#L109true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,134 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,134 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,134 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,134 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,135 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 52#L190-4true, 203#(<= 0 ~i~0), 27#L112true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,135 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,135 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,135 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,135 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,136 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 142#L106true, 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,136 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,136 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,136 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,136 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,137 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 97#L191-2true, 185#true, 74#L96true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,137 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,137 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,137 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,138 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:16,202 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), 23#L109true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,202 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,202 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,202 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,203 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,203 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 203#(<= 0 ~i~0), 27#L112true, 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,203 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,203 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,203 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,203 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,204 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 176#(<= 0 ~n3~0), 142#L106true, 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,204 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,204 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,204 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,204 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,205 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 23#L109true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,205 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,205 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,205 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,205 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,206 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 203#(<= 0 ~i~0), 27#L112true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,206 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,206 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,206 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,206 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,207 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 52#L190-4true, 203#(<= 0 ~i~0), 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,207 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,207 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,207 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,207 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,208 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 185#true, 74#L96true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,208 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,208 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,208 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,208 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:16,272 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 176#(<= 0 ~n3~0), 178#true, 23#L109true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,272 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,272 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,273 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,273 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,273 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 203#(<= 0 ~i~0), 27#L112true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 138#L191-1true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,273 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,273 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,274 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,274 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,274 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 138#L191-1true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,274 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,274 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,275 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,275 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,276 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 27#L112true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,276 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,276 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,276 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,276 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,277 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 203#(<= 0 ~i~0), 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,277 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,277 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,277 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,277 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,278 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 52#L190-4true, 194#true, 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,278 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,278 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,278 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,278 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,278 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][75], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 52#L190-4true, 4#L136true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,278 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,278 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,279 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,279 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,279 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 97#L191-2true, 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 21#L103true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,279 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,279 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,280 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,280 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:16,345 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 27#L112true, 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,346 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,346 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,346 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,346 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,346 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,347 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,347 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,347 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,347 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,347 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 194#true, 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 138#L191-1true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,348 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,348 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,348 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,348 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,348 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][75], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 4#L136true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 138#L191-1true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,348 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,348 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,348 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,348 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,349 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,349 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,349 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,349 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,350 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,350 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 42#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,350 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,350 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,350 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,350 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,351 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,351 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,351 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,351 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,351 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,352 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 194#true, 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,352 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,352 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,352 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,352 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,352 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][75], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 4#L136true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,352 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,353 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,353 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,353 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,353 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 194#true, 185#true, 61#L119true, 49#thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,353 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,353 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,354 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,354 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,354 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 203#(<= 0 ~i~0), 194#true, 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,354 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,354 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,354 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,355 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,356 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 21#L103true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,356 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,356 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,356 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,356 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,357 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 97#L191-2true, 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 142#L106true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,357 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,357 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,357 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,357 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:16,411 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][75], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 4#L136true, 194#true, 185#true, 49#thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,411 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is not cut-off event [2022-12-13 13:41:16,411 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2022-12-13 13:41:16,412 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2022-12-13 13:41:16,412 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2022-12-13 13:41:16,412 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][118], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 203#(<= 0 ~i~0), 4#L136true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,412 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is not cut-off event [2022-12-13 13:41:16,412 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2022-12-13 13:41:16,412 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2022-12-13 13:41:16,412 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2022-12-13 13:41:16,419 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,419 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,419 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,419 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,419 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,419 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 42#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,420 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,420 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,420 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,420 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,420 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 138#L191-1true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,420 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,420 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,420 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,421 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,421 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 194#true, 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 138#L191-1true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,421 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,421 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,421 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,421 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,421 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][75], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 4#L136true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 138#L191-1true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,421 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,422 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,422 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,422 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,422 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 194#true, 185#true, 61#L119true, 49#thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,422 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,422 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,422 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,422 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,423 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 203#(<= 0 ~i~0), 194#true, 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,423 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,423 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,423 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,423 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,424 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 185#true, 194#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,424 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,424 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,424 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,424 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,424 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][75], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 8#thread2EXITtrue, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, 4#L136true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,424 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,424 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,424 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,425 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,425 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 42#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 102#thread1EXITtrue, thread3Thread1of1ForFork2InUse, 52#L190-4true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,425 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,425 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,425 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,425 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,426 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 102#thread1EXITtrue, thread3Thread1of1ForFork2InUse, 52#L190-4true, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,426 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,426 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,426 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,426 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,426 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 142#L106true, 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,426 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,427 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,427 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,427 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,427 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 97#L191-2true, 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 23#L109true]) [2022-12-13 13:41:16,427 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,427 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,427 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,427 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:16,451 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][75], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 4#L136true, 194#true, 185#true, 49#thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 138#L191-1true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,451 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2022-12-13 13:41:16,451 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2022-12-13 13:41:16,452 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2022-12-13 13:41:16,452 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2022-12-13 13:41:16,452 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][118], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 203#(<= 0 ~i~0), 4#L136true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 138#L191-1true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,452 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2022-12-13 13:41:16,452 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2022-12-13 13:41:16,452 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2022-12-13 13:41:16,452 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2022-12-13 13:41:16,477 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 194#true, 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,477 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,477 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,477 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,477 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,478 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][75], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 8#thread2EXITtrue, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 4#L136true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 138#L191-1true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,478 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,478 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,478 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,478 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,478 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 42#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 102#thread1EXITtrue, thread3Thread1of1ForFork2InUse, 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,478 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,478 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,478 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,479 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,479 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 102#thread1EXITtrue, thread3Thread1of1ForFork2InUse, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,479 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,479 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,479 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,479 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,480 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 102#thread1EXITtrue, thread3Thread1of1ForFork2InUse, 52#L190-4true, 194#true, 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,480 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,480 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,480 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,480 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,480 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][75], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 102#thread1EXITtrue, thread3Thread1of1ForFork2InUse, 52#L190-4true, 4#L136true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,480 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,480 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,481 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,481 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,481 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 178#true, 23#L109true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,481 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,481 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,481 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,481 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,482 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 97#L191-2true, 27#L112true, 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,482 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,482 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,482 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,482 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:16,526 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 102#thread1EXITtrue, thread3Thread1of1ForFork2InUse, 194#true, 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,526 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,526 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,526 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,526 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,526 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][75], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 102#thread1EXITtrue, thread3Thread1of1ForFork2InUse, 4#L136true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,527 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,527 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,527 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,527 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,527 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 42#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 97#L191-2true, thread3Thread1of1ForFork2InUse, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,527 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,527 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,528 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,528 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,528 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 97#L191-2true, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,528 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,528 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,528 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,529 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,529 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 27#L112true, 185#true, 194#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,529 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,529 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,529 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,530 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:16,569 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 97#L191-2true, 194#true, 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,569 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 13:41:16,569 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:16,570 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:16,570 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:16,570 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][75], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 97#L191-2true, 4#L136true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,570 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 13:41:16,570 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:16,570 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:16,570 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:16,571 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 42#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,571 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 13:41:16,571 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:16,571 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:16,571 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:16,571 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][53], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 203#(<= 0 ~i~0), 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:16,571 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 13:41:16,572 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:16,572 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:16,572 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:16,605 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][80], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 194#true, 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,605 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 13:41:16,605 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 13:41:16,606 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 13:41:16,606 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 13:41:16,606 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][75], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 8#thread2EXITtrue, 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 4#L136true, 194#true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:16,606 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 13:41:16,606 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 13:41:16,606 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 13:41:16,606 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 13:41:16,719 INFO L130 PetriNetUnfolder]: 8962/13924 cut-off events. [2022-12-13 13:41:16,720 INFO L131 PetriNetUnfolder]: For 27717/32746 co-relation queries the response was YES. [2022-12-13 13:41:16,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39295 conditions, 13924 events. 8962/13924 cut-off events. For 27717/32746 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 93112 event pairs, 3791 based on Foata normal form. 931/14014 useless extension candidates. Maximal degree in co-relation 39278. Up to 6607 conditions per place. [2022-12-13 13:41:16,787 INFO L137 encePairwiseOnDemand]: 251/261 looper letters, 99 selfloop transitions, 7 changer transitions 0/129 dead transitions. [2022-12-13 13:41:16,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 129 transitions, 808 flow [2022-12-13 13:41:16,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:41:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2022-12-13 13:41:16,789 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5810983397190294 [2022-12-13 13:41:16,789 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2022-12-13 13:41:16,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2022-12-13 13:41:16,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:41:16,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2022-12-13 13:41:16,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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-12-13 13:41:16,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 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-12-13 13:41:16,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 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-12-13 13:41:16,792 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 395 flow. Second operand 3 states and 455 transitions. [2022-12-13 13:41:16,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 129 transitions, 808 flow [2022-12-13 13:41:16,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 129 transitions, 764 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 13:41:16,803 INFO L231 Difference]: Finished difference. Result has 80 places, 88 transitions, 421 flow [2022-12-13 13:41:16,804 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=421, PETRI_PLACES=80, PETRI_TRANSITIONS=88} [2022-12-13 13:41:16,804 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 11 predicate places. [2022-12-13 13:41:16,804 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 88 transitions, 421 flow [2022-12-13 13:41:16,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 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-12-13 13:41:16,805 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:16,805 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:16,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:41:16,805 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:16,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:16,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1231391488, now seen corresponding path program 1 times [2022-12-13 13:41:16,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:16,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372973848] [2022-12-13 13:41:16,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:16,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:16,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:16,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372973848] [2022-12-13 13:41:16,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372973848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:16,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:16,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:41:16,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119854679] [2022-12-13 13:41:16,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:16,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:41:16,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:16,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:41:16,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:41:16,886 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 261 [2022-12-13 13:41:16,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 88 transitions, 421 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 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-12-13 13:41:16,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:16,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 261 [2022-12-13 13:41:16,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:17,140 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][52], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 153#L69true, thread3Thread1of1ForFork2InUse, Black: 201#true, 52#L190-4true, 203#(<= 0 ~i~0), 209#(= ~i~0 0), 74#L96true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,141 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-13 13:41:17,141 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 13:41:17,141 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 13:41:17,141 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-13 13:41:17,177 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][52], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, Black: 201#true, 209#(= ~i~0 0), 203#(<= 0 ~i~0), 74#L96true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 138#L191-1true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,177 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 13:41:17,177 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 13:41:17,177 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 13:41:17,177 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 13:41:17,216 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][52], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 153#L69true, thread3Thread1of1ForFork2InUse, Black: 201#true, 52#L190-4true, 209#(= ~i~0 0), 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 21#L103true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,216 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-13 13:41:17,216 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 13:41:17,216 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 13:41:17,216 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 13:41:17,218 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, Black: 203#(<= 0 ~i~0), 74#L96true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,218 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-13 13:41:17,218 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 13:41:17,218 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 13:41:17,218 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-13 13:41:17,256 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][52], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 153#L69true, thread3Thread1of1ForFork2InUse, Black: 201#true, 203#(<= 0 ~i~0), 209#(= ~i~0 0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 138#L191-1true, 21#L103true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,257 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-12-13 13:41:17,257 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:17,257 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:17,257 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:17,258 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][52], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, Black: 201#true, 52#L190-4true, 209#(= ~i~0 0), 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 176#(<= 0 ~n3~0), 142#L106true, 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,258 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-12-13 13:41:17,258 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:17,258 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:17,258 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:17,259 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 74#L96true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,259 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-12-13 13:41:17,259 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:17,259 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:17,259 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-13 13:41:17,295 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][52], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 153#L69true, thread3Thread1of1ForFork2InUse, Black: 201#true, 203#(<= 0 ~i~0), 209#(= ~i~0 0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, 176#(<= 0 ~n3~0), 142#L106true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,295 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-13 13:41:17,295 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:17,295 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:17,295 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:17,296 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][52], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, Black: 201#true, 52#L190-4true, 203#(<= 0 ~i~0), 209#(= ~i~0 0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 23#L109true, 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,296 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-13 13:41:17,296 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:17,296 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:17,296 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:17,297 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 21#L103true, 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,297 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-13 13:41:17,297 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:17,297 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:17,297 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-13 13:41:17,334 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][52], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 153#L69true, thread3Thread1of1ForFork2InUse, Black: 201#true, 203#(<= 0 ~i~0), 209#(= ~i~0 0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 138#L191-1true, 176#(<= 0 ~n3~0), 23#L109true, 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,334 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,334 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,334 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,334 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,335 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, 21#L103true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,335 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,335 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,335 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,335 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,335 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][52], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, Black: 201#true, 52#L190-4true, 203#(<= 0 ~i~0), 209#(= ~i~0 0), 27#L112true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,335 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,336 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,336 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,336 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,336 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), 142#L106true, 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,336 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,336 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,336 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,336 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,337 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 97#L191-2true, thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 74#L96true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,337 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,337 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,337 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,337 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-13 13:41:17,373 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][52], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 153#L69true, thread3Thread1of1ForFork2InUse, Black: 201#true, 203#(<= 0 ~i~0), 209#(= ~i~0 0), 27#L112true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 138#L191-1true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,373 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-13 13:41:17,373 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:17,373 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:17,373 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:17,374 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 138#L191-1true, 207#true, 176#(<= 0 ~n3~0), 142#L106true, 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,374 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-13 13:41:17,374 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:17,374 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:17,374 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:17,374 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), 23#L109true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,375 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-13 13:41:17,375 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:17,375 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:17,375 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:17,375 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 74#L96true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,375 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-13 13:41:17,376 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:17,376 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:17,376 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-13 13:41:17,411 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 138#L191-1true, 207#true, 176#(<= 0 ~n3~0), 23#L109true, 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,411 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,411 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,411 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,411 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,412 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, Black: 203#(<= 0 ~i~0), 27#L112true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,412 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,412 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,412 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,412 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,413 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 52#L190-4true, Black: 203#(<= 0 ~i~0), 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,413 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,413 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,413 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,413 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,413 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][71], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 153#L69true, 52#L190-4true, Black: 203#(<= 0 ~i~0), 4#L136true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,413 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,413 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,413 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,413 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,414 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 97#L191-2true, thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 21#L103true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,414 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,414 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,414 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,414 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-13 13:41:17,451 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 27#L112true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,452 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,452 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,452 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,452 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,452 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 153#L69true, thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 138#L191-1true, 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,452 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,452 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,452 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,452 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,452 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][71], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 153#L69true, thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 4#L136true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,453 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,453 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,453 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,453 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,453 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 42#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,453 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,453 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,453 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,453 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,454 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, Black: 201#true, 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,454 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,454 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,454 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,454 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,454 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 201#true, 52#L190-4true, 203#(<= 0 ~i~0), 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,454 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,454 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,454 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,454 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,455 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, Black: 203#(<= 0 ~i~0), 185#true, 61#L119true, 49#thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,455 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,455 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,455 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,455 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,455 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 21#L103true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,455 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,455 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,455 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,455 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,456 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 97#L191-2true, thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 176#(<= 0 ~n3~0), 142#L106true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,456 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,456 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,456 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,456 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-13 13:41:17,486 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][71], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 201#true, 52#L190-4true, 203#(<= 0 ~i~0), 4#L136true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,486 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is not cut-off event [2022-12-13 13:41:17,486 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2022-12-13 13:41:17,486 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2022-12-13 13:41:17,486 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2022-12-13 13:41:17,486 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][71], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, Black: 203#(<= 0 ~i~0), 4#L136true, 185#true, 49#thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,487 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is not cut-off event [2022-12-13 13:41:17,487 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2022-12-13 13:41:17,487 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2022-12-13 13:41:17,487 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is not cut-off event [2022-12-13 13:41:17,491 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 42#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 138#L191-1true, 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,491 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,491 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,491 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,491 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,491 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 201#true, 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 138#L191-1true, 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,491 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,491 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,491 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,491 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,492 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 201#true, 203#(<= 0 ~i~0), 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, 207#true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,492 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,492 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,492 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,492 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,492 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, 61#L119true, 49#thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,492 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,492 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,492 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,492 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,493 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, Black: 203#(<= 0 ~i~0), 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,493 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,493 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,493 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,493 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,493 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][71], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 8#thread2EXITtrue, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 52#L190-4true, Black: 203#(<= 0 ~i~0), 4#L136true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,494 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,494 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,494 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,494 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,494 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 42#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 102#thread1EXITtrue, thread3Thread1of1ForFork2InUse, 52#L190-4true, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,494 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,494 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,494 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,494 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,494 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 102#thread1EXITtrue, thread3Thread1of1ForFork2InUse, 52#L190-4true, Black: 201#true, 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,495 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,495 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,495 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,495 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,495 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 176#(<= 0 ~n3~0), 142#L106true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,495 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,495 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,495 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,495 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,495 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 97#L191-2true, thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 23#L109true, 178#true]) [2022-12-13 13:41:17,496 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,496 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,496 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,496 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-12-13 13:41:17,509 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][71], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 201#true, 203#(<= 0 ~i~0), 4#L136true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 138#L191-1true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 129#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,509 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2022-12-13 13:41:17,509 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2022-12-13 13:41:17,509 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2022-12-13 13:41:17,509 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2022-12-13 13:41:17,509 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][71], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 4#L136true, 185#true, 49#thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 138#L191-1true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,509 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is not cut-off event [2022-12-13 13:41:17,509 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2022-12-13 13:41:17,509 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2022-12-13 13:41:17,510 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is not cut-off event [2022-12-13 13:41:17,524 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 138#L191-1true, 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,524 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,524 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,525 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,525 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,525 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][71], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 8#thread2EXITtrue, 145#L76true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 4#L136true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,525 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,525 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,525 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,525 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,525 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 42#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 102#thread1EXITtrue, thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 138#L191-1true, 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,525 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,525 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,525 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,525 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,526 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 102#thread1EXITtrue, thread3Thread1of1ForFork2InUse, Black: 201#true, 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,526 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,526 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,526 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,526 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,526 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 102#thread1EXITtrue, thread3Thread1of1ForFork2InUse, 52#L190-4true, Black: 203#(<= 0 ~i~0), 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,526 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,526 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,526 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,526 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,526 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][71], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 201#true, 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 102#thread1EXITtrue, thread3Thread1of1ForFork2InUse, 52#L190-4true, Black: 203#(<= 0 ~i~0), 4#L136true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,526 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,527 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,527 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,527 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,527 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 23#L109true, 178#true]) [2022-12-13 13:41:17,527 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,527 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,527 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,527 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,527 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 97#L191-2true, thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 27#L112true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,528 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,528 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,528 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,528 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 13:41:17,554 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 102#thread1EXITtrue, thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 12#L139true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,554 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,554 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,554 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,554 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,554 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][71], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), 102#thread1EXITtrue, thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 4#L136true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 138#L191-1true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,554 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,554 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,555 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,555 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,555 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 42#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 97#L191-2true, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,555 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,555 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,555 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,555 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,555 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 97#L191-2true, Black: 201#true, 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,555 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,556 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,556 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,556 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,556 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 27#L112true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), 12#L139true, Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,556 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,556 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,556 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,557 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 13:41:17,588 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 97#L191-2true, Black: 203#(<= 0 ~i~0), 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,588 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 13:41:17,589 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:17,589 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:17,589 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:17,589 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][71], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 8#thread2EXITtrue, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, 97#L191-2true, Black: 203#(<= 0 ~i~0), 4#L136true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,589 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 13:41:17,589 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:17,589 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:17,589 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:17,590 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 42#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,590 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 13:41:17,590 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:17,590 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:17,590 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:17,590 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 130#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 201#true, 203#(<= 0 ~i~0), 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,590 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 13:41:17,590 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:17,590 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:17,590 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 13:41:17,617 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([633] L136-->L139: Formula: (and (= v_~n3~0_59 (+ v_~n3~0_60 1)) (<= v_~n3~0_59 2147483647) (<= 0 (+ v_~n3~0_59 2147483648))) InVars {~n3~0=v_~n3~0_60} OutVars{thread3Thread1of1ForFork2_#t~post3#1=|v_thread3Thread1of1ForFork2_#t~post3#1_5|, ~n3~0=v_~n3~0_59} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~post3#1, ~n3~0][77], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 185#true, 61#L119true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 12#L139true, 207#true, 176#(<= 0 ~n3~0), 178#true, Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0))]) [2022-12-13 13:41:17,617 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 13:41:17,617 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 13:41:17,617 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 13:41:17,617 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 13:41:17,617 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([707] L119-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_7| 0) (= v_~n2~0_79 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_7|, ~n2~0=v_~n2~0_79, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, ~n2~0, thread2Thread1of1ForFork1_#res#1.offset][71], [Black: 187#(and (<= ~n1~0 ~n3~0) (<= ~n3~0 ~n1~0) (<= ~n3~0 0) (<= ~n2~0 ~n1~0)), 201#true, Black: 188#(and (<= ~n1~0 1) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), 8#thread2EXITtrue, 162#L192-1true, Black: 198#(and (<= ~n1~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork2InUse, Black: 203#(<= 0 ~i~0), 4#L136true, 185#true, Black: 181#(and (<= ~n1~0 0) (<= ~n3~0 0)), Black: 180#(and (<= ~n1~0 0) (<= ~n2~0 0) (<= ~n3~0 0)), 207#true, 176#(<= 0 ~n3~0), Black: 189#(and (<= ~n2~0 1) (<= (+ ~n3~0 1) ~n2~0)), 178#true]) [2022-12-13 13:41:17,617 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 13:41:17,617 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 13:41:17,617 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 13:41:17,617 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 13:41:17,714 INFO L130 PetriNetUnfolder]: 7282/11296 cut-off events. [2022-12-13 13:41:17,714 INFO L131 PetriNetUnfolder]: For 23363/27239 co-relation queries the response was YES. [2022-12-13 13:41:17,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33788 conditions, 11296 events. 7282/11296 cut-off events. For 23363/27239 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 72728 event pairs, 2654 based on Foata normal form. 1221/12057 useless extension candidates. Maximal degree in co-relation 33769. Up to 6872 conditions per place. [2022-12-13 13:41:17,771 INFO L137 encePairwiseOnDemand]: 254/261 looper letters, 98 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2022-12-13 13:41:17,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 125 transitions, 800 flow [2022-12-13 13:41:17,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:41:17,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:41:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2022-12-13 13:41:17,772 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5683269476372924 [2022-12-13 13:41:17,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2022-12-13 13:41:17,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2022-12-13 13:41:17,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:41:17,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2022-12-13 13:41:17,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:17,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 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-12-13 13:41:17,775 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 261.0) internal successors, (1044), 4 states have internal predecessors, (1044), 0 states have call successors, (0), 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-12-13 13:41:17,775 INFO L175 Difference]: Start difference. First operand has 80 places, 88 transitions, 421 flow. Second operand 3 states and 445 transitions. [2022-12-13 13:41:17,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 125 transitions, 800 flow [2022-12-13 13:41:17,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 125 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:17,791 INFO L231 Difference]: Finished difference. Result has 81 places, 91 transitions, 443 flow [2022-12-13 13:41:17,791 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=81, PETRI_TRANSITIONS=91} [2022-12-13 13:41:17,791 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 12 predicate places. [2022-12-13 13:41:17,791 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 91 transitions, 443 flow [2022-12-13 13:41:17,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 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-12-13 13:41:17,792 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:17,792 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:17,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:41:17,792 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:17,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:17,792 INFO L85 PathProgramCache]: Analyzing trace with hash -42098743, now seen corresponding path program 1 times [2022-12-13 13:41:17,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:17,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83989860] [2022-12-13 13:41:17,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:17,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:17,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:17,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83989860] [2022-12-13 13:41:17,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83989860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:17,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:17,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:17,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374535853] [2022-12-13 13:41:17,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:17,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:17,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:17,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:17,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:17,990 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 261 [2022-12-13 13:41:17,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 91 transitions, 443 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 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-12-13 13:41:17,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:17,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 261 [2022-12-13 13:41:17,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:19,001 INFO L130 PetriNetUnfolder]: 9738/15092 cut-off events. [2022-12-13 13:41:19,002 INFO L131 PetriNetUnfolder]: For 24730/26965 co-relation queries the response was YES. [2022-12-13 13:41:19,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43851 conditions, 15092 events. 9738/15092 cut-off events. For 24730/26965 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 97704 event pairs, 3005 based on Foata normal form. 760/15327 useless extension candidates. Maximal degree in co-relation 43831. Up to 12496 conditions per place. [2022-12-13 13:41:19,069 INFO L137 encePairwiseOnDemand]: 251/261 looper letters, 108 selfloop transitions, 17 changer transitions 0/141 dead transitions. [2022-12-13 13:41:19,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 141 transitions, 879 flow [2022-12-13 13:41:19,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:41:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:41:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 695 transitions. [2022-12-13 13:41:19,071 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5325670498084292 [2022-12-13 13:41:19,071 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 695 transitions. [2022-12-13 13:41:19,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 695 transitions. [2022-12-13 13:41:19,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:41:19,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 695 transitions. [2022-12-13 13:41:19,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 0 states have call successors, (0), 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-12-13 13:41:19,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 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-12-13 13:41:19,073 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 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-12-13 13:41:19,073 INFO L175 Difference]: Start difference. First operand has 81 places, 91 transitions, 443 flow. Second operand 5 states and 695 transitions. [2022-12-13 13:41:19,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 141 transitions, 879 flow [2022-12-13 13:41:19,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 141 transitions, 872 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:41:19,087 INFO L231 Difference]: Finished difference. Result has 86 places, 98 transitions, 551 flow [2022-12-13 13:41:19,087 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=551, PETRI_PLACES=86, PETRI_TRANSITIONS=98} [2022-12-13 13:41:19,087 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 17 predicate places. [2022-12-13 13:41:19,088 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 98 transitions, 551 flow [2022-12-13 13:41:19,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 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-12-13 13:41:19,088 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:19,088 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:19,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:41:19,088 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:19,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:19,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1951517354, now seen corresponding path program 1 times [2022-12-13 13:41:19,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:19,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756459131] [2022-12-13 13:41:19,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:19,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:19,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756459131] [2022-12-13 13:41:19,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756459131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:19,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:19,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:19,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667367163] [2022-12-13 13:41:19,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:19,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:19,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:19,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:19,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:19,326 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2022-12-13 13:41:19,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 98 transitions, 551 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 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-12-13 13:41:19,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:19,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2022-12-13 13:41:19,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:20,454 INFO L130 PetriNetUnfolder]: 10919/17000 cut-off events. [2022-12-13 13:41:20,454 INFO L131 PetriNetUnfolder]: For 32393/33397 co-relation queries the response was YES. [2022-12-13 13:41:20,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51229 conditions, 17000 events. 10919/17000 cut-off events. For 32393/33397 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 111518 event pairs, 4875 based on Foata normal form. 508/16958 useless extension candidates. Maximal degree in co-relation 51206. Up to 14913 conditions per place. [2022-12-13 13:41:20,529 INFO L137 encePairwiseOnDemand]: 251/261 looper letters, 113 selfloop transitions, 14 changer transitions 0/143 dead transitions. [2022-12-13 13:41:20,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 143 transitions, 964 flow [2022-12-13 13:41:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:41:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:41:20,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2022-12-13 13:41:20,531 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5080459770114942 [2022-12-13 13:41:20,531 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2022-12-13 13:41:20,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2022-12-13 13:41:20,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:41:20,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2022-12-13 13:41:20,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 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-12-13 13:41:20,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 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-12-13 13:41:20,534 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 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-12-13 13:41:20,534 INFO L175 Difference]: Start difference. First operand has 86 places, 98 transitions, 551 flow. Second operand 5 states and 663 transitions. [2022-12-13 13:41:20,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 143 transitions, 964 flow [2022-12-13 13:41:20,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 143 transitions, 951 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 13:41:20,550 INFO L231 Difference]: Finished difference. Result has 91 places, 108 transitions, 644 flow [2022-12-13 13:41:20,551 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=644, PETRI_PLACES=91, PETRI_TRANSITIONS=108} [2022-12-13 13:41:20,551 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 22 predicate places. [2022-12-13 13:41:20,551 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 108 transitions, 644 flow [2022-12-13 13:41:20,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 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-12-13 13:41:20,552 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:20,552 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:20,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:41:20,552 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:20,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:20,552 INFO L85 PathProgramCache]: Analyzing trace with hash 258916110, now seen corresponding path program 1 times [2022-12-13 13:41:20,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:20,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902006276] [2022-12-13 13:41:20,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:20,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:20,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:20,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:20,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902006276] [2022-12-13 13:41:20,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902006276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:20,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:20,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:41:20,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903353367] [2022-12-13 13:41:20,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:20,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:41:20,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:20,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:41:20,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:41:20,798 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 261 [2022-12-13 13:41:20,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 108 transitions, 644 flow. Second operand has 7 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 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-12-13 13:41:20,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:20,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 261 [2022-12-13 13:41:20,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:22,667 INFO L130 PetriNetUnfolder]: 14874/23052 cut-off events. [2022-12-13 13:41:22,667 INFO L131 PetriNetUnfolder]: For 48506/49157 co-relation queries the response was YES. [2022-12-13 13:41:22,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72257 conditions, 23052 events. 14874/23052 cut-off events. For 48506/49157 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 156123 event pairs, 3652 based on Foata normal form. 426/22783 useless extension candidates. Maximal degree in co-relation 72230. Up to 15842 conditions per place. [2022-12-13 13:41:22,848 INFO L137 encePairwiseOnDemand]: 248/261 looper letters, 156 selfloop transitions, 35 changer transitions 0/204 dead transitions. [2022-12-13 13:41:22,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 204 transitions, 1482 flow [2022-12-13 13:41:22,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:41:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:41:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 930 transitions. [2022-12-13 13:41:22,853 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5090311986863711 [2022-12-13 13:41:22,853 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 930 transitions. [2022-12-13 13:41:22,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 930 transitions. [2022-12-13 13:41:22,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:41:22,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 930 transitions. [2022-12-13 13:41:22,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.85714285714286) internal successors, (930), 7 states have internal predecessors, (930), 0 states have call successors, (0), 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-12-13 13:41:22,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 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-12-13 13:41:22,861 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 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-12-13 13:41:22,861 INFO L175 Difference]: Start difference. First operand has 91 places, 108 transitions, 644 flow. Second operand 7 states and 930 transitions. [2022-12-13 13:41:22,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 204 transitions, 1482 flow [2022-12-13 13:41:22,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 204 transitions, 1468 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 13:41:22,884 INFO L231 Difference]: Finished difference. Result has 99 places, 127 transitions, 910 flow [2022-12-13 13:41:22,885 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=910, PETRI_PLACES=99, PETRI_TRANSITIONS=127} [2022-12-13 13:41:22,885 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 30 predicate places. [2022-12-13 13:41:22,885 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 127 transitions, 910 flow [2022-12-13 13:41:22,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 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-12-13 13:41:22,886 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:22,886 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:22,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:41:22,886 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:22,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:22,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1365531234, now seen corresponding path program 1 times [2022-12-13 13:41:22,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:22,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268642313] [2022-12-13 13:41:22,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:22,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:23,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:23,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268642313] [2022-12-13 13:41:23,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268642313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:23,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:23,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:23,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342454972] [2022-12-13 13:41:23,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:23,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:41:23,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:23,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:41:23,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:41:23,118 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 261 [2022-12-13 13:41:23,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 127 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:23,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:23,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 261 [2022-12-13 13:41:23,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:25,135 INFO L130 PetriNetUnfolder]: 15190/23401 cut-off events. [2022-12-13 13:41:25,135 INFO L131 PetriNetUnfolder]: For 58867/59511 co-relation queries the response was YES. [2022-12-13 13:41:25,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79728 conditions, 23401 events. 15190/23401 cut-off events. For 58867/59511 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 157320 event pairs, 5167 based on Foata normal form. 242/22889 useless extension candidates. Maximal degree in co-relation 79697. Up to 21084 conditions per place. [2022-12-13 13:41:25,283 INFO L137 encePairwiseOnDemand]: 250/261 looper letters, 151 selfloop transitions, 29 changer transitions 0/193 dead transitions. [2022-12-13 13:41:25,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 193 transitions, 1608 flow [2022-12-13 13:41:25,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:41:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:41:25,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 909 transitions. [2022-12-13 13:41:25,287 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4975369458128079 [2022-12-13 13:41:25,287 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 909 transitions. [2022-12-13 13:41:25,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 909 transitions. [2022-12-13 13:41:25,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:41:25,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 909 transitions. [2022-12-13 13:41:25,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:25,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 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-12-13 13:41:25,295 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 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-12-13 13:41:25,295 INFO L175 Difference]: Start difference. First operand has 99 places, 127 transitions, 910 flow. Second operand 7 states and 909 transitions. [2022-12-13 13:41:25,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 193 transitions, 1608 flow [2022-12-13 13:41:25,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 193 transitions, 1569 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:25,332 INFO L231 Difference]: Finished difference. Result has 106 places, 141 transitions, 1105 flow [2022-12-13 13:41:25,332 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1105, PETRI_PLACES=106, PETRI_TRANSITIONS=141} [2022-12-13 13:41:25,332 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 37 predicate places. [2022-12-13 13:41:25,332 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 141 transitions, 1105 flow [2022-12-13 13:41:25,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:25,333 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:25,333 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:25,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:41:25,333 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:25,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:25,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1781926571, now seen corresponding path program 1 times [2022-12-13 13:41:25,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:25,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762422032] [2022-12-13 13:41:25,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:25,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:25,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:25,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762422032] [2022-12-13 13:41:25,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762422032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:25,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:25,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:25,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882292221] [2022-12-13 13:41:25,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:25,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:41:25,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:25,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:41:25,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:41:25,559 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 261 [2022-12-13 13:41:25,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 141 transitions, 1105 flow. Second operand has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 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-12-13 13:41:25,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:25,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 261 [2022-12-13 13:41:25,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:27,453 INFO L130 PetriNetUnfolder]: 14046/21951 cut-off events. [2022-12-13 13:41:27,454 INFO L131 PetriNetUnfolder]: For 80055/82949 co-relation queries the response was YES. [2022-12-13 13:41:27,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76788 conditions, 21951 events. 14046/21951 cut-off events. For 80055/82949 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 151821 event pairs, 4887 based on Foata normal form. 508/21581 useless extension candidates. Maximal degree in co-relation 76753. Up to 19867 conditions per place. [2022-12-13 13:41:27,551 INFO L137 encePairwiseOnDemand]: 251/261 looper letters, 140 selfloop transitions, 22 changer transitions 0/185 dead transitions. [2022-12-13 13:41:27,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 185 transitions, 1624 flow [2022-12-13 13:41:27,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:41:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:41:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 790 transitions. [2022-12-13 13:41:27,553 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5044699872286079 [2022-12-13 13:41:27,553 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 790 transitions. [2022-12-13 13:41:27,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 790 transitions. [2022-12-13 13:41:27,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:41:27,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 790 transitions. [2022-12-13 13:41:27,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:27,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 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-12-13 13:41:27,556 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 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-12-13 13:41:27,556 INFO L175 Difference]: Start difference. First operand has 106 places, 141 transitions, 1105 flow. Second operand 6 states and 790 transitions. [2022-12-13 13:41:27,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 185 transitions, 1624 flow [2022-12-13 13:41:27,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 185 transitions, 1573 flow, removed 22 selfloop flow, removed 1 redundant places. [2022-12-13 13:41:27,660 INFO L231 Difference]: Finished difference. Result has 112 places, 148 transitions, 1194 flow [2022-12-13 13:41:27,661 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1194, PETRI_PLACES=112, PETRI_TRANSITIONS=148} [2022-12-13 13:41:27,661 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 43 predicate places. [2022-12-13 13:41:27,661 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 148 transitions, 1194 flow [2022-12-13 13:41:27,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 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-12-13 13:41:27,661 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:27,661 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:27,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:41:27,662 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:27,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1967232715, now seen corresponding path program 1 times [2022-12-13 13:41:27,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:27,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253665778] [2022-12-13 13:41:27,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:27,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:27,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:27,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253665778] [2022-12-13 13:41:27,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253665778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:27,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:27,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:41:27,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427450324] [2022-12-13 13:41:27,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:27,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:41:27,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:27,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:41:27,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:41:27,942 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2022-12-13 13:41:27,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 148 transitions, 1194 flow. Second operand has 7 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 0 states have call successors, (0), 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-12-13 13:41:27,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:27,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2022-12-13 13:41:27,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:30,685 INFO L130 PetriNetUnfolder]: 15462/24104 cut-off events. [2022-12-13 13:41:30,685 INFO L131 PetriNetUnfolder]: For 85821/86671 co-relation queries the response was YES. [2022-12-13 13:41:30,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86996 conditions, 24104 events. 15462/24104 cut-off events. For 85821/86671 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 167207 event pairs, 3551 based on Foata normal form. 356/23690 useless extension candidates. Maximal degree in co-relation 86957. Up to 18894 conditions per place. [2022-12-13 13:41:30,799 INFO L137 encePairwiseOnDemand]: 250/261 looper letters, 218 selfloop transitions, 58 changer transitions 0/295 dead transitions. [2022-12-13 13:41:30,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 295 transitions, 2556 flow [2022-12-13 13:41:30,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:41:30,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:41:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1322 transitions. [2022-12-13 13:41:30,802 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5065134099616858 [2022-12-13 13:41:30,802 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1322 transitions. [2022-12-13 13:41:30,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1322 transitions. [2022-12-13 13:41:30,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:41:30,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1322 transitions. [2022-12-13 13:41:30,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 132.2) internal successors, (1322), 10 states have internal predecessors, (1322), 0 states have call successors, (0), 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-12-13 13:41:30,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 261.0) internal successors, (2871), 11 states have internal predecessors, (2871), 0 states have call successors, (0), 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-12-13 13:41:30,810 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 261.0) internal successors, (2871), 11 states have internal predecessors, (2871), 0 states have call successors, (0), 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-12-13 13:41:30,810 INFO L175 Difference]: Start difference. First operand has 112 places, 148 transitions, 1194 flow. Second operand 10 states and 1322 transitions. [2022-12-13 13:41:30,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 295 transitions, 2556 flow [2022-12-13 13:41:30,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 295 transitions, 2478 flow, removed 21 selfloop flow, removed 3 redundant places. [2022-12-13 13:41:30,970 INFO L231 Difference]: Finished difference. Result has 124 places, 187 transitions, 1747 flow [2022-12-13 13:41:30,970 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1747, PETRI_PLACES=124, PETRI_TRANSITIONS=187} [2022-12-13 13:41:30,971 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 55 predicate places. [2022-12-13 13:41:30,971 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 187 transitions, 1747 flow [2022-12-13 13:41:30,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 0 states have call successors, (0), 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-12-13 13:41:30,972 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:30,972 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:30,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:41:30,972 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:30,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2030568883, now seen corresponding path program 1 times [2022-12-13 13:41:30,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:30,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621319565] [2022-12-13 13:41:30,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:31,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:31,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621319565] [2022-12-13 13:41:31,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621319565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:31,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:31,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:41:31,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752676223] [2022-12-13 13:41:31,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:31,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:41:31,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:31,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:41:31,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:41:31,354 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 261 [2022-12-13 13:41:31,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 187 transitions, 1747 flow. Second operand has 9 states, 9 states have (on average 113.55555555555556) internal successors, (1022), 9 states have internal predecessors, (1022), 0 states have call successors, (0), 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-12-13 13:41:31,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:31,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 261 [2022-12-13 13:41:31,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:34,453 INFO L130 PetriNetUnfolder]: 21150/32462 cut-off events. [2022-12-13 13:41:34,453 INFO L131 PetriNetUnfolder]: For 125675/125691 co-relation queries the response was YES. [2022-12-13 13:41:34,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122385 conditions, 32462 events. 21150/32462 cut-off events. For 125675/125691 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 227408 event pairs, 5436 based on Foata normal form. 132/31743 useless extension candidates. Maximal degree in co-relation 122340. Up to 23184 conditions per place. [2022-12-13 13:41:34,652 INFO L137 encePairwiseOnDemand]: 249/261 looper letters, 257 selfloop transitions, 49 changer transitions 0/315 dead transitions. [2022-12-13 13:41:34,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 315 transitions, 3084 flow [2022-12-13 13:41:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:41:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:41:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1059 transitions. [2022-12-13 13:41:34,656 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.507183908045977 [2022-12-13 13:41:34,656 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1059 transitions. [2022-12-13 13:41:34,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1059 transitions. [2022-12-13 13:41:34,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:41:34,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1059 transitions. [2022-12-13 13:41:34,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.375) internal successors, (1059), 8 states have internal predecessors, (1059), 0 states have call successors, (0), 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-12-13 13:41:34,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 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-12-13 13:41:34,661 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 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-12-13 13:41:34,661 INFO L175 Difference]: Start difference. First operand has 124 places, 187 transitions, 1747 flow. Second operand 8 states and 1059 transitions. [2022-12-13 13:41:34,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 315 transitions, 3084 flow [2022-12-13 13:41:35,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 315 transitions, 2966 flow, removed 56 selfloop flow, removed 1 redundant places. [2022-12-13 13:41:35,126 INFO L231 Difference]: Finished difference. Result has 133 places, 206 transitions, 2010 flow [2022-12-13 13:41:35,126 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2010, PETRI_PLACES=133, PETRI_TRANSITIONS=206} [2022-12-13 13:41:35,127 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 64 predicate places. [2022-12-13 13:41:35,127 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 206 transitions, 2010 flow [2022-12-13 13:41:35,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.55555555555556) internal successors, (1022), 9 states have internal predecessors, (1022), 0 states have call successors, (0), 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-12-13 13:41:35,128 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:35,128 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:35,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:41:35,128 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:35,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:35,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1818668071, now seen corresponding path program 2 times [2022-12-13 13:41:35,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:35,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747038775] [2022-12-13 13:41:35,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:35,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:35,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:35,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747038775] [2022-12-13 13:41:35,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747038775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:35,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:35,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:41:35,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815146405] [2022-12-13 13:41:35,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:35,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:41:35,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:35,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:41:35,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:41:35,411 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 261 [2022-12-13 13:41:35,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 206 transitions, 2010 flow. Second operand has 9 states, 9 states have (on average 114.44444444444444) internal successors, (1030), 9 states have internal predecessors, (1030), 0 states have call successors, (0), 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-12-13 13:41:35,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:35,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 261 [2022-12-13 13:41:35,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:39,900 INFO L130 PetriNetUnfolder]: 26123/40666 cut-off events. [2022-12-13 13:41:39,901 INFO L131 PetriNetUnfolder]: For 185665/186245 co-relation queries the response was YES. [2022-12-13 13:41:40,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155005 conditions, 40666 events. 26123/40666 cut-off events. For 185665/186245 co-relation queries the response was YES. Maximal size of possible extension queue 1182. Compared 302242 event pairs, 3454 based on Foata normal form. 688/40142 useless extension candidates. Maximal degree in co-relation 154955. Up to 18771 conditions per place. [2022-12-13 13:41:40,171 INFO L137 encePairwiseOnDemand]: 248/261 looper letters, 255 selfloop transitions, 133 changer transitions 0/401 dead transitions. [2022-12-13 13:41:40,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 401 transitions, 4315 flow [2022-12-13 13:41:40,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:41:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:41:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1084 transitions. [2022-12-13 13:41:40,173 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5191570881226054 [2022-12-13 13:41:40,173 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1084 transitions. [2022-12-13 13:41:40,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1084 transitions. [2022-12-13 13:41:40,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:41:40,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1084 transitions. [2022-12-13 13:41:40,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 135.5) internal successors, (1084), 8 states have internal predecessors, (1084), 0 states have call successors, (0), 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-12-13 13:41:40,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 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-12-13 13:41:40,177 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 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-12-13 13:41:40,177 INFO L175 Difference]: Start difference. First operand has 133 places, 206 transitions, 2010 flow. Second operand 8 states and 1084 transitions. [2022-12-13 13:41:40,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 401 transitions, 4315 flow [2022-12-13 13:41:40,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 401 transitions, 4138 flow, removed 69 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:40,906 INFO L231 Difference]: Finished difference. Result has 143 places, 269 transitions, 3268 flow [2022-12-13 13:41:40,907 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3268, PETRI_PLACES=143, PETRI_TRANSITIONS=269} [2022-12-13 13:41:40,907 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 74 predicate places. [2022-12-13 13:41:40,907 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 269 transitions, 3268 flow [2022-12-13 13:41:40,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.44444444444444) internal successors, (1030), 9 states have internal predecessors, (1030), 0 states have call successors, (0), 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-12-13 13:41:40,907 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:40,907 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:40,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:41:40,908 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:40,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:40,908 INFO L85 PathProgramCache]: Analyzing trace with hash -874153403, now seen corresponding path program 3 times [2022-12-13 13:41:40,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:40,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910199951] [2022-12-13 13:41:40,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:40,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:41,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:41,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910199951] [2022-12-13 13:41:41,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910199951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:41,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:41,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:41:41,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560281965] [2022-12-13 13:41:41,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:41,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:41:41,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:41,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:41:41,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:41:41,102 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 261 [2022-12-13 13:41:41,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 269 transitions, 3268 flow. Second operand has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:41,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:41,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 261 [2022-12-13 13:41:41,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:46,285 INFO L130 PetriNetUnfolder]: 25138/39486 cut-off events. [2022-12-13 13:41:46,286 INFO L131 PetriNetUnfolder]: For 222775/224473 co-relation queries the response was YES. [2022-12-13 13:41:46,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161183 conditions, 39486 events. 25138/39486 cut-off events. For 222775/224473 co-relation queries the response was YES. Maximal size of possible extension queue 1223. Compared 299703 event pairs, 5852 based on Foata normal form. 662/38639 useless extension candidates. Maximal degree in co-relation 161127. Up to 31314 conditions per place. [2022-12-13 13:41:46,558 INFO L137 encePairwiseOnDemand]: 251/261 looper letters, 241 selfloop transitions, 85 changer transitions 0/352 dead transitions. [2022-12-13 13:41:46,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 352 transitions, 4430 flow [2022-12-13 13:41:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:41:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:41:46,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 824 transitions. [2022-12-13 13:41:46,562 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5261813537675607 [2022-12-13 13:41:46,562 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 824 transitions. [2022-12-13 13:41:46,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 824 transitions. [2022-12-13 13:41:46,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:41:46,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 824 transitions. [2022-12-13 13:41:46,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.33333333333334) internal successors, (824), 6 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:46,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 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-12-13 13:41:46,569 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 261.0) internal successors, (1827), 7 states have internal predecessors, (1827), 0 states have call successors, (0), 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-12-13 13:41:46,569 INFO L175 Difference]: Start difference. First operand has 143 places, 269 transitions, 3268 flow. Second operand 6 states and 824 transitions. [2022-12-13 13:41:46,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 352 transitions, 4430 flow [2022-12-13 13:41:47,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 352 transitions, 4303 flow, removed 56 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:47,692 INFO L231 Difference]: Finished difference. Result has 148 places, 285 transitions, 3626 flow [2022-12-13 13:41:47,692 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=3143, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3626, PETRI_PLACES=148, PETRI_TRANSITIONS=285} [2022-12-13 13:41:47,692 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 79 predicate places. [2022-12-13 13:41:47,693 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 285 transitions, 3626 flow [2022-12-13 13:41:47,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:41:47,693 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:47,693 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:47,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:41:47,693 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:47,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:47,694 INFO L85 PathProgramCache]: Analyzing trace with hash -455366092, now seen corresponding path program 1 times [2022-12-13 13:41:47,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:47,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636704559] [2022-12-13 13:41:47,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:47,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:47,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:47,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636704559] [2022-12-13 13:41:47,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636704559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:47,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:47,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:41:47,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826368757] [2022-12-13 13:41:47,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:47,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:41:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:47,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:41:47,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:41:47,832 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 261 [2022-12-13 13:41:47,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 285 transitions, 3626 flow. Second operand has 6 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 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-12-13 13:41:47,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:47,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 261 [2022-12-13 13:41:47,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:41:57,042 INFO L130 PetriNetUnfolder]: 43074/67139 cut-off events. [2022-12-13 13:41:57,043 INFO L131 PetriNetUnfolder]: For 336813/336813 co-relation queries the response was YES. [2022-12-13 13:41:57,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267663 conditions, 67139 events. 43074/67139 cut-off events. For 336813/336813 co-relation queries the response was YES. Maximal size of possible extension queue 1897. Compared 535835 event pairs, 11334 based on Foata normal form. 130/65013 useless extension candidates. Maximal degree in co-relation 267605. Up to 35611 conditions per place. [2022-12-13 13:41:57,597 INFO L137 encePairwiseOnDemand]: 246/261 looper letters, 486 selfloop transitions, 126 changer transitions 0/621 dead transitions. [2022-12-13 13:41:57,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 621 transitions, 7276 flow [2022-12-13 13:41:57,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:41:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:41:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1159 transitions. [2022-12-13 13:41:57,600 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5550766283524904 [2022-12-13 13:41:57,600 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1159 transitions. [2022-12-13 13:41:57,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1159 transitions. [2022-12-13 13:41:57,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:41:57,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1159 transitions. [2022-12-13 13:41:57,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 144.875) internal successors, (1159), 8 states have internal predecessors, (1159), 0 states have call successors, (0), 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-12-13 13:41:57,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 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-12-13 13:41:57,604 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 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-12-13 13:41:57,604 INFO L175 Difference]: Start difference. First operand has 148 places, 285 transitions, 3626 flow. Second operand 8 states and 1159 transitions. [2022-12-13 13:41:57,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 621 transitions, 7276 flow [2022-12-13 13:41:59,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 621 transitions, 7113 flow, removed 58 selfloop flow, removed 2 redundant places. [2022-12-13 13:41:59,666 INFO L231 Difference]: Finished difference. Result has 160 places, 382 transitions, 5301 flow [2022-12-13 13:41:59,666 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=3499, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5301, PETRI_PLACES=160, PETRI_TRANSITIONS=382} [2022-12-13 13:41:59,666 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 91 predicate places. [2022-12-13 13:41:59,666 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 382 transitions, 5301 flow [2022-12-13 13:41:59,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 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-12-13 13:41:59,667 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:41:59,667 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:41:59,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 13:41:59,667 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:41:59,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:41:59,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1371241609, now seen corresponding path program 1 times [2022-12-13 13:41:59,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:41:59,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435589102] [2022-12-13 13:41:59,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:41:59,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:41:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:41:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:41:59,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:41:59,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435589102] [2022-12-13 13:41:59,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435589102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:41:59,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:41:59,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:41:59,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370433273] [2022-12-13 13:41:59,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:41:59,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:41:59,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:41:59,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:41:59,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:41:59,877 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 261 [2022-12-13 13:41:59,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 382 transitions, 5301 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 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-12-13 13:41:59,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:41:59,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 261 [2022-12-13 13:41:59,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:42:08,373 INFO L130 PetriNetUnfolder]: 40634/63760 cut-off events. [2022-12-13 13:42:08,373 INFO L131 PetriNetUnfolder]: For 477396/484045 co-relation queries the response was YES. [2022-12-13 13:42:08,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273686 conditions, 63760 events. 40634/63760 cut-off events. For 477396/484045 co-relation queries the response was YES. Maximal size of possible extension queue 1909. Compared 514549 event pairs, 17138 based on Foata normal form. 3069/64277 useless extension candidates. Maximal degree in co-relation 273620. Up to 57092 conditions per place. [2022-12-13 13:42:08,879 INFO L137 encePairwiseOnDemand]: 251/261 looper letters, 329 selfloop transitions, 56 changer transitions 0/450 dead transitions. [2022-12-13 13:42:08,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 450 transitions, 6669 flow [2022-12-13 13:42:08,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:42:08,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:42:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2022-12-13 13:42:08,881 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5187739463601533 [2022-12-13 13:42:08,881 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2022-12-13 13:42:08,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2022-12-13 13:42:08,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:42:08,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2022-12-13 13:42:08,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 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-12-13 13:42:08,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 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-12-13 13:42:08,883 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 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-12-13 13:42:08,883 INFO L175 Difference]: Start difference. First operand has 160 places, 382 transitions, 5301 flow. Second operand 5 states and 677 transitions. [2022-12-13 13:42:08,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 450 transitions, 6669 flow [2022-12-13 13:42:12,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 450 transitions, 6509 flow, removed 80 selfloop flow, removed 0 redundant places. [2022-12-13 13:42:12,622 INFO L231 Difference]: Finished difference. Result has 165 places, 401 transitions, 5576 flow [2022-12-13 13:42:12,622 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=5157, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5576, PETRI_PLACES=165, PETRI_TRANSITIONS=401} [2022-12-13 13:42:12,623 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 96 predicate places. [2022-12-13 13:42:12,623 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 401 transitions, 5576 flow [2022-12-13 13:42:12,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 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-12-13 13:42:12,623 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:42:12,623 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:42:12,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 13:42:12,624 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:42:12,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1499380885, now seen corresponding path program 1 times [2022-12-13 13:42:12,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:12,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806430198] [2022-12-13 13:42:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:12,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:42:12,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:12,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806430198] [2022-12-13 13:42:12,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806430198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:12,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:12,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:42:12,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654334825] [2022-12-13 13:42:12,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:12,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:42:12,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:12,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:42:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:42:12,753 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 261 [2022-12-13 13:42:12,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 401 transitions, 5576 flow. Second operand has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:42:12,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:42:12,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 261 [2022-12-13 13:42:12,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:42:21,967 INFO L130 PetriNetUnfolder]: 42288/66767 cut-off events. [2022-12-13 13:42:21,967 INFO L131 PetriNetUnfolder]: For 468514/472106 co-relation queries the response was YES. [2022-12-13 13:42:22,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284483 conditions, 66767 events. 42288/66767 cut-off events. For 468514/472106 co-relation queries the response was YES. Maximal size of possible extension queue 1968. Compared 545403 event pairs, 19993 based on Foata normal form. 2418/66686 useless extension candidates. Maximal degree in co-relation 284414. Up to 60448 conditions per place. [2022-12-13 13:42:22,495 INFO L137 encePairwiseOnDemand]: 250/261 looper letters, 372 selfloop transitions, 45 changer transitions 0/469 dead transitions. [2022-12-13 13:42:22,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 469 transitions, 6991 flow [2022-12-13 13:42:22,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:42:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:42:22,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 680 transitions. [2022-12-13 13:42:22,497 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5210727969348659 [2022-12-13 13:42:22,497 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 680 transitions. [2022-12-13 13:42:22,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 680 transitions. [2022-12-13 13:42:22,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:42:22,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 680 transitions. [2022-12-13 13:42:22,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 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-12-13 13:42:22,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 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-12-13 13:42:22,499 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 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-12-13 13:42:22,499 INFO L175 Difference]: Start difference. First operand has 165 places, 401 transitions, 5576 flow. Second operand 5 states and 680 transitions. [2022-12-13 13:42:22,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 469 transitions, 6991 flow [2022-12-13 13:42:24,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 469 transitions, 6873 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-13 13:42:24,300 INFO L231 Difference]: Finished difference. Result has 169 places, 423 transitions, 5974 flow [2022-12-13 13:42:24,300 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=5460, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5974, PETRI_PLACES=169, PETRI_TRANSITIONS=423} [2022-12-13 13:42:24,300 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 100 predicate places. [2022-12-13 13:42:24,300 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 423 transitions, 5974 flow [2022-12-13 13:42:24,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:42:24,300 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:42:24,300 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:42:24,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 13:42:24,301 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:42:24,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:24,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1498903795, now seen corresponding path program 2 times [2022-12-13 13:42:24,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:24,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076136530] [2022-12-13 13:42:24,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:24,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:42:24,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:24,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076136530] [2022-12-13 13:42:24,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076136530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:24,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:24,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:42:24,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361852004] [2022-12-13 13:42:24,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:24,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:42:24,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:24,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:42:24,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:42:24,549 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 261 [2022-12-13 13:42:24,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 423 transitions, 5974 flow. Second operand has 8 states, 8 states have (on average 114.5) internal successors, (916), 8 states have internal predecessors, (916), 0 states have call successors, (0), 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-12-13 13:42:24,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:42:24,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 261 [2022-12-13 13:42:24,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:42:36,302 INFO L130 PetriNetUnfolder]: 49404/77601 cut-off events. [2022-12-13 13:42:36,302 INFO L131 PetriNetUnfolder]: For 614642/617592 co-relation queries the response was YES. [2022-12-13 13:42:36,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341909 conditions, 77601 events. 49404/77601 cut-off events. For 614642/617592 co-relation queries the response was YES. Maximal size of possible extension queue 2296. Compared 637782 event pairs, 14511 based on Foata normal form. 2179/76961 useless extension candidates. Maximal degree in co-relation 341837. Up to 54627 conditions per place. [2022-12-13 13:42:37,149 INFO L137 encePairwiseOnDemand]: 249/261 looper letters, 448 selfloop transitions, 144 changer transitions 0/631 dead transitions. [2022-12-13 13:42:37,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 631 transitions, 9739 flow [2022-12-13 13:42:37,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:42:37,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:42:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1054 transitions. [2022-12-13 13:42:37,153 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5047892720306514 [2022-12-13 13:42:37,154 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1054 transitions. [2022-12-13 13:42:37,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1054 transitions. [2022-12-13 13:42:37,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:42:37,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1054 transitions. [2022-12-13 13:42:37,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.75) internal successors, (1054), 8 states have internal predecessors, (1054), 0 states have call successors, (0), 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-12-13 13:42:37,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 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-12-13 13:42:37,159 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 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-12-13 13:42:37,160 INFO L175 Difference]: Start difference. First operand has 169 places, 423 transitions, 5974 flow. Second operand 8 states and 1054 transitions. [2022-12-13 13:42:37,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 631 transitions, 9739 flow [2022-12-13 13:42:39,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 631 transitions, 9573 flow, removed 83 selfloop flow, removed 0 redundant places. [2022-12-13 13:42:39,942 INFO L231 Difference]: Finished difference. Result has 181 places, 489 transitions, 7694 flow [2022-12-13 13:42:39,943 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=5902, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7694, PETRI_PLACES=181, PETRI_TRANSITIONS=489} [2022-12-13 13:42:39,943 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 112 predicate places. [2022-12-13 13:42:39,943 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 489 transitions, 7694 flow [2022-12-13 13:42:39,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.5) internal successors, (916), 8 states have internal predecessors, (916), 0 states have call successors, (0), 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-12-13 13:42:39,943 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:42:39,943 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:42:39,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 13:42:39,943 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:42:39,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:39,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1392431659, now seen corresponding path program 2 times [2022-12-13 13:42:39,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:39,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566030155] [2022-12-13 13:42:39,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:39,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:42:40,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:40,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566030155] [2022-12-13 13:42:40,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566030155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:40,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:40,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:42:40,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964475110] [2022-12-13 13:42:40,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:40,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:42:40,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:40,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:42:40,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:42:40,139 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2022-12-13 13:42:40,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 489 transitions, 7694 flow. Second operand has 8 states, 8 states have (on average 115.5) internal successors, (924), 8 states have internal predecessors, (924), 0 states have call successors, (0), 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-12-13 13:42:40,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:42:40,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2022-12-13 13:42:40,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:42:53,644 INFO L130 PetriNetUnfolder]: 49599/77819 cut-off events. [2022-12-13 13:42:53,644 INFO L131 PetriNetUnfolder]: For 657871/661186 co-relation queries the response was YES. [2022-12-13 13:42:54,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354439 conditions, 77819 events. 49599/77819 cut-off events. For 657871/661186 co-relation queries the response was YES. Maximal size of possible extension queue 2286. Compared 640493 event pairs, 15506 based on Foata normal form. 1610/76556 useless extension candidates. Maximal degree in co-relation 354360. Up to 67189 conditions per place. [2022-12-13 13:42:54,334 INFO L137 encePairwiseOnDemand]: 249/261 looper letters, 413 selfloop transitions, 147 changer transitions 0/597 dead transitions. [2022-12-13 13:42:54,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 597 transitions, 10118 flow [2022-12-13 13:42:54,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:42:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:42:54,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1042 transitions. [2022-12-13 13:42:54,337 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4990421455938697 [2022-12-13 13:42:54,337 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1042 transitions. [2022-12-13 13:42:54,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1042 transitions. [2022-12-13 13:42:54,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:42:54,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1042 transitions. [2022-12-13 13:42:54,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.25) internal successors, (1042), 8 states have internal predecessors, (1042), 0 states have call successors, (0), 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-12-13 13:42:54,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 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-12-13 13:42:54,340 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 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-12-13 13:42:54,340 INFO L175 Difference]: Start difference. First operand has 181 places, 489 transitions, 7694 flow. Second operand 8 states and 1042 transitions. [2022-12-13 13:42:54,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 597 transitions, 10118 flow [2022-12-13 13:42:56,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 597 transitions, 9981 flow, removed 55 selfloop flow, removed 1 redundant places. [2022-12-13 13:42:56,939 INFO L231 Difference]: Finished difference. Result has 190 places, 527 transitions, 8888 flow [2022-12-13 13:42:56,939 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=7583, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8888, PETRI_PLACES=190, PETRI_TRANSITIONS=527} [2022-12-13 13:42:56,940 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 121 predicate places. [2022-12-13 13:42:56,940 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 527 transitions, 8888 flow [2022-12-13 13:42:56,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.5) internal successors, (924), 8 states have internal predecessors, (924), 0 states have call successors, (0), 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-12-13 13:42:56,940 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:42:56,940 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:42:56,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 13:42:56,941 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:42:56,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:42:56,941 INFO L85 PathProgramCache]: Analyzing trace with hash -380588349, now seen corresponding path program 4 times [2022-12-13 13:42:56,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:42:56,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986482553] [2022-12-13 13:42:56,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:42:56,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:42:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:42:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:42:57,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:42:57,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986482553] [2022-12-13 13:42:57,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986482553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:42:57,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:42:57,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:42:57,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491342380] [2022-12-13 13:42:57,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:42:57,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:42:57,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:42:57,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:42:57,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:42:57,214 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 261 [2022-12-13 13:42:57,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 527 transitions, 8888 flow. Second operand has 8 states, 8 states have (on average 116.75) internal successors, (934), 8 states have internal predecessors, (934), 0 states have call successors, (0), 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-12-13 13:42:57,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:42:57,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 261 [2022-12-13 13:42:57,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:43:14,204 INFO L130 PetriNetUnfolder]: 55366/87264 cut-off events. [2022-12-13 13:43:14,205 INFO L131 PetriNetUnfolder]: For 766561/768181 co-relation queries the response was YES. [2022-12-13 13:43:14,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403061 conditions, 87264 events. 55366/87264 cut-off events. For 766561/768181 co-relation queries the response was YES. Maximal size of possible extension queue 2585. Compared 732524 event pairs, 14188 based on Foata normal form. 918/85121 useless extension candidates. Maximal degree in co-relation 402977. Up to 60090 conditions per place. [2022-12-13 13:43:15,004 INFO L137 encePairwiseOnDemand]: 248/261 looper letters, 464 selfloop transitions, 231 changer transitions 0/717 dead transitions. [2022-12-13 13:43:15,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 717 transitions, 12054 flow [2022-12-13 13:43:15,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:43:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:43:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1113 transitions. [2022-12-13 13:43:15,006 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5330459770114943 [2022-12-13 13:43:15,006 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1113 transitions. [2022-12-13 13:43:15,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1113 transitions. [2022-12-13 13:43:15,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:43:15,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1113 transitions. [2022-12-13 13:43:15,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 139.125) internal successors, (1113), 8 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:43:15,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 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-12-13 13:43:15,009 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 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-12-13 13:43:15,009 INFO L175 Difference]: Start difference. First operand has 190 places, 527 transitions, 8888 flow. Second operand 8 states and 1113 transitions. [2022-12-13 13:43:15,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 717 transitions, 12054 flow [2022-12-13 13:43:18,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 717 transitions, 11857 flow, removed 37 selfloop flow, removed 3 redundant places. [2022-12-13 13:43:18,925 INFO L231 Difference]: Finished difference. Result has 200 places, 571 transitions, 10442 flow [2022-12-13 13:43:18,925 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=8676, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10442, PETRI_PLACES=200, PETRI_TRANSITIONS=571} [2022-12-13 13:43:18,926 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 131 predicate places. [2022-12-13 13:43:18,926 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 571 transitions, 10442 flow [2022-12-13 13:43:18,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.75) internal successors, (934), 8 states have internal predecessors, (934), 0 states have call successors, (0), 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-12-13 13:43:18,926 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:43:18,926 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:43:18,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 13:43:18,926 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:43:18,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:43:18,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1393561609, now seen corresponding path program 3 times [2022-12-13 13:43:18,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:43:18,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18016673] [2022-12-13 13:43:18,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:43:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:43:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:43:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:43:19,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:43:19,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18016673] [2022-12-13 13:43:19,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18016673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:43:19,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:43:19,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:43:19,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015985413] [2022-12-13 13:43:19,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:43:19,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:43:19,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:43:19,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:43:19,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:43:19,106 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2022-12-13 13:43:19,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 571 transitions, 10442 flow. Second operand has 7 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 0 states have call successors, (0), 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-12-13 13:43:19,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:43:19,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2022-12-13 13:43:19,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:43:34,519 INFO L130 PetriNetUnfolder]: 54084/85088 cut-off events. [2022-12-13 13:43:34,519 INFO L131 PetriNetUnfolder]: For 889986/895720 co-relation queries the response was YES. [2022-12-13 13:43:35,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409139 conditions, 85088 events. 54084/85088 cut-off events. For 889986/895720 co-relation queries the response was YES. Maximal size of possible extension queue 2557. Compared 713065 event pairs, 26275 based on Foata normal form. 2993/84679 useless extension candidates. Maximal degree in co-relation 409048. Up to 78780 conditions per place. [2022-12-13 13:43:35,349 INFO L137 encePairwiseOnDemand]: 251/261 looper letters, 462 selfloop transitions, 179 changer transitions 0/699 dead transitions. [2022-12-13 13:43:35,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 699 transitions, 14131 flow [2022-12-13 13:43:35,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:43:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:43:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1152 transitions. [2022-12-13 13:43:35,351 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4904214559386973 [2022-12-13 13:43:35,351 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1152 transitions. [2022-12-13 13:43:35,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1152 transitions. [2022-12-13 13:43:35,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:43:35,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1152 transitions. [2022-12-13 13:43:35,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.0) internal successors, (1152), 9 states have internal predecessors, (1152), 0 states have call successors, (0), 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-12-13 13:43:35,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 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-12-13 13:43:35,355 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 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-12-13 13:43:35,355 INFO L175 Difference]: Start difference. First operand has 200 places, 571 transitions, 10442 flow. Second operand 9 states and 1152 transitions. [2022-12-13 13:43:35,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 699 transitions, 14131 flow [2022-12-13 13:43:40,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 699 transitions, 13975 flow, removed 78 selfloop flow, removed 0 redundant places. [2022-12-13 13:43:40,326 INFO L231 Difference]: Finished difference. Result has 213 places, 651 transitions, 13035 flow [2022-12-13 13:43:40,326 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=10294, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13035, PETRI_PLACES=213, PETRI_TRANSITIONS=651} [2022-12-13 13:43:40,327 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 144 predicate places. [2022-12-13 13:43:40,327 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 651 transitions, 13035 flow [2022-12-13 13:43:40,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.57142857142857) internal successors, (809), 7 states have internal predecessors, (809), 0 states have call successors, (0), 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-12-13 13:43:40,327 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:43:40,327 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:43:40,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 13:43:40,327 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:43:40,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:43:40,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1576437775, now seen corresponding path program 4 times [2022-12-13 13:43:40,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:43:40,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827079756] [2022-12-13 13:43:40,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:43:40,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:43:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:43:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:43:40,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:43:40,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827079756] [2022-12-13 13:43:40,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827079756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:43:40,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:43:40,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:43:40,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000490799] [2022-12-13 13:43:40,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:43:40,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:43:40,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:43:40,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:43:40,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:43:40,544 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 261 [2022-12-13 13:43:40,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 651 transitions, 13035 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:43:40,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:43:40,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 261 [2022-12-13 13:43:40,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:43:56,948 INFO L130 PetriNetUnfolder]: 54775/86292 cut-off events. [2022-12-13 13:43:56,948 INFO L131 PetriNetUnfolder]: For 892700/896045 co-relation queries the response was YES. [2022-12-13 13:43:57,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418065 conditions, 86292 events. 54775/86292 cut-off events. For 892700/896045 co-relation queries the response was YES. Maximal size of possible extension queue 2570. Compared 723445 event pairs, 24721 based on Foata normal form. 1635/84707 useless extension candidates. Maximal degree in co-relation 417967. Up to 79629 conditions per place. [2022-12-13 13:43:57,846 INFO L137 encePairwiseOnDemand]: 251/261 looper letters, 481 selfloop transitions, 187 changer transitions 0/708 dead transitions. [2022-12-13 13:43:57,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 708 transitions, 14897 flow [2022-12-13 13:43:57,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:43:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:43:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1136 transitions. [2022-12-13 13:43:57,848 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4836100468284376 [2022-12-13 13:43:57,848 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1136 transitions. [2022-12-13 13:43:57,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1136 transitions. [2022-12-13 13:43:57,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:43:57,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1136 transitions. [2022-12-13 13:43:57,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.22222222222223) internal successors, (1136), 9 states have internal predecessors, (1136), 0 states have call successors, (0), 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-12-13 13:43:57,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 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-12-13 13:43:57,854 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 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-12-13 13:43:57,854 INFO L175 Difference]: Start difference. First operand has 213 places, 651 transitions, 13035 flow. Second operand 9 states and 1136 transitions. [2022-12-13 13:43:57,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 708 transitions, 14897 flow [2022-12-13 13:44:02,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 708 transitions, 14574 flow, removed 77 selfloop flow, removed 2 redundant places. [2022-12-13 13:44:02,915 INFO L231 Difference]: Finished difference. Result has 223 places, 666 transitions, 13488 flow [2022-12-13 13:44:02,915 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=12695, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13488, PETRI_PLACES=223, PETRI_TRANSITIONS=666} [2022-12-13 13:44:02,916 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 154 predicate places. [2022-12-13 13:44:02,916 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 666 transitions, 13488 flow [2022-12-13 13:44:02,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:44:02,916 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:44:02,917 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:44:02,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 13:44:02,917 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:44:02,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:44:02,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1924973467, now seen corresponding path program 1 times [2022-12-13 13:44:02,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:44:02,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34616648] [2022-12-13 13:44:02,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:44:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:44:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:44:03,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:44:03,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:44:03,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34616648] [2022-12-13 13:44:03,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34616648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:44:03,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:44:03,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:44:03,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39849667] [2022-12-13 13:44:03,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:44:03,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:44:03,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:44:03,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:44:03,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:44:03,128 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2022-12-13 13:44:03,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 666 transitions, 13488 flow. Second operand has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 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-12-13 13:44:03,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:44:03,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2022-12-13 13:44:03,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:44:21,072 INFO L130 PetriNetUnfolder]: 57930/90926 cut-off events. [2022-12-13 13:44:21,072 INFO L131 PetriNetUnfolder]: For 977514/982838 co-relation queries the response was YES. [2022-12-13 13:44:21,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442391 conditions, 90926 events. 57930/90926 cut-off events. For 977514/982838 co-relation queries the response was YES. Maximal size of possible extension queue 2733. Compared 763316 event pairs, 25534 based on Foata normal form. 3280/90822 useless extension candidates. Maximal degree in co-relation 442288. Up to 79814 conditions per place. [2022-12-13 13:44:22,054 INFO L137 encePairwiseOnDemand]: 249/261 looper letters, 628 selfloop transitions, 163 changer transitions 0/857 dead transitions. [2022-12-13 13:44:22,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 857 transitions, 18058 flow [2022-12-13 13:44:22,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:44:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:44:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 923 transitions. [2022-12-13 13:44:22,056 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.50519978106185 [2022-12-13 13:44:22,056 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 923 transitions. [2022-12-13 13:44:22,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 923 transitions. [2022-12-13 13:44:22,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:44:22,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 923 transitions. [2022-12-13 13:44:22,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 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-12-13 13:44:22,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 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-12-13 13:44:22,059 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 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-12-13 13:44:22,060 INFO L175 Difference]: Start difference. First operand has 223 places, 666 transitions, 13488 flow. Second operand 7 states and 923 transitions. [2022-12-13 13:44:22,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 857 transitions, 18058 flow [2022-12-13 13:44:27,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 857 transitions, 17581 flow, removed 103 selfloop flow, removed 5 redundant places. [2022-12-13 13:44:27,979 INFO L231 Difference]: Finished difference. Result has 229 places, 747 transitions, 15580 flow [2022-12-13 13:44:27,979 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=13074, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=15580, PETRI_PLACES=229, PETRI_TRANSITIONS=747} [2022-12-13 13:44:27,980 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 160 predicate places. [2022-12-13 13:44:27,980 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 747 transitions, 15580 flow [2022-12-13 13:44:27,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 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-12-13 13:44:27,980 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:44:27,980 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:44:27,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 13:44:27,980 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:44:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:44:27,980 INFO L85 PathProgramCache]: Analyzing trace with hash -711218024, now seen corresponding path program 1 times [2022-12-13 13:44:27,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:44:27,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914694822] [2022-12-13 13:44:27,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:44:27,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:44:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:44:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:44:28,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:44:28,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914694822] [2022-12-13 13:44:28,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914694822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:44:28,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:44:28,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:44:28,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50274209] [2022-12-13 13:44:28,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:44:28,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:44:28,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:44:28,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:44:28,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:44:28,185 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2022-12-13 13:44:28,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 747 transitions, 15580 flow. Second operand has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 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-12-13 13:44:28,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:44:28,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2022-12-13 13:44:28,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:44:50,608 INFO L130 PetriNetUnfolder]: 66835/104967 cut-off events. [2022-12-13 13:44:50,608 INFO L131 PetriNetUnfolder]: For 1168414/1173320 co-relation queries the response was YES. [2022-12-13 13:44:51,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518954 conditions, 104967 events. 66835/104967 cut-off events. For 1168414/1173320 co-relation queries the response was YES. Maximal size of possible extension queue 3210. Compared 900636 event pairs, 20842 based on Foata normal form. 2529/103473 useless extension candidates. Maximal degree in co-relation 518847. Up to 81001 conditions per place. [2022-12-13 13:44:51,829 INFO L137 encePairwiseOnDemand]: 248/261 looper letters, 693 selfloop transitions, 273 changer transitions 0/1026 dead transitions. [2022-12-13 13:44:51,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 1026 transitions, 22136 flow [2022-12-13 13:44:51,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:44:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:44:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1213 transitions. [2022-12-13 13:44:51,831 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5163899531715623 [2022-12-13 13:44:51,831 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1213 transitions. [2022-12-13 13:44:51,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1213 transitions. [2022-12-13 13:44:51,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:44:51,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1213 transitions. [2022-12-13 13:44:51,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.77777777777777) internal successors, (1213), 9 states have internal predecessors, (1213), 0 states have call successors, (0), 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-12-13 13:44:51,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 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-12-13 13:44:51,835 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 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-12-13 13:44:51,835 INFO L175 Difference]: Start difference. First operand has 229 places, 747 transitions, 15580 flow. Second operand 9 states and 1213 transitions. [2022-12-13 13:44:51,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 1026 transitions, 22136 flow [2022-12-13 13:45:00,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 1026 transitions, 22034 flow, removed 51 selfloop flow, removed 0 redundant places. [2022-12-13 13:45:00,456 INFO L231 Difference]: Finished difference. Result has 242 places, 869 transitions, 19869 flow [2022-12-13 13:45:00,456 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=15502, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=747, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=19869, PETRI_PLACES=242, PETRI_TRANSITIONS=869} [2022-12-13 13:45:00,456 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 173 predicate places. [2022-12-13 13:45:00,456 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 869 transitions, 19869 flow [2022-12-13 13:45:00,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 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-12-13 13:45:00,457 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:00,457 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:45:00,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 13:45:00,457 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:45:00,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:00,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2140039227, now seen corresponding path program 5 times [2022-12-13 13:45:00,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:00,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124804311] [2022-12-13 13:45:00,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:00,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:45:00,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:00,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124804311] [2022-12-13 13:45:00,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124804311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:45:00,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:45:00,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:45:00,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656560362] [2022-12-13 13:45:00,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:45:00,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:45:00,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:45:00,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:45:00,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:45:00,680 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2022-12-13 13:45:00,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 869 transitions, 19869 flow. Second operand has 9 states, 9 states have (on average 115.55555555555556) internal successors, (1040), 9 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:00,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:45:00,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2022-12-13 13:45:00,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:45:28,199 INFO L130 PetriNetUnfolder]: 73839/116191 cut-off events. [2022-12-13 13:45:28,199 INFO L131 PetriNetUnfolder]: For 1327963/1333034 co-relation queries the response was YES. [2022-12-13 13:45:29,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584901 conditions, 116191 events. 73839/116191 cut-off events. For 1327963/1333034 co-relation queries the response was YES. Maximal size of possible extension queue 3587. Compared 1012196 event pairs, 13838 based on Foata normal form. 2478/114233 useless extension candidates. Maximal degree in co-relation 584787. Up to 87120 conditions per place. [2022-12-13 13:45:29,685 INFO L137 encePairwiseOnDemand]: 249/261 looper letters, 640 selfloop transitions, 351 changer transitions 0/1051 dead transitions. [2022-12-13 13:45:29,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 1051 transitions, 23531 flow [2022-12-13 13:45:29,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:45:29,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:45:29,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1330 transitions. [2022-12-13 13:45:29,687 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5095785440613027 [2022-12-13 13:45:29,687 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1330 transitions. [2022-12-13 13:45:29,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1330 transitions. [2022-12-13 13:45:29,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:45:29,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1330 transitions. [2022-12-13 13:45:29,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:29,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 261.0) internal successors, (2871), 11 states have internal predecessors, (2871), 0 states have call successors, (0), 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-12-13 13:45:29,691 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 261.0) internal successors, (2871), 11 states have internal predecessors, (2871), 0 states have call successors, (0), 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-12-13 13:45:29,691 INFO L175 Difference]: Start difference. First operand has 242 places, 869 transitions, 19869 flow. Second operand 10 states and 1330 transitions. [2022-12-13 13:45:29,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 1051 transitions, 23531 flow [2022-12-13 13:45:39,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 1051 transitions, 23372 flow, removed 52 selfloop flow, removed 1 redundant places. [2022-12-13 13:45:39,713 INFO L231 Difference]: Finished difference. Result has 254 places, 906 transitions, 21445 flow [2022-12-13 13:45:39,713 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=19710, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=869, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=316, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=21445, PETRI_PLACES=254, PETRI_TRANSITIONS=906} [2022-12-13 13:45:39,713 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 185 predicate places. [2022-12-13 13:45:39,713 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 906 transitions, 21445 flow [2022-12-13 13:45:39,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.55555555555556) internal successors, (1040), 9 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:45:39,714 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:45:39,714 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:45:39,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 13:45:39,714 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:45:39,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:45:39,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1779344160, now seen corresponding path program 2 times [2022-12-13 13:45:39,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:45:39,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422044286] [2022-12-13 13:45:39,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:45:39,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:45:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:45:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:45:39,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:45:39,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422044286] [2022-12-13 13:45:39,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422044286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:45:39,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:45:39,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:45:39,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444517083] [2022-12-13 13:45:39,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:45:39,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:45:39,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:45:39,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:45:39,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:45:39,945 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 261 [2022-12-13 13:45:39,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 906 transitions, 21445 flow. Second operand has 9 states, 9 states have (on average 114.55555555555556) internal successors, (1031), 9 states have internal predecessors, (1031), 0 states have call successors, (0), 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-12-13 13:45:39,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:45:39,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 261 [2022-12-13 13:45:39,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:46:12,949 INFO L130 PetriNetUnfolder]: 82625/130431 cut-off events. [2022-12-13 13:46:12,949 INFO L131 PetriNetUnfolder]: For 1614152/1618188 co-relation queries the response was YES. [2022-12-13 13:46:14,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669892 conditions, 130431 events. 82625/130431 cut-off events. For 1614152/1618188 co-relation queries the response was YES. Maximal size of possible extension queue 3946. Compared 1154021 event pairs, 15155 based on Foata normal form. 2254/127763 useless extension candidates. Maximal degree in co-relation 669772. Up to 80226 conditions per place. [2022-12-13 13:46:14,638 INFO L137 encePairwiseOnDemand]: 249/261 looper letters, 666 selfloop transitions, 431 changer transitions 0/1131 dead transitions. [2022-12-13 13:46:14,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 1131 transitions, 26213 flow [2022-12-13 13:46:14,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:46:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:46:14,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1328 transitions. [2022-12-13 13:46:14,641 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5088122605363985 [2022-12-13 13:46:14,641 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1328 transitions. [2022-12-13 13:46:14,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1328 transitions. [2022-12-13 13:46:14,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:46:14,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1328 transitions. [2022-12-13 13:46:14,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 132.8) internal successors, (1328), 10 states have internal predecessors, (1328), 0 states have call successors, (0), 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-12-13 13:46:14,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 261.0) internal successors, (2871), 11 states have internal predecessors, (2871), 0 states have call successors, (0), 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-12-13 13:46:14,644 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 261.0) internal successors, (2871), 11 states have internal predecessors, (2871), 0 states have call successors, (0), 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-12-13 13:46:14,644 INFO L175 Difference]: Start difference. First operand has 254 places, 906 transitions, 21445 flow. Second operand 10 states and 1328 transitions. [2022-12-13 13:46:14,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 1131 transitions, 26213 flow [2022-12-13 13:46:28,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 1131 transitions, 26047 flow, removed 49 selfloop flow, removed 2 redundant places. [2022-12-13 13:46:28,793 INFO L231 Difference]: Finished difference. Result has 263 places, 951 transitions, 23541 flow [2022-12-13 13:46:28,793 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=21222, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=904, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=389, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=23541, PETRI_PLACES=263, PETRI_TRANSITIONS=951} [2022-12-13 13:46:28,793 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 194 predicate places. [2022-12-13 13:46:28,793 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 951 transitions, 23541 flow [2022-12-13 13:46:28,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.55555555555556) internal successors, (1031), 9 states have internal predecessors, (1031), 0 states have call successors, (0), 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-12-13 13:46:28,794 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:46:28,794 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:46:28,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 13:46:28,794 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:46:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:46:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash 634263064, now seen corresponding path program 3 times [2022-12-13 13:46:28,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:46:28,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917121614] [2022-12-13 13:46:28,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:46:28,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:46:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:46:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:46:28,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:46:28,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917121614] [2022-12-13 13:46:28,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917121614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:46:28,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:46:28,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:46:28,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553288884] [2022-12-13 13:46:28,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:46:28,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:46:28,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:46:28,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:46:28,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:46:28,998 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 261 [2022-12-13 13:46:28,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 951 transitions, 23541 flow. Second operand has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 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-12-13 13:46:28,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:46:28,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 261 [2022-12-13 13:46:28,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:47:04,353 INFO L130 PetriNetUnfolder]: 82749/131645 cut-off events. [2022-12-13 13:47:04,353 INFO L131 PetriNetUnfolder]: For 1827869/1839775 co-relation queries the response was YES. [2022-12-13 13:47:05,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674960 conditions, 131645 events. 82749/131645 cut-off events. For 1827869/1839775 co-relation queries the response was YES. Maximal size of possible extension queue 4188. Compared 1184315 event pairs, 25177 based on Foata normal form. 5989/131832 useless extension candidates. Maximal degree in co-relation 674836. Up to 107632 conditions per place. [2022-12-13 13:47:06,307 INFO L137 encePairwiseOnDemand]: 247/261 looper letters, 690 selfloop transitions, 313 changer transitions 0/1130 dead transitions. [2022-12-13 13:47:06,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 1130 transitions, 27582 flow [2022-12-13 13:47:06,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:47:06,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:47:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1210 transitions. [2022-12-13 13:47:06,310 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5151128139633887 [2022-12-13 13:47:06,310 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1210 transitions. [2022-12-13 13:47:06,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1210 transitions. [2022-12-13 13:47:06,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:47:06,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1210 transitions. [2022-12-13 13:47:06,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.44444444444446) internal successors, (1210), 9 states have internal predecessors, (1210), 0 states have call successors, (0), 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-12-13 13:47:06,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 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-12-13 13:47:06,315 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 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-12-13 13:47:06,315 INFO L175 Difference]: Start difference. First operand has 263 places, 951 transitions, 23541 flow. Second operand 9 states and 1210 transitions. [2022-12-13 13:47:06,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 1130 transitions, 27582 flow [2022-12-13 13:47:21,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 1130 transitions, 26955 flow, removed 136 selfloop flow, removed 6 redundant places. [2022-12-13 13:47:21,719 INFO L231 Difference]: Finished difference. Result has 271 places, 1005 transitions, 25310 flow [2022-12-13 13:47:21,719 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=22942, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=951, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=271, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=25310, PETRI_PLACES=271, PETRI_TRANSITIONS=1005} [2022-12-13 13:47:21,720 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 202 predicate places. [2022-12-13 13:47:21,720 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 1005 transitions, 25310 flow [2022-12-13 13:47:21,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 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-12-13 13:47:21,720 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:47:21,720 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:47:21,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 13:47:21,720 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:47:21,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:47:21,721 INFO L85 PathProgramCache]: Analyzing trace with hash -569110411, now seen corresponding path program 6 times [2022-12-13 13:47:21,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:47:21,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771847105] [2022-12-13 13:47:21,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:47:21,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:47:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:47:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:47:21,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:47:21,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771847105] [2022-12-13 13:47:21,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771847105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:47:21,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:47:21,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:47:21,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018065934] [2022-12-13 13:47:21,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:47:21,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:47:21,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:47:21,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:47:21,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:47:21,887 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2022-12-13 13:47:21,888 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 1005 transitions, 25310 flow. Second operand has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 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-12-13 13:47:21,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:47:21,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2022-12-13 13:47:21,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:48:00,789 INFO L130 PetriNetUnfolder]: 88157/140393 cut-off events. [2022-12-13 13:48:00,789 INFO L131 PetriNetUnfolder]: For 1992691/2004059 co-relation queries the response was YES. [2022-12-13 13:48:02,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751420 conditions, 140393 events. 88157/140393 cut-off events. For 1992691/2004059 co-relation queries the response was YES. Maximal size of possible extension queue 4452. Compared 1270761 event pairs, 21633 based on Foata normal form. 7261/141764 useless extension candidates. Maximal degree in co-relation 751289. Up to 107807 conditions per place. [2022-12-13 13:48:02,837 INFO L137 encePairwiseOnDemand]: 252/261 looper letters, 705 selfloop transitions, 391 changer transitions 0/1183 dead transitions. [2022-12-13 13:48:02,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 1183 transitions, 29728 flow [2022-12-13 13:48:02,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:48:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:48:02,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 946 transitions. [2022-12-13 13:48:02,839 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5177887246852764 [2022-12-13 13:48:02,839 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 946 transitions. [2022-12-13 13:48:02,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 946 transitions. [2022-12-13 13:48:02,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:48:02,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 946 transitions. [2022-12-13 13:48:02,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 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-12-13 13:48:02,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 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-12-13 13:48:02,842 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 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-12-13 13:48:02,842 INFO L175 Difference]: Start difference. First operand has 271 places, 1005 transitions, 25310 flow. Second operand 7 states and 946 transitions. [2022-12-13 13:48:02,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 1183 transitions, 29728 flow [2022-12-13 13:48:20,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 1183 transitions, 29443 flow, removed 115 selfloop flow, removed 1 redundant places. [2022-12-13 13:48:20,256 INFO L231 Difference]: Finished difference. Result has 279 places, 1051 transitions, 27336 flow [2022-12-13 13:48:20,257 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=25027, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1005, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=348, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=27336, PETRI_PLACES=279, PETRI_TRANSITIONS=1051} [2022-12-13 13:48:20,257 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 210 predicate places. [2022-12-13 13:48:20,257 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 1051 transitions, 27336 flow [2022-12-13 13:48:20,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 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-12-13 13:48:20,258 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:48:20,258 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:48:20,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 13:48:20,258 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:48:20,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:48:20,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1292686671, now seen corresponding path program 7 times [2022-12-13 13:48:20,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:48:20,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074409136] [2022-12-13 13:48:20,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:48:20,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:48:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:48:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:48:20,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:48:20,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074409136] [2022-12-13 13:48:20,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074409136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:48:20,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:48:20,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:48:20,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209881993] [2022-12-13 13:48:20,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:48:20,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:48:20,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:48:20,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:48:20,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:48:20,418 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 261 [2022-12-13 13:48:20,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 1051 transitions, 27336 flow. Second operand has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 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-12-13 13:48:20,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:48:20,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 261 [2022-12-13 13:48:20,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:49:02,158 INFO L130 PetriNetUnfolder]: 90344/143873 cut-off events. [2022-12-13 13:49:02,158 INFO L131 PetriNetUnfolder]: For 2143323/2158208 co-relation queries the response was YES. [2022-12-13 13:49:03,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769950 conditions, 143873 events. 90344/143873 cut-off events. For 2143323/2158208 co-relation queries the response was YES. Maximal size of possible extension queue 4669. Compared 1310336 event pairs, 26921 based on Foata normal form. 8104/145432 useless extension candidates. Maximal degree in co-relation 769814. Up to 104201 conditions per place. [2022-12-13 13:49:04,284 INFO L137 encePairwiseOnDemand]: 249/261 looper letters, 711 selfloop transitions, 393 changer transitions 0/1217 dead transitions. [2022-12-13 13:49:04,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 1217 transitions, 30980 flow [2022-12-13 13:49:04,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:49:04,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:49:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1102 transitions. [2022-12-13 13:49:04,286 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-12-13 13:49:04,286 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1102 transitions. [2022-12-13 13:49:04,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1102 transitions. [2022-12-13 13:49:04,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:49:04,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1102 transitions. [2022-12-13 13:49:04,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 137.75) internal successors, (1102), 8 states have internal predecessors, (1102), 0 states have call successors, (0), 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-12-13 13:49:04,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 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-12-13 13:49:04,291 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 261.0) internal successors, (2349), 9 states have internal predecessors, (2349), 0 states have call successors, (0), 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-12-13 13:49:04,291 INFO L175 Difference]: Start difference. First operand has 279 places, 1051 transitions, 27336 flow. Second operand 8 states and 1102 transitions. [2022-12-13 13:49:04,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 1217 transitions, 30980 flow [2022-12-13 13:49:23,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 1217 transitions, 30562 flow, removed 65 selfloop flow, removed 3 redundant places. [2022-12-13 13:49:23,490 INFO L231 Difference]: Finished difference. Result has 286 places, 1071 transitions, 28533 flow [2022-12-13 13:49:23,491 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=26762, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1041, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=367, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=28533, PETRI_PLACES=286, PETRI_TRANSITIONS=1071} [2022-12-13 13:49:23,491 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 217 predicate places. [2022-12-13 13:49:23,491 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 1071 transitions, 28533 flow [2022-12-13 13:49:23,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 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-12-13 13:49:23,491 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:49:23,491 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:49:23,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 13:49:23,491 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:49:23,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:49:23,492 INFO L85 PathProgramCache]: Analyzing trace with hash -553914936, now seen corresponding path program 4 times [2022-12-13 13:49:23,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:49:23,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044921594] [2022-12-13 13:49:23,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:49:23,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:49:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:49:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:49:23,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:49:23,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044921594] [2022-12-13 13:49:23,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044921594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:49:23,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:49:23,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:49:23,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577249101] [2022-12-13 13:49:23,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:49:23,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:49:23,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:49:23,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:49:23,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:49:23,694 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2022-12-13 13:49:23,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 1071 transitions, 28533 flow. Second operand has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 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-12-13 13:49:23,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:49:23,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2022-12-13 13:49:23,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:50:07,142 INFO L130 PetriNetUnfolder]: 94232/149035 cut-off events. [2022-12-13 13:50:07,142 INFO L131 PetriNetUnfolder]: For 2256831/2262405 co-relation queries the response was YES. [2022-12-13 13:50:08,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823549 conditions, 149035 events. 94232/149035 cut-off events. For 2256831/2262405 co-relation queries the response was YES. Maximal size of possible extension queue 4756. Compared 1346889 event pairs, 30908 based on Foata normal form. 2698/145565 useless extension candidates. Maximal degree in co-relation 823410. Up to 133993 conditions per place. [2022-12-13 13:50:09,392 INFO L137 encePairwiseOnDemand]: 250/261 looper letters, 810 selfloop transitions, 278 changer transitions 0/1148 dead transitions. [2022-12-13 13:50:09,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 1148 transitions, 31377 flow [2022-12-13 13:50:09,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:50:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:50:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 929 transitions. [2022-12-13 13:50:09,394 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5084838533114395 [2022-12-13 13:50:09,394 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 929 transitions. [2022-12-13 13:50:09,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 929 transitions. [2022-12-13 13:50:09,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:50:09,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 929 transitions. [2022-12-13 13:50:09,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.71428571428572) internal successors, (929), 7 states have internal predecessors, (929), 0 states have call successors, (0), 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-12-13 13:50:09,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 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-12-13 13:50:09,397 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 261.0) internal successors, (2088), 8 states have internal predecessors, (2088), 0 states have call successors, (0), 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-12-13 13:50:09,397 INFO L175 Difference]: Start difference. First operand has 286 places, 1071 transitions, 28533 flow. Second operand 7 states and 929 transitions. [2022-12-13 13:50:09,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 1148 transitions, 31377 flow [2022-12-13 13:50:40,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 1148 transitions, 30823 flow, removed 169 selfloop flow, removed 2 redundant places. [2022-12-13 13:50:40,923 INFO L231 Difference]: Finished difference. Result has 291 places, 1080 transitions, 28947 flow [2022-12-13 13:50:40,924 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=27979, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1071, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=269, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=28947, PETRI_PLACES=291, PETRI_TRANSITIONS=1080} [2022-12-13 13:50:40,924 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 222 predicate places. [2022-12-13 13:50:40,924 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 1080 transitions, 28947 flow [2022-12-13 13:50:40,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 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-12-13 13:50:40,924 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:50:40,924 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:50:40,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 13:50:40,924 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:50:40,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:50:40,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1260552760, now seen corresponding path program 5 times [2022-12-13 13:50:40,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:50:40,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169881179] [2022-12-13 13:50:40,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:50:40,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:50:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:50:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:50:41,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:50:41,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169881179] [2022-12-13 13:50:41,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169881179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:50:41,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:50:41,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:50:41,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029599583] [2022-12-13 13:50:41,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:50:41,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:50:41,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:50:41,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:50:41,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:50:41,096 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 261 [2022-12-13 13:50:41,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 1080 transitions, 28947 flow. Second operand has 8 states, 8 states have (on average 116.5) internal successors, (932), 8 states have internal predecessors, (932), 0 states have call successors, (0), 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-12-13 13:50:41,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:50:41,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 261 [2022-12-13 13:50:41,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:51:26,762 INFO L130 PetriNetUnfolder]: 91128/145155 cut-off events. [2022-12-13 13:51:26,762 INFO L131 PetriNetUnfolder]: For 2244761/2255097 co-relation queries the response was YES. [2022-12-13 13:51:28,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789452 conditions, 145155 events. 91128/145155 cut-off events. For 2244761/2255097 co-relation queries the response was YES. Maximal size of possible extension queue 4764. Compared 1325514 event pairs, 27520 based on Foata normal form. 5454/144356 useless extension candidates. Maximal degree in co-relation 789311. Up to 102234 conditions per place. [2022-12-13 13:51:28,897 INFO L137 encePairwiseOnDemand]: 249/261 looper letters, 716 selfloop transitions, 390 changer transitions 0/1242 dead transitions. [2022-12-13 13:51:28,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 1242 transitions, 31997 flow [2022-12-13 13:51:28,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:51:28,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:51:28,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1238 transitions. [2022-12-13 13:51:28,900 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5270327799063431 [2022-12-13 13:51:28,900 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1238 transitions. [2022-12-13 13:51:28,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1238 transitions. [2022-12-13 13:51:28,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:51:28,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1238 transitions. [2022-12-13 13:51:28,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.55555555555554) internal successors, (1238), 9 states have internal predecessors, (1238), 0 states have call successors, (0), 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-12-13 13:51:28,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 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-12-13 13:51:28,903 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 261.0) internal successors, (2610), 10 states have internal predecessors, (2610), 0 states have call successors, (0), 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-12-13 13:51:28,903 INFO L175 Difference]: Start difference. First operand has 291 places, 1080 transitions, 28947 flow. Second operand 9 states and 1238 transitions. [2022-12-13 13:51:28,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 1242 transitions, 31997 flow [2022-12-13 13:51:51,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 1242 transitions, 31384 flow, removed 52 selfloop flow, removed 8 redundant places. [2022-12-13 13:51:51,311 INFO L231 Difference]: Finished difference. Result has 292 places, 1066 transitions, 28968 flow [2022-12-13 13:51:51,312 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=261, PETRI_DIFFERENCE_MINUEND_FLOW=27500, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1045, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=370, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=28968, PETRI_PLACES=292, PETRI_TRANSITIONS=1066} [2022-12-13 13:51:51,312 INFO L288 CegarLoopForPetriNet]: 69 programPoint places, 223 predicate places. [2022-12-13 13:51:51,312 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 1066 transitions, 28968 flow [2022-12-13 13:51:51,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.5) internal successors, (932), 8 states have internal predecessors, (932), 0 states have call successors, (0), 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-12-13 13:51:51,312 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:51:51,313 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:51:51,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 13:51:51,313 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2022-12-13 13:51:51,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:51:51,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1241446840, now seen corresponding path program 6 times [2022-12-13 13:51:51,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:51:51,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837547254] [2022-12-13 13:51:51,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:51:51,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:51:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:51:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:51:51,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:51:51,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837547254] [2022-12-13 13:51:51,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837547254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:51:51,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:51:51,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:51:51,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783770908] [2022-12-13 13:51:51,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:51:51,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:51:51,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:51:51,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:51:51,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:51:51,501 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 261 [2022-12-13 13:51:51,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 1066 transitions, 28968 flow. Second operand has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 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-12-13 13:51:51,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:51:51,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 261 [2022-12-13 13:51:51,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand