./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/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_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 963498115a8eca6e92c68ab7fa8168826446f05b9b398350c3ee0745adf1bb45 --- 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 19:18:56,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:18:56,520 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:18:56,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:18:56,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:18:56,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:18:56,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:18:56,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:18:56,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:18:56,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:18:56,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:18:56,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:18:56,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:18:56,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:18:56,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:18:56,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:18:56,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:18:56,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:18:56,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:18:56,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:18:56,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:18:56,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:18:56,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:18:56,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:18:56,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:18:56,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:18:56,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:18:56,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:18:56,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:18:56,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:18:56,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:18:56,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:18:56,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:18:56,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:18:56,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:18:56,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:18:56,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:18:56,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:18:56,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:18:56,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:18:56,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:18:56,560 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 19:18:56,574 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:18:56,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:18:56,575 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:18:56,575 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:18:56,575 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 19:18:56,576 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 19:18:56,576 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:18:56,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:18:56,576 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:18:56,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:18:56,577 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:18:56,577 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 19:18:56,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:18:56,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:18:56,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:18:56,577 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 19:18:56,577 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 19:18:56,577 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 19:18:56,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 19:18:56,578 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 19:18:56,578 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:18:56,578 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:18:56,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:18:56,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:18:56,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 19:18:56,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:18:56,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:18:56,579 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 19:18:56,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:18:56,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 19:18:56,579 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 19:18:56,579 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 19:18:56,579 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 19:18:56,579 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 19:18:56,579 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_13a4447f-31e3-46c6-b1c6-c10c60e588c8/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_13a4447f-31e3-46c6-b1c6-c10c60e588c8/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 963498115a8eca6e92c68ab7fa8168826446f05b9b398350c3ee0745adf1bb45 [2022-12-13 19:18:56,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:18:56,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:18:56,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:18:56,779 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:18:56,779 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:18:56,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2022-12-13 19:18:59,310 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:18:59,522 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:18:59,523 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2022-12-13 19:18:59,533 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/data/1ab67597e/02f63c5b1d81490884d73c15de1ea355/FLAG145c1c76d [2022-12-13 19:18:59,868 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/data/1ab67597e/02f63c5b1d81490884d73c15de1ea355 [2022-12-13 19:18:59,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:18:59,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:18:59,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:18:59,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:18:59,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:18:59,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:18:59" (1/1) ... [2022-12-13 19:18:59,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa59227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:18:59, skipping insertion in model container [2022-12-13 19:18:59,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:18:59" (1/1) ... [2022-12-13 19:18:59,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:18:59,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:19:00,089 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_13a4447f-31e3-46c6-b1c6-c10c60e588c8/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i[30540,30553] [2022-12-13 19:19:00,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:19:00,102 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:19:00,132 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_13a4447f-31e3-46c6-b1c6-c10c60e588c8/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i[30540,30553] [2022-12-13 19:19:00,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:19:00,160 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:19:00,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:19:00 WrapperNode [2022-12-13 19:19:00,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:19:00,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:19:00,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:19:00,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:19:00,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:19:00" (1/1) ... [2022-12-13 19:19:00,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:19:00" (1/1) ... [2022-12-13 19:19:00,192 INFO L138 Inliner]: procedures = 171, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2022-12-13 19:19:00,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:19:00,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:19:00,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:19:00,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:19:00,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:19:00" (1/1) ... [2022-12-13 19:19:00,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:19:00" (1/1) ... [2022-12-13 19:19:00,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:19:00" (1/1) ... [2022-12-13 19:19:00,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:19:00" (1/1) ... [2022-12-13 19:19:00,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:19:00" (1/1) ... [2022-12-13 19:19:00,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:19:00" (1/1) ... [2022-12-13 19:19:00,211 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:19:00" (1/1) ... [2022-12-13 19:19:00,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:19:00" (1/1) ... [2022-12-13 19:19:00,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:19:00,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:19:00,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:19:00,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:19:00,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:19:00" (1/1) ... [2022-12-13 19:19:00,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 19:19:00,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:19:00,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 19:19:00,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 19:19:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 19:19:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-12-13 19:19:00,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-12-13 19:19:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 19:19:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:19:00,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 19:19:00,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 19:19:00,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:19:00,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:19:00,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:19:00,276 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 19:19:00,362 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:19:00,364 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:19:00,505 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:19:00,544 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:19:00,545 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 19:19:00,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:19:00 BoogieIcfgContainer [2022-12-13 19:19:00,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:19:00,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 19:19:00,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 19:19:00,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 19:19:00,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:18:59" (1/3) ... [2022-12-13 19:19:00,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2cffad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:19:00, skipping insertion in model container [2022-12-13 19:19:00,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:19:00" (2/3) ... [2022-12-13 19:19:00,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2cffad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:19:00, skipping insertion in model container [2022-12-13 19:19:00,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:19:00" (3/3) ... [2022-12-13 19:19:00,553 INFO L112 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2022-12-13 19:19:00,567 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 19:19:00,567 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-13 19:19:00,567 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 19:19:00,616 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 19:19:00,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 93 transitions, 191 flow [2022-12-13 19:19:00,681 INFO L130 PetriNetUnfolder]: 9/109 cut-off events. [2022-12-13 19:19:00,681 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:19:00,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 109 events. 9/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 146 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 67. Up to 4 conditions per place. [2022-12-13 19:19:00,685 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 93 transitions, 191 flow [2022-12-13 19:19:00,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 93 transitions, 191 flow [2022-12-13 19:19:00,691 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 19:19:00,699 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 93 transitions, 191 flow [2022-12-13 19:19:00,701 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 93 transitions, 191 flow [2022-12-13 19:19:00,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 93 transitions, 191 flow [2022-12-13 19:19:00,721 INFO L130 PetriNetUnfolder]: 9/109 cut-off events. [2022-12-13 19:19:00,721 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:19:00,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 109 events. 9/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 146 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 67. Up to 4 conditions per place. [2022-12-13 19:19:00,723 INFO L119 LiptonReduction]: Number of co-enabled transitions 1862 [2022-12-13 19:19:03,115 INFO L134 LiptonReduction]: Checked pairs total: 1869 [2022-12-13 19:19:03,115 INFO L136 LiptonReduction]: Total number of compositions: 103 [2022-12-13 19:19:03,125 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:19:03,131 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@64312577, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:19:03,131 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-12-13 19:19:03,133 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 19:19:03,134 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:19:03,134 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:03,134 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 19:19:03,135 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2022-12-13 19:19:03,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:03,140 INFO L85 PathProgramCache]: Analyzing trace with hash 14586, now seen corresponding path program 1 times [2022-12-13 19:19:03,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:03,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848870043] [2022-12-13 19:19:03,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:03,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:03,317 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 19:19:03,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:03,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848870043] [2022-12-13 19:19:03,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848870043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:03,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:03,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:19:03,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352420622] [2022-12-13 19:19:03,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:03,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:19:03,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:03,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:19:03,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:19:03,367 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 196 [2022-12-13 19:19:03,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 15 transitions, 35 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 19:19:03,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:03,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 196 [2022-12-13 19:19:03,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:03,392 INFO L130 PetriNetUnfolder]: 16/40 cut-off events. [2022-12-13 19:19:03,392 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:19:03,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 40 events. 16/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 94 event pairs, 12 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 70. Up to 39 conditions per place. [2022-12-13 19:19:03,393 INFO L137 encePairwiseOnDemand]: 191/196 looper letters, 9 selfloop transitions, 1 changer transitions 0/11 dead transitions. [2022-12-13 19:19:03,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 15 places, 11 transitions, 47 flow [2022-12-13 19:19:03,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2022-12-13 19:19:03,403 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4217687074829932 [2022-12-13 19:19:03,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 248 transitions. [2022-12-13 19:19:03,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 248 transitions. [2022-12-13 19:19:03,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:03,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 248 transitions. [2022-12-13 19:19:03,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 19:19:03,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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 19:19:03,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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 19:19:03,412 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 35 flow. Second operand 3 states and 248 transitions. [2022-12-13 19:19:03,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 15 places, 11 transitions, 47 flow [2022-12-13 19:19:03,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 11 transitions, 47 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 19:19:03,415 INFO L231 Difference]: Finished difference. Result has 15 places, 11 transitions, 29 flow [2022-12-13 19:19:03,416 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=27, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=29, PETRI_PLACES=15, PETRI_TRANSITIONS=11} [2022-12-13 19:19:03,419 INFO L288 CegarLoopForPetriNet]: 17 programPoint places, -2 predicate places. [2022-12-13 19:19:03,419 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 11 transitions, 29 flow [2022-12-13 19:19:03,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 19:19:03,419 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:03,420 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 19:19:03,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 19:19:03,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2022-12-13 19:19:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:03,420 INFO L85 PathProgramCache]: Analyzing trace with hash 14587, now seen corresponding path program 1 times [2022-12-13 19:19:03,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:03,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830782752] [2022-12-13 19:19:03,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:03,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:03,491 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 19:19:03,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:03,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830782752] [2022-12-13 19:19:03,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830782752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:03,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:03,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:19:03,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403388739] [2022-12-13 19:19:03,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:03,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:19:03,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:03,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:19:03,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:19:03,511 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 196 [2022-12-13 19:19:03,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 11 transitions, 29 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 19:19:03,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:03,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 196 [2022-12-13 19:19:03,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:03,528 INFO L130 PetriNetUnfolder]: 11/29 cut-off events. [2022-12-13 19:19:03,528 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:19:03,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 29 events. 11/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 57 event pairs, 8 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 58. Up to 28 conditions per place. [2022-12-13 19:19:03,528 INFO L137 encePairwiseOnDemand]: 194/196 looper letters, 8 selfloop transitions, 1 changer transitions 0/10 dead transitions. [2022-12-13 19:19:03,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 16 places, 10 transitions, 45 flow [2022-12-13 19:19:03,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:03,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2022-12-13 19:19:03,530 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086 [2022-12-13 19:19:03,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 250 transitions. [2022-12-13 19:19:03,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 250 transitions. [2022-12-13 19:19:03,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:03,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 250 transitions. [2022-12-13 19:19:03,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 19:19:03,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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 19:19:03,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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 19:19:03,533 INFO L175 Difference]: Start difference. First operand has 15 places, 11 transitions, 29 flow. Second operand 3 states and 250 transitions. [2022-12-13 19:19:03,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 16 places, 10 transitions, 45 flow [2022-12-13 19:19:03,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 10 transitions, 44 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:19:03,533 INFO L231 Difference]: Finished difference. Result has 15 places, 10 transitions, 28 flow [2022-12-13 19:19:03,533 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=28, PETRI_PLACES=15, PETRI_TRANSITIONS=10} [2022-12-13 19:19:03,534 INFO L288 CegarLoopForPetriNet]: 17 programPoint places, -2 predicate places. [2022-12-13 19:19:03,534 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 10 transitions, 28 flow [2022-12-13 19:19:03,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 19:19:03,534 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:03,534 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 19:19:03,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 19:19:03,534 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2022-12-13 19:19:03,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:03,535 INFO L85 PathProgramCache]: Analyzing trace with hash 434916036, now seen corresponding path program 1 times [2022-12-13 19:19:03,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:03,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605112207] [2022-12-13 19:19:03,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:03,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:03,631 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 19:19:03,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:03,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605112207] [2022-12-13 19:19:03,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605112207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:03,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:03,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:19:03,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459093888] [2022-12-13 19:19:03,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:03,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:19:03,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:03,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:19:03,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:19:03,681 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 196 [2022-12-13 19:19:03,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 10 transitions, 28 flow. Second operand has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:03,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:03,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 196 [2022-12-13 19:19:03,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:03,712 INFO L130 PetriNetUnfolder]: 9/24 cut-off events. [2022-12-13 19:19:03,712 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:19:03,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 24 events. 9/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 38 event pairs, 6 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 48. Up to 23 conditions per place. [2022-12-13 19:19:03,712 INFO L137 encePairwiseOnDemand]: 194/196 looper letters, 7 selfloop transitions, 1 changer transitions 0/9 dead transitions. [2022-12-13 19:19:03,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 16 places, 9 transitions, 42 flow [2022-12-13 19:19:03,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2022-12-13 19:19:03,714 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3979591836734694 [2022-12-13 19:19:03,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 234 transitions. [2022-12-13 19:19:03,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 234 transitions. [2022-12-13 19:19:03,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:03,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 234 transitions. [2022-12-13 19:19:03,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 19:19:03,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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 19:19:03,716 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 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 19:19:03,716 INFO L175 Difference]: Start difference. First operand has 15 places, 10 transitions, 28 flow. Second operand 3 states and 234 transitions. [2022-12-13 19:19:03,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 16 places, 9 transitions, 42 flow [2022-12-13 19:19:03,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 9 transitions, 41 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:19:03,717 INFO L231 Difference]: Finished difference. Result has 15 places, 9 transitions, 27 flow [2022-12-13 19:19:03,717 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=25, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=27, PETRI_PLACES=15, PETRI_TRANSITIONS=9} [2022-12-13 19:19:03,717 INFO L288 CegarLoopForPetriNet]: 17 programPoint places, -2 predicate places. [2022-12-13 19:19:03,718 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 9 transitions, 27 flow [2022-12-13 19:19:03,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.25) internal successors, (305), 4 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:03,718 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:03,718 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 19:19:03,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 19:19:03,718 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2022-12-13 19:19:03,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:03,719 INFO L85 PathProgramCache]: Analyzing trace with hash 434916037, now seen corresponding path program 1 times [2022-12-13 19:19:03,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:03,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578943802] [2022-12-13 19:19:03,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:03,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:03,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:03,841 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 19:19:03,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:03,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578943802] [2022-12-13 19:19:03,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578943802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:03,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:03,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:19:03,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711803968] [2022-12-13 19:19:03,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:03,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:19:03,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:03,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:19:03,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:19:03,917 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 196 [2022-12-13 19:19:03,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 9 transitions, 27 flow. Second operand has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 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 19:19:03,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:03,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 196 [2022-12-13 19:19:03,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:03,951 INFO L130 PetriNetUnfolder]: 13/34 cut-off events. [2022-12-13 19:19:03,952 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:19:03,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 34 events. 13/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 71 event pairs, 6 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 68. Up to 23 conditions per place. [2022-12-13 19:19:03,952 INFO L137 encePairwiseOnDemand]: 192/196 looper letters, 9 selfloop transitions, 3 changer transitions 0/13 dead transitions. [2022-12-13 19:19:03,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 13 transitions, 59 flow [2022-12-13 19:19:03,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:19:03,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:19:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2022-12-13 19:19:03,954 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40433673469387754 [2022-12-13 19:19:03,954 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 317 transitions. [2022-12-13 19:19:03,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 317 transitions. [2022-12-13 19:19:03,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:03,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 317 transitions. [2022-12-13 19:19:03,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 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 19:19:03,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 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 19:19:03,957 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 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 19:19:03,957 INFO L175 Difference]: Start difference. First operand has 15 places, 9 transitions, 27 flow. Second operand 4 states and 317 transitions. [2022-12-13 19:19:03,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 13 transitions, 59 flow [2022-12-13 19:19:03,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 13 transitions, 58 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:19:03,958 INFO L231 Difference]: Finished difference. Result has 18 places, 10 transitions, 40 flow [2022-12-13 19:19:03,958 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=40, PETRI_PLACES=18, PETRI_TRANSITIONS=10} [2022-12-13 19:19:03,958 INFO L288 CegarLoopForPetriNet]: 17 programPoint places, 1 predicate places. [2022-12-13 19:19:03,958 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 10 transitions, 40 flow [2022-12-13 19:19:03,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 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 19:19:03,959 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:03,959 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2022-12-13 19:19:03,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 19:19:03,959 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2022-12-13 19:19:03,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:03,959 INFO L85 PathProgramCache]: Analyzing trace with hash 597425429, now seen corresponding path program 1 times [2022-12-13 19:19:03,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:03,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676688126] [2022-12-13 19:19:03,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:03,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:19:03,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:19:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:19:03,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:19:03,984 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 19:19:03,985 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2022-12-13 19:19:03,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2022-12-13 19:19:03,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-12-13 19:19:03,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2022-12-13 19:19:03,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-12-13 19:19:03,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-12-13 19:19:03,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-12-13 19:19:03,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2022-12-13 19:19:03,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2022-12-13 19:19:03,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-12-13 19:19:03,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 19:19:03,988 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-12-13 19:19:03,990 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 19:19:03,990 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-12-13 19:19:04,011 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 19:19:04,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 143 transitions, 298 flow [2022-12-13 19:19:04,035 INFO L130 PetriNetUnfolder]: 17/177 cut-off events. [2022-12-13 19:19:04,035 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 19:19:04,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 17/177 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 391 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 116. Up to 6 conditions per place. [2022-12-13 19:19:04,036 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 143 transitions, 298 flow [2022-12-13 19:19:04,038 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 143 transitions, 298 flow [2022-12-13 19:19:04,038 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 19:19:04,038 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 143 transitions, 298 flow [2022-12-13 19:19:04,038 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 143 transitions, 298 flow [2022-12-13 19:19:04,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 143 transitions, 298 flow [2022-12-13 19:19:04,052 INFO L130 PetriNetUnfolder]: 17/177 cut-off events. [2022-12-13 19:19:04,052 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 19:19:04,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 17/177 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 391 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 116. Up to 6 conditions per place. [2022-12-13 19:19:04,057 INFO L119 LiptonReduction]: Number of co-enabled transitions 8624 [2022-12-13 19:19:06,261 INFO L134 LiptonReduction]: Checked pairs total: 12067 [2022-12-13 19:19:06,261 INFO L136 LiptonReduction]: Total number of compositions: 136 [2022-12-13 19:19:06,263 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:19:06,264 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@64312577, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:19:06,264 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-13 19:19:06,265 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 19:19:06,265 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:19:06,265 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:06,265 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 19:19:06,266 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-12-13 19:19:06,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:06,266 INFO L85 PathProgramCache]: Analyzing trace with hash 25065, now seen corresponding path program 1 times [2022-12-13 19:19:06,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:06,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870251390] [2022-12-13 19:19:06,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:06,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:06,289 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 19:19:06,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:06,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870251390] [2022-12-13 19:19:06,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870251390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:06,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:06,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:19:06,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195454997] [2022-12-13 19:19:06,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:06,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:19:06,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:06,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:19:06,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:19:06,311 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 279 [2022-12-13 19:19:06,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 19:19:06,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:06,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 279 [2022-12-13 19:19:06,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:06,396 INFO L130 PetriNetUnfolder]: 291/578 cut-off events. [2022-12-13 19:19:06,396 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-13 19:19:06,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 578 events. 291/578 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3185 event pairs, 222 based on Foata normal form. 44/395 useless extension candidates. Maximal degree in co-relation 255. Up to 438 conditions per place. [2022-12-13 19:19:06,400 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 18 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2022-12-13 19:19:06,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 114 flow [2022-12-13 19:19:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-12-13 19:19:06,402 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4647550776583035 [2022-12-13 19:19:06,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2022-12-13 19:19:06,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2022-12-13 19:19:06,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:06,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2022-12-13 19:19:06,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:06,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 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 19:19:06,405 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 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 19:19:06,405 INFO L175 Difference]: Start difference. First operand has 36 places, 39 transitions, 90 flow. Second operand 3 states and 389 transitions. [2022-12-13 19:19:06,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 114 flow [2022-12-13 19:19:06,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 112 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 19:19:06,407 INFO L231 Difference]: Finished difference. Result has 35 places, 32 transitions, 76 flow [2022-12-13 19:19:06,407 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=35, PETRI_TRANSITIONS=32} [2022-12-13 19:19:06,407 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2022-12-13 19:19:06,408 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 32 transitions, 76 flow [2022-12-13 19:19:06,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 19:19:06,408 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:06,408 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 19:19:06,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 19:19:06,408 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-12-13 19:19:06,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:06,409 INFO L85 PathProgramCache]: Analyzing trace with hash 25067, now seen corresponding path program 1 times [2022-12-13 19:19:06,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:06,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443756026] [2022-12-13 19:19:06,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:06,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:06,438 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 19:19:06,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:06,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443756026] [2022-12-13 19:19:06,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443756026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:06,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:06,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:19:06,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617289196] [2022-12-13 19:19:06,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:06,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:19:06,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:06,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:19:06,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:19:06,457 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 279 [2022-12-13 19:19:06,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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 19:19:06,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:06,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 279 [2022-12-13 19:19:06,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:06,512 INFO L130 PetriNetUnfolder]: 178/376 cut-off events. [2022-12-13 19:19:06,513 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 19:19:06,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 376 events. 178/376 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1859 event pairs, 132 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 679. Up to 276 conditions per place. [2022-12-13 19:19:06,515 INFO L137 encePairwiseOnDemand]: 277/279 looper letters, 17 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2022-12-13 19:19:06,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 110 flow [2022-12-13 19:19:06,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2022-12-13 19:19:06,517 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4635603345280765 [2022-12-13 19:19:06,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2022-12-13 19:19:06,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2022-12-13 19:19:06,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:06,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2022-12-13 19:19:06,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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 19:19:06,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 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 19:19:06,521 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 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 19:19:06,521 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 76 flow. Second operand 3 states and 388 transitions. [2022-12-13 19:19:06,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 110 flow [2022-12-13 19:19:06,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 109 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:19:06,522 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 75 flow [2022-12-13 19:19:06,522 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2022-12-13 19:19:06,523 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2022-12-13 19:19:06,523 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 75 flow [2022-12-13 19:19:06,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 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 19:19:06,523 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:06,523 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 19:19:06,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 19:19:06,524 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-12-13 19:19:06,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash 747360179, now seen corresponding path program 1 times [2022-12-13 19:19:06,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:06,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391888410] [2022-12-13 19:19:06,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:06,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:06,628 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 19:19:06,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:06,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391888410] [2022-12-13 19:19:06,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391888410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:06,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:06,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:19:06,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378381394] [2022-12-13 19:19:06,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:06,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:19:06,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:06,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:19:06,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:19:06,680 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 279 [2022-12-13 19:19:06,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 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 19:19:06,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:06,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 279 [2022-12-13 19:19:06,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:06,760 INFO L130 PetriNetUnfolder]: 222/444 cut-off events. [2022-12-13 19:19:06,760 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-13 19:19:06,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 444 events. 222/444 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2326 event pairs, 132 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 831. Up to 276 conditions per place. [2022-12-13 19:19:06,762 INFO L137 encePairwiseOnDemand]: 274/279 looper letters, 26 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2022-12-13 19:19:06,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 160 flow [2022-12-13 19:19:06,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:19:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:19:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2022-12-13 19:19:06,765 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4543010752688172 [2022-12-13 19:19:06,765 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 507 transitions. [2022-12-13 19:19:06,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 507 transitions. [2022-12-13 19:19:06,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:06,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 507 transitions. [2022-12-13 19:19:06,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 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 19:19:06,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 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 19:19:06,768 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 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 19:19:06,768 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 75 flow. Second operand 4 states and 507 transitions. [2022-12-13 19:19:06,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 160 flow [2022-12-13 19:19:06,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 159 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:19:06,769 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 90 flow [2022-12-13 19:19:06,769 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2022-12-13 19:19:06,770 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2022-12-13 19:19:06,770 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 90 flow [2022-12-13 19:19:06,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 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 19:19:06,770 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:06,770 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 19:19:06,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 19:19:06,770 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-12-13 19:19:06,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:06,771 INFO L85 PathProgramCache]: Analyzing trace with hash 747360178, now seen corresponding path program 1 times [2022-12-13 19:19:06,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:06,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921589722] [2022-12-13 19:19:06,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:06,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:06,814 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 19:19:06,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:06,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921589722] [2022-12-13 19:19:06,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921589722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:06,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:06,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:19:06,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270025957] [2022-12-13 19:19:06,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:06,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:19:06,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:06,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:19:06,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:19:06,873 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 279 [2022-12-13 19:19:06,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 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 19:19:06,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:06,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 279 [2022-12-13 19:19:06,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:06,933 INFO L130 PetriNetUnfolder]: 155/331 cut-off events. [2022-12-13 19:19:06,933 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2022-12-13 19:19:06,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 331 events. 155/331 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1561 event pairs, 113 based on Foata normal form. 28/278 useless extension candidates. Maximal degree in co-relation 683. Up to 241 conditions per place. [2022-12-13 19:19:06,935 INFO L137 encePairwiseOnDemand]: 276/279 looper letters, 16 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2022-12-13 19:19:06,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 120 flow [2022-12-13 19:19:06,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-12-13 19:19:06,936 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43727598566308246 [2022-12-13 19:19:06,936 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2022-12-13 19:19:06,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2022-12-13 19:19:06,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:06,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2022-12-13 19:19:06,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 19:19:06,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 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 19:19:06,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 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 19:19:06,938 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 90 flow. Second operand 3 states and 366 transitions. [2022-12-13 19:19:06,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 120 flow [2022-12-13 19:19:06,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 114 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 19:19:06,939 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 82 flow [2022-12-13 19:19:06,939 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2022-12-13 19:19:06,940 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2022-12-13 19:19:06,940 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 82 flow [2022-12-13 19:19:06,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 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 19:19:06,940 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:06,940 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 19:19:06,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 19:19:06,940 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-12-13 19:19:06,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:06,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1693331824, now seen corresponding path program 1 times [2022-12-13 19:19:06,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:06,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984043217] [2022-12-13 19:19:06,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:06,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:07,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:19:07,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:07,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984043217] [2022-12-13 19:19:07,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984043217] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:19:07,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671681006] [2022-12-13 19:19:07,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:07,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:07,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:19:07,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:19:07,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 19:19:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:07,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 19:19:07,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:19:07,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:19:07,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:19:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:19:07,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:19:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:19:07,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671681006] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:19:07,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:19:07,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 19:19:07,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278718294] [2022-12-13 19:19:07,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:19:07,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 19:19:07,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:07,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 19:19:07,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:19:07,717 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 279 [2022-12-13 19:19:07,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 82 flow. Second operand has 11 states, 11 states have (on average 118.63636363636364) internal successors, (1305), 11 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 19:19:07,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:07,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 279 [2022-12-13 19:19:07,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:07,991 INFO L130 PetriNetUnfolder]: 453/961 cut-off events. [2022-12-13 19:19:07,991 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2022-12-13 19:19:07,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1848 conditions, 961 events. 453/961 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6291 event pairs, 67 based on Foata normal form. 0/737 useless extension candidates. Maximal degree in co-relation 1837. Up to 184 conditions per place. [2022-12-13 19:19:07,998 INFO L137 encePairwiseOnDemand]: 275/279 looper letters, 55 selfloop transitions, 7 changer transitions 0/75 dead transitions. [2022-12-13 19:19:07,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 75 transitions, 330 flow [2022-12-13 19:19:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 19:19:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 19:19:08,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 883 transitions. [2022-12-13 19:19:08,001 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45212493599590375 [2022-12-13 19:19:08,001 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 883 transitions. [2022-12-13 19:19:08,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 883 transitions. [2022-12-13 19:19:08,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:08,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 883 transitions. [2022-12-13 19:19:08,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.14285714285714) internal successors, (883), 7 states have internal predecessors, (883), 0 states have call successors, (0), 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 19:19:08,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 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 19:19:08,007 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 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 19:19:08,008 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 82 flow. Second operand 7 states and 883 transitions. [2022-12-13 19:19:08,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 75 transitions, 330 flow [2022-12-13 19:19:08,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 75 transitions, 329 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:19:08,010 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 127 flow [2022-12-13 19:19:08,010 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=127, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2022-12-13 19:19:08,010 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-13 19:19:08,010 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 127 flow [2022-12-13 19:19:08,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 118.63636363636364) internal successors, (1305), 11 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 19:19:08,011 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:08,011 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2022-12-13 19:19:08,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 19:19:08,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:08,212 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-12-13 19:19:08,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:08,212 INFO L85 PathProgramCache]: Analyzing trace with hash 953681747, now seen corresponding path program 2 times [2022-12-13 19:19:08,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:08,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970974229] [2022-12-13 19:19:08,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:08,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:19:08,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:08,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970974229] [2022-12-13 19:19:08,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970974229] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:19:08,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464366596] [2022-12-13 19:19:08,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:19:08,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:08,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:19:08,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:19:08,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 19:19:08,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:19:08,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:19:08,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 19:19:08,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:19:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:19:08,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:19:08,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464366596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:08,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 19:19:08,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-13 19:19:08,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197202885] [2022-12-13 19:19:08,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:08,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:19:08,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:08,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:19:08,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:19:08,341 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 279 [2022-12-13 19:19:08,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 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 19:19:08,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:08,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 279 [2022-12-13 19:19:08,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:08,451 INFO L130 PetriNetUnfolder]: 217/488 cut-off events. [2022-12-13 19:19:08,451 INFO L131 PetriNetUnfolder]: For 94/94 co-relation queries the response was YES. [2022-12-13 19:19:08,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 488 events. 217/488 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2850 event pairs, 5 based on Foata normal form. 28/444 useless extension candidates. Maximal degree in co-relation 980. Up to 238 conditions per place. [2022-12-13 19:19:08,453 INFO L137 encePairwiseOnDemand]: 275/279 looper letters, 37 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2022-12-13 19:19:08,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 238 flow [2022-12-13 19:19:08,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:19:08,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:19:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 643 transitions. [2022-12-13 19:19:08,455 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46093189964157705 [2022-12-13 19:19:08,455 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 643 transitions. [2022-12-13 19:19:08,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 643 transitions. [2022-12-13 19:19:08,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:08,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 643 transitions. [2022-12-13 19:19:08,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 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 19:19:08,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 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 19:19:08,457 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 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 19:19:08,457 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 127 flow. Second operand 5 states and 643 transitions. [2022-12-13 19:19:08,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 238 flow [2022-12-13 19:19:08,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 229 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-13 19:19:08,459 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 97 flow [2022-12-13 19:19:08,459 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2022-12-13 19:19:08,459 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-13 19:19:08,459 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 97 flow [2022-12-13 19:19:08,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 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 19:19:08,460 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:08,460 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:08,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 19:19:08,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:08,660 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-12-13 19:19:08,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:08,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1512178434, now seen corresponding path program 1 times [2022-12-13 19:19:08,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:08,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709616160] [2022-12-13 19:19:08,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:08,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:19:08,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:08,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709616160] [2022-12-13 19:19:08,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709616160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:08,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:08,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:19:08,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831659608] [2022-12-13 19:19:08,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:08,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:19:08,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:08,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:19:08,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:19:08,805 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 279 [2022-12-13 19:19:08,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 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 19:19:08,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:08,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 279 [2022-12-13 19:19:08,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:08,925 INFO L130 PetriNetUnfolder]: 345/771 cut-off events. [2022-12-13 19:19:08,925 INFO L131 PetriNetUnfolder]: For 392/392 co-relation queries the response was YES. [2022-12-13 19:19:08,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1627 conditions, 771 events. 345/771 cut-off events. For 392/392 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4813 event pairs, 167 based on Foata normal form. 0/660 useless extension candidates. Maximal degree in co-relation 1619. Up to 329 conditions per place. [2022-12-13 19:19:08,929 INFO L137 encePairwiseOnDemand]: 275/279 looper letters, 26 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2022-12-13 19:19:08,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 203 flow [2022-12-13 19:19:08,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:19:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:19:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2022-12-13 19:19:08,931 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.449820788530466 [2022-12-13 19:19:08,931 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2022-12-13 19:19:08,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2022-12-13 19:19:08,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:08,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2022-12-13 19:19:08,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:08,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 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 19:19:08,935 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 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 19:19:08,935 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 97 flow. Second operand 4 states and 502 transitions. [2022-12-13 19:19:08,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 203 flow [2022-12-13 19:19:08,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 181 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 19:19:08,937 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 100 flow [2022-12-13 19:19:08,937 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2022-12-13 19:19:08,938 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-12-13 19:19:08,938 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 100 flow [2022-12-13 19:19:08,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 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 19:19:08,938 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:08,938 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:08,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 19:19:08,939 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-12-13 19:19:08,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:08,939 INFO L85 PathProgramCache]: Analyzing trace with hash -367106021, now seen corresponding path program 1 times [2022-12-13 19:19:08,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:08,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047076826] [2022-12-13 19:19:08,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:08,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:19:09,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:09,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047076826] [2022-12-13 19:19:09,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047076826] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:19:09,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514481821] [2022-12-13 19:19:09,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:09,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:09,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:19:09,089 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:19:09,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 19:19:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:09,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 19:19:09,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:19:09,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:19:09,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:19:09,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:19:09,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:19:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:19:09,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514481821] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:19:09,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:19:09,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 19:19:09,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045365459] [2022-12-13 19:19:09,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:19:09,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 19:19:09,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:09,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 19:19:09,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:19:09,581 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 279 [2022-12-13 19:19:09,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 100 flow. Second operand has 11 states, 11 states have (on average 119.9090909090909) internal successors, (1319), 11 states have internal predecessors, (1319), 0 states have call successors, (0), 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 19:19:09,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:09,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 279 [2022-12-13 19:19:09,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:09,814 INFO L130 PetriNetUnfolder]: 477/1063 cut-off events. [2022-12-13 19:19:09,814 INFO L131 PetriNetUnfolder]: For 251/251 co-relation queries the response was YES. [2022-12-13 19:19:09,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 1063 events. 477/1063 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7244 event pairs, 139 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 2178. Up to 281 conditions per place. [2022-12-13 19:19:09,819 INFO L137 encePairwiseOnDemand]: 275/279 looper letters, 44 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2022-12-13 19:19:09,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 301 flow [2022-12-13 19:19:09,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:19:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 19:19:09,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2022-12-13 19:19:09,821 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44802867383512546 [2022-12-13 19:19:09,821 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 750 transitions. [2022-12-13 19:19:09,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions. [2022-12-13 19:19:09,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:09,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions. [2022-12-13 19:19:09,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 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 19:19:09,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 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 19:19:09,824 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 279.0) internal successors, (1953), 7 states have internal predecessors, (1953), 0 states have call successors, (0), 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 19:19:09,825 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 100 flow. Second operand 6 states and 750 transitions. [2022-12-13 19:19:09,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 301 flow [2022-12-13 19:19:09,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 297 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:19:09,827 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 114 flow [2022-12-13 19:19:09,827 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2022-12-13 19:19:09,827 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-12-13 19:19:09,827 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 114 flow [2022-12-13 19:19:09,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 119.9090909090909) internal successors, (1319), 11 states have internal predecessors, (1319), 0 states have call successors, (0), 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 19:19:09,828 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:09,828 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:09,833 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 19:19:10,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 19:19:10,029 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-12-13 19:19:10,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:10,029 INFO L85 PathProgramCache]: Analyzing trace with hash -134782851, now seen corresponding path program 1 times [2022-12-13 19:19:10,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:10,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037978694] [2022-12-13 19:19:10,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:10,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:19:10,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:10,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037978694] [2022-12-13 19:19:10,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037978694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:10,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:10,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:19:10,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053752890] [2022-12-13 19:19:10,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:10,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:19:10,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:10,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:19:10,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:19:10,066 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 279 [2022-12-13 19:19:10,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 19:19:10,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:10,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 279 [2022-12-13 19:19:10,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:10,217 INFO L130 PetriNetUnfolder]: 869/1764 cut-off events. [2022-12-13 19:19:10,217 INFO L131 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-12-13 19:19:10,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3822 conditions, 1764 events. 869/1764 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 12700 event pairs, 403 based on Foata normal form. 0/1611 useless extension candidates. Maximal degree in co-relation 3812. Up to 890 conditions per place. [2022-12-13 19:19:10,227 INFO L137 encePairwiseOnDemand]: 274/279 looper letters, 33 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2022-12-13 19:19:10,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 241 flow [2022-12-13 19:19:10,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2022-12-13 19:19:10,228 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45758661887694146 [2022-12-13 19:19:10,228 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2022-12-13 19:19:10,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2022-12-13 19:19:10,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:10,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2022-12-13 19:19:10,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 19:19:10,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 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 19:19:10,230 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 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 19:19:10,230 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 114 flow. Second operand 3 states and 383 transitions. [2022-12-13 19:19:10,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 241 flow [2022-12-13 19:19:10,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 232 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 19:19:10,232 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 135 flow [2022-12-13 19:19:10,233 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2022-12-13 19:19:10,233 INFO L288 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2022-12-13 19:19:10,233 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 135 flow [2022-12-13 19:19:10,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 19:19:10,234 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:10,234 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-12-13 19:19:10,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 19:19:10,234 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2022-12-13 19:19:10,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1495618849, now seen corresponding path program 1 times [2022-12-13 19:19:10,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:10,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424825561] [2022-12-13 19:19:10,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:10,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:19:10,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:19:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:19:10,250 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:19:10,250 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 19:19:10,250 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2022-12-13 19:19:10,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2022-12-13 19:19:10,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-13 19:19:10,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (9 of 13 remaining) [2022-12-13 19:19:10,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-13 19:19:10,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-13 19:19:10,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (6 of 13 remaining) [2022-12-13 19:19:10,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-13 19:19:10,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2022-12-13 19:19:10,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2022-12-13 19:19:10,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2022-12-13 19:19:10,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2022-12-13 19:19:10,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-13 19:19:10,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 19:19:10,252 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:10,253 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 19:19:10,253 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-12-13 19:19:10,273 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 19:19:10,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 193 transitions, 407 flow [2022-12-13 19:19:10,295 INFO L130 PetriNetUnfolder]: 25/245 cut-off events. [2022-12-13 19:19:10,296 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 19:19:10,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 245 events. 25/245 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 683 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 181. Up to 8 conditions per place. [2022-12-13 19:19:10,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 193 transitions, 407 flow [2022-12-13 19:19:10,298 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 193 transitions, 407 flow [2022-12-13 19:19:10,298 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 19:19:10,298 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 193 transitions, 407 flow [2022-12-13 19:19:10,299 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 193 transitions, 407 flow [2022-12-13 19:19:10,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 193 transitions, 407 flow [2022-12-13 19:19:10,317 INFO L130 PetriNetUnfolder]: 25/245 cut-off events. [2022-12-13 19:19:10,317 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 19:19:10,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 245 events. 25/245 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 683 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 181. Up to 8 conditions per place. [2022-12-13 19:19:10,324 INFO L119 LiptonReduction]: Number of co-enabled transitions 20286 [2022-12-13 19:19:12,964 INFO L134 LiptonReduction]: Checked pairs total: 29239 [2022-12-13 19:19:12,964 INFO L136 LiptonReduction]: Total number of compositions: 183 [2022-12-13 19:19:12,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:19:12,966 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@64312577, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:19:12,966 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 19:19:12,966 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 19:19:12,966 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:19:12,966 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:12,966 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 19:19:12,966 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:12,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:12,967 INFO L85 PathProgramCache]: Analyzing trace with hash 38667, now seen corresponding path program 1 times [2022-12-13 19:19:12,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:12,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105501073] [2022-12-13 19:19:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:12,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:12,971 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 19:19:12,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:12,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105501073] [2022-12-13 19:19:12,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105501073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:12,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:12,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:19:12,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055898566] [2022-12-13 19:19:12,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:12,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 19:19:12,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:12,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 19:19:12,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 19:19:12,972 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 376 [2022-12-13 19:19:12,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 54 transitions, 129 flow. Second operand has 2 states, 2 states have (on average 171.0) internal successors, (342), 2 states have internal predecessors, (342), 0 states have call successors, (0), 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 19:19:12,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:12,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 376 [2022-12-13 19:19:12,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:13,417 INFO L130 PetriNetUnfolder]: 4422/7074 cut-off events. [2022-12-13 19:19:13,417 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2022-12-13 19:19:13,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13218 conditions, 7074 events. 4422/7074 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 48457 event pairs, 3546 based on Foata normal form. 640/4685 useless extension candidates. Maximal degree in co-relation 1429. Up to 5795 conditions per place. [2022-12-13 19:19:13,447 INFO L137 encePairwiseOnDemand]: 368/376 looper letters, 28 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2022-12-13 19:19:13,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 169 flow [2022-12-13 19:19:13,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 19:19:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 19:19:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 376 transitions. [2022-12-13 19:19:13,450 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 19:19:13,450 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 376 transitions. [2022-12-13 19:19:13,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 376 transitions. [2022-12-13 19:19:13,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:13,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 376 transitions. [2022-12-13 19:19:13,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 188.0) internal successors, (376), 2 states have internal predecessors, (376), 0 states have call successors, (0), 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 19:19:13,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 376.0) internal successors, (1128), 3 states have internal predecessors, (1128), 0 states have call successors, (0), 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 19:19:13,452 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 376.0) internal successors, (1128), 3 states have internal predecessors, (1128), 0 states have call successors, (0), 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 19:19:13,452 INFO L175 Difference]: Start difference. First operand has 49 places, 54 transitions, 129 flow. Second operand 2 states and 376 transitions. [2022-12-13 19:19:13,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 169 flow [2022-12-13 19:19:13,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 163 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-13 19:19:13,453 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 107 flow [2022-12-13 19:19:13,453 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=107, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2022-12-13 19:19:13,454 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2022-12-13 19:19:13,454 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 107 flow [2022-12-13 19:19:13,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 171.0) internal successors, (342), 2 states have internal predecessors, (342), 0 states have call successors, (0), 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 19:19:13,454 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:13,454 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 19:19:13,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 19:19:13,454 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:13,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:13,454 INFO L85 PathProgramCache]: Analyzing trace with hash 38662, now seen corresponding path program 1 times [2022-12-13 19:19:13,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:13,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115524770] [2022-12-13 19:19:13,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:13,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:13,473 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 19:19:13,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:13,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115524770] [2022-12-13 19:19:13,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115524770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:13,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:13,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:19:13,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594230261] [2022-12-13 19:19:13,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:13,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:19:13,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:13,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:19:13,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:19:13,495 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 376 [2022-12-13 19:19:13,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:13,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:13,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 376 [2022-12-13 19:19:13,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:13,886 INFO L130 PetriNetUnfolder]: 3231/5255 cut-off events. [2022-12-13 19:19:13,886 INFO L131 PetriNetUnfolder]: For 154/154 co-relation queries the response was YES. [2022-12-13 19:19:13,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9733 conditions, 5255 events. 3231/5255 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 34666 event pairs, 2574 based on Foata normal form. 0/3169 useless extension candidates. Maximal degree in co-relation 9727. Up to 4260 conditions per place. [2022-12-13 19:19:13,903 INFO L137 encePairwiseOnDemand]: 374/376 looper letters, 26 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2022-12-13 19:19:13,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 159 flow [2022-12-13 19:19:13,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2022-12-13 19:19:13,906 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46631205673758863 [2022-12-13 19:19:13,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 526 transitions. [2022-12-13 19:19:13,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions. [2022-12-13 19:19:13,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:13,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions. [2022-12-13 19:19:13,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 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 19:19:13,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 0 states have call successors, (0), 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 19:19:13,908 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 0 states have call successors, (0), 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 19:19:13,908 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 107 flow. Second operand 3 states and 526 transitions. [2022-12-13 19:19:13,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 159 flow [2022-12-13 19:19:13,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 159 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 19:19:13,909 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 107 flow [2022-12-13 19:19:13,909 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2022-12-13 19:19:13,909 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2022-12-13 19:19:13,909 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 107 flow [2022-12-13 19:19:13,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:13,910 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:13,910 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 19:19:13,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 19:19:13,910 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:13,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:13,910 INFO L85 PathProgramCache]: Analyzing trace with hash 38661, now seen corresponding path program 1 times [2022-12-13 19:19:13,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:13,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173720916] [2022-12-13 19:19:13,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:13,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:13,921 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 19:19:13,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:13,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173720916] [2022-12-13 19:19:13,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173720916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:13,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:13,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:19:13,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438930483] [2022-12-13 19:19:13,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:13,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:19:13,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:13,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:19:13,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:19:13,946 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 376 [2022-12-13 19:19:13,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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 19:19:13,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:13,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 376 [2022-12-13 19:19:13,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:14,242 INFO L130 PetriNetUnfolder]: 2040/3436 cut-off events. [2022-12-13 19:19:14,242 INFO L131 PetriNetUnfolder]: For 154/154 co-relation queries the response was YES. [2022-12-13 19:19:14,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6382 conditions, 3436 events. 2040/3436 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 21578 event pairs, 1602 based on Foata normal form. 0/2293 useless extension candidates. Maximal degree in co-relation 6375. Up to 2726 conditions per place. [2022-12-13 19:19:14,258 INFO L137 encePairwiseOnDemand]: 374/376 looper letters, 25 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2022-12-13 19:19:14,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 157 flow [2022-12-13 19:19:14,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:14,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2022-12-13 19:19:14,259 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4601063829787234 [2022-12-13 19:19:14,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 519 transitions. [2022-12-13 19:19:14,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions. [2022-12-13 19:19:14,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:14,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions. [2022-12-13 19:19:14,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 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 19:19:14,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 0 states have call successors, (0), 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 19:19:14,262 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 0 states have call successors, (0), 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 19:19:14,262 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 107 flow. Second operand 3 states and 519 transitions. [2022-12-13 19:19:14,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 157 flow [2022-12-13 19:19:14,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:19:14,264 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 106 flow [2022-12-13 19:19:14,264 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-12-13 19:19:14,264 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2022-12-13 19:19:14,264 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 106 flow [2022-12-13 19:19:14,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 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 19:19:14,264 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:14,264 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 19:19:14,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 19:19:14,265 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:14,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:14,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1152715853, now seen corresponding path program 1 times [2022-12-13 19:19:14,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:14,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62507882] [2022-12-13 19:19:14,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:14,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:14,306 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 19:19:14,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:14,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62507882] [2022-12-13 19:19:14,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62507882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:14,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:14,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:19:14,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915983772] [2022-12-13 19:19:14,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:14,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:19:14,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:14,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:19:14,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:19:14,349 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 376 [2022-12-13 19:19:14,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 158.25) internal successors, (633), 4 states have internal predecessors, (633), 0 states have call successors, (0), 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 19:19:14,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:14,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 376 [2022-12-13 19:19:14,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:14,549 INFO L130 PetriNetUnfolder]: 1323/2287 cut-off events. [2022-12-13 19:19:14,549 INFO L131 PetriNetUnfolder]: For 114/114 co-relation queries the response was YES. [2022-12-13 19:19:14,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4209 conditions, 2287 events. 1323/2287 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13461 event pairs, 995 based on Foata normal form. 0/1674 useless extension candidates. Maximal degree in co-relation 4202. Up to 1755 conditions per place. [2022-12-13 19:19:14,558 INFO L137 encePairwiseOnDemand]: 372/376 looper letters, 22 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2022-12-13 19:19:14,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 146 flow [2022-12-13 19:19:14,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:14,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2022-12-13 19:19:14,559 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44060283687943264 [2022-12-13 19:19:14,560 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2022-12-13 19:19:14,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2022-12-13 19:19:14,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:14,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2022-12-13 19:19:14,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 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 19:19:14,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 0 states have call successors, (0), 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 19:19:14,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 0 states have call successors, (0), 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 19:19:14,562 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 106 flow. Second operand 3 states and 497 transitions. [2022-12-13 19:19:14,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 146 flow [2022-12-13 19:19:14,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 41 transitions, 145 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:19:14,562 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 101 flow [2022-12-13 19:19:14,562 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2022-12-13 19:19:14,563 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2022-12-13 19:19:14,563 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 101 flow [2022-12-13 19:19:14,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.25) internal successors, (633), 4 states have internal predecessors, (633), 0 states have call successors, (0), 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 19:19:14,563 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:14,563 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 19:19:14,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 19:19:14,563 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:14,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:14,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1152715854, now seen corresponding path program 1 times [2022-12-13 19:19:14,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:14,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111584191] [2022-12-13 19:19:14,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:14,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:14,623 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 19:19:14,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:14,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111584191] [2022-12-13 19:19:14,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111584191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:14,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:14,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:19:14,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87251251] [2022-12-13 19:19:14,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:14,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:19:14,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:14,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:19:14,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:19:14,690 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 376 [2022-12-13 19:19:14,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 163.25) internal successors, (653), 4 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:14,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:14,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 376 [2022-12-13 19:19:14,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:14,984 INFO L130 PetriNetUnfolder]: 2231/3875 cut-off events. [2022-12-13 19:19:14,984 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2022-12-13 19:19:14,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7050 conditions, 3875 events. 2231/3875 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26209 event pairs, 995 based on Foata normal form. 0/2883 useless extension candidates. Maximal degree in co-relation 7043. Up to 1755 conditions per place. [2022-12-13 19:19:14,997 INFO L137 encePairwiseOnDemand]: 372/376 looper letters, 39 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2022-12-13 19:19:14,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 233 flow [2022-12-13 19:19:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:19:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:19:14,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 691 transitions. [2022-12-13 19:19:14,999 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45944148936170215 [2022-12-13 19:19:14,999 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 691 transitions. [2022-12-13 19:19:14,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 691 transitions. [2022-12-13 19:19:14,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:14,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 691 transitions. [2022-12-13 19:19:15,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 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 19:19:15,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 376.0) internal successors, (1880), 5 states have internal predecessors, (1880), 0 states have call successors, (0), 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 19:19:15,001 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 376.0) internal successors, (1880), 5 states have internal predecessors, (1880), 0 states have call successors, (0), 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 19:19:15,001 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 101 flow. Second operand 4 states and 691 transitions. [2022-12-13 19:19:15,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 233 flow [2022-12-13 19:19:15,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:19:15,002 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 114 flow [2022-12-13 19:19:15,003 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2022-12-13 19:19:15,003 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2022-12-13 19:19:15,003 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 114 flow [2022-12-13 19:19:15,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.25) internal successors, (653), 4 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:15,003 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:15,003 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 19:19:15,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 19:19:15,003 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:15,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:15,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1374458078, now seen corresponding path program 1 times [2022-12-13 19:19:15,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:15,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972799018] [2022-12-13 19:19:15,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:15,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:19:15,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:15,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972799018] [2022-12-13 19:19:15,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972799018] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:19:15,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233223087] [2022-12-13 19:19:15,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:15,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:15,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:19:15,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:19:15,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 19:19:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:15,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 19:19:15,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:19:15,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:19:15,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:19:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:19:15,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:19:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:19:15,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233223087] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:19:15,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:19:15,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 19:19:15,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277580034] [2022-12-13 19:19:15,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:19:15,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 19:19:15,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:15,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 19:19:15,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:19:15,544 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 376 [2022-12-13 19:19:15,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 114 flow. Second operand has 11 states, 11 states have (on average 162.63636363636363) internal successors, (1789), 11 states have internal predecessors, (1789), 0 states have call successors, (0), 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 19:19:15,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:15,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 376 [2022-12-13 19:19:15,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:16,229 INFO L130 PetriNetUnfolder]: 3111/5357 cut-off events. [2022-12-13 19:19:16,230 INFO L131 PetriNetUnfolder]: For 660/660 co-relation queries the response was YES. [2022-12-13 19:19:16,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10302 conditions, 5357 events. 3111/5357 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 38354 event pairs, 1005 based on Foata normal form. 0/4277 useless extension candidates. Maximal degree in co-relation 10294. Up to 1755 conditions per place. [2022-12-13 19:19:16,247 INFO L137 encePairwiseOnDemand]: 372/376 looper letters, 57 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2022-12-13 19:19:16,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 79 transitions, 332 flow [2022-12-13 19:19:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:19:16,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:19:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 867 transitions. [2022-12-13 19:19:16,249 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46117021276595743 [2022-12-13 19:19:16,249 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 867 transitions. [2022-12-13 19:19:16,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 867 transitions. [2022-12-13 19:19:16,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:16,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 867 transitions. [2022-12-13 19:19:16,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.4) internal successors, (867), 5 states have internal predecessors, (867), 0 states have call successors, (0), 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 19:19:16,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 376.0) internal successors, (2256), 6 states have internal predecessors, (2256), 0 states have call successors, (0), 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 19:19:16,252 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 376.0) internal successors, (2256), 6 states have internal predecessors, (2256), 0 states have call successors, (0), 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 19:19:16,252 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 114 flow. Second operand 5 states and 867 transitions. [2022-12-13 19:19:16,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 79 transitions, 332 flow [2022-12-13 19:19:16,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:19:16,253 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 128 flow [2022-12-13 19:19:16,253 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-13 19:19:16,254 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2022-12-13 19:19:16,254 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 128 flow [2022-12-13 19:19:16,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 162.63636363636363) internal successors, (1789), 11 states have internal predecessors, (1789), 0 states have call successors, (0), 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 19:19:16,254 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:16,254 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2022-12-13 19:19:16,259 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 19:19:16,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 19:19:16,456 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:16,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:16,457 INFO L85 PathProgramCache]: Analyzing trace with hash -341467570, now seen corresponding path program 2 times [2022-12-13 19:19:16,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:16,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775143616] [2022-12-13 19:19:16,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:16,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:16,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:19:16,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:16,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775143616] [2022-12-13 19:19:16,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775143616] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:19:16,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992126573] [2022-12-13 19:19:16,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:19:16,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:16,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:19:16,523 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:19:16,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 19:19:16,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:19:16,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:19:16,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 19:19:16,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:19:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:19:16,597 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:19:16,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992126573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:16,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 19:19:16,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-13 19:19:16,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089364119] [2022-12-13 19:19:16,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:16,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:19:16,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:16,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:19:16,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:19:16,610 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 376 [2022-12-13 19:19:16,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 0 states have call successors, (0), 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 19:19:16,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:16,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 376 [2022-12-13 19:19:16,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:17,022 INFO L130 PetriNetUnfolder]: 2865/5136 cut-off events. [2022-12-13 19:19:17,022 INFO L131 PetriNetUnfolder]: For 789/789 co-relation queries the response was YES. [2022-12-13 19:19:17,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9744 conditions, 5136 events. 2865/5136 cut-off events. For 789/789 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 39098 event pairs, 103 based on Foata normal form. 86/4267 useless extension candidates. Maximal degree in co-relation 9735. Up to 2920 conditions per place. [2022-12-13 19:19:17,040 INFO L137 encePairwiseOnDemand]: 372/376 looper letters, 65 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2022-12-13 19:19:17,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 88 transitions, 380 flow [2022-12-13 19:19:17,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:19:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:19:17,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 887 transitions. [2022-12-13 19:19:17,042 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4718085106382979 [2022-12-13 19:19:17,042 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 887 transitions. [2022-12-13 19:19:17,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 887 transitions. [2022-12-13 19:19:17,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:17,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 887 transitions. [2022-12-13 19:19:17,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 177.4) internal successors, (887), 5 states have internal predecessors, (887), 0 states have call successors, (0), 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 19:19:17,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 376.0) internal successors, (2256), 6 states have internal predecessors, (2256), 0 states have call successors, (0), 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 19:19:17,046 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 376.0) internal successors, (2256), 6 states have internal predecessors, (2256), 0 states have call successors, (0), 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 19:19:17,046 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 128 flow. Second operand 5 states and 887 transitions. [2022-12-13 19:19:17,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 88 transitions, 380 flow [2022-12-13 19:19:17,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 88 transitions, 368 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-13 19:19:17,048 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 120 flow [2022-12-13 19:19:17,048 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2022-12-13 19:19:17,048 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2022-12-13 19:19:17,048 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 120 flow [2022-12-13 19:19:17,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 0 states have call successors, (0), 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 19:19:17,049 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:17,049 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:17,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 19:19:17,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:17,250 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:17,251 INFO L85 PathProgramCache]: Analyzing trace with hash -444003700, now seen corresponding path program 1 times [2022-12-13 19:19:17,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:17,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639246040] [2022-12-13 19:19:17,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:17,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:17,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:19:17,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:17,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639246040] [2022-12-13 19:19:17,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639246040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:17,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:17,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:19:17,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942316881] [2022-12-13 19:19:17,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:17,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:19:17,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:17,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:19:17,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:19:17,400 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 376 [2022-12-13 19:19:17,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 163.5) internal successors, (654), 4 states have internal predecessors, (654), 0 states have call successors, (0), 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 19:19:17,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:17,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 376 [2022-12-13 19:19:17,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:17,921 INFO L130 PetriNetUnfolder]: 4651/8096 cut-off events. [2022-12-13 19:19:17,921 INFO L131 PetriNetUnfolder]: For 1812/1812 co-relation queries the response was YES. [2022-12-13 19:19:17,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15891 conditions, 8096 events. 4651/8096 cut-off events. For 1812/1812 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 62548 event pairs, 2255 based on Foata normal form. 0/6576 useless extension candidates. Maximal degree in co-relation 15884. Up to 3713 conditions per place. [2022-12-13 19:19:17,952 INFO L137 encePairwiseOnDemand]: 372/376 looper letters, 42 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2022-12-13 19:19:17,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 271 flow [2022-12-13 19:19:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:19:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:19:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 688 transitions. [2022-12-13 19:19:17,953 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4574468085106383 [2022-12-13 19:19:17,953 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 688 transitions. [2022-12-13 19:19:17,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 688 transitions. [2022-12-13 19:19:17,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:17,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 688 transitions. [2022-12-13 19:19:17,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 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 19:19:17,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 376.0) internal successors, (1880), 5 states have internal predecessors, (1880), 0 states have call successors, (0), 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 19:19:17,956 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 376.0) internal successors, (1880), 5 states have internal predecessors, (1880), 0 states have call successors, (0), 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 19:19:17,956 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 120 flow. Second operand 4 states and 688 transitions. [2022-12-13 19:19:17,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 271 flow [2022-12-13 19:19:17,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 63 transitions, 253 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 19:19:17,957 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 125 flow [2022-12-13 19:19:17,957 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2022-12-13 19:19:17,957 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2022-12-13 19:19:17,957 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 125 flow [2022-12-13 19:19:17,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.5) internal successors, (654), 4 states have internal predecessors, (654), 0 states have call successors, (0), 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 19:19:17,957 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:17,958 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:17,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 19:19:17,958 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:17,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:17,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1813773883, now seen corresponding path program 1 times [2022-12-13 19:19:17,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:17,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034203389] [2022-12-13 19:19:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:17,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:17,971 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 19:19:17,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:17,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034203389] [2022-12-13 19:19:17,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034203389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:17,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:17,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:19:17,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434671205] [2022-12-13 19:19:17,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:17,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:19:17,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:17,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:19:17,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:19:17,982 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 376 [2022-12-13 19:19:17,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:17,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:17,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 376 [2022-12-13 19:19:17,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:18,340 INFO L130 PetriNetUnfolder]: 2537/4257 cut-off events. [2022-12-13 19:19:18,340 INFO L131 PetriNetUnfolder]: For 959/959 co-relation queries the response was YES. [2022-12-13 19:19:18,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8857 conditions, 4257 events. 2537/4257 cut-off events. For 959/959 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 27810 event pairs, 1707 based on Foata normal form. 142/3808 useless extension candidates. Maximal degree in co-relation 8849. Up to 2908 conditions per place. [2022-12-13 19:19:18,356 INFO L137 encePairwiseOnDemand]: 373/376 looper letters, 39 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2022-12-13 19:19:18,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 255 flow [2022-12-13 19:19:18,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:18,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2022-12-13 19:19:18,357 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47074468085106386 [2022-12-13 19:19:18,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 531 transitions. [2022-12-13 19:19:18,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions. [2022-12-13 19:19:18,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:18,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions. [2022-12-13 19:19:18,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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 19:19:18,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 0 states have call successors, (0), 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 19:19:18,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 0 states have call successors, (0), 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 19:19:18,359 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 125 flow. Second operand 3 states and 531 transitions. [2022-12-13 19:19:18,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 255 flow [2022-12-13 19:19:18,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:19:18,360 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 121 flow [2022-12-13 19:19:18,361 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2022-12-13 19:19:18,361 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2022-12-13 19:19:18,361 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 121 flow [2022-12-13 19:19:18,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:18,361 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:18,361 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:18,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 19:19:18,361 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:18,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:18,361 INFO L85 PathProgramCache]: Analyzing trace with hash -879207796, now seen corresponding path program 1 times [2022-12-13 19:19:18,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:18,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319769289] [2022-12-13 19:19:18,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:18,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:19:18,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:18,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319769289] [2022-12-13 19:19:18,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319769289] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:19:18,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533367946] [2022-12-13 19:19:18,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:18,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:18,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:19:18,476 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:19:18,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 19:19:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:18,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 19:19:18,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:19:18,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:19:18,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:19:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:19:18,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:19:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:19:18,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533367946] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:19:18,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:19:18,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 19:19:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061680163] [2022-12-13 19:19:18,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:19:18,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 19:19:18,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:18,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 19:19:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:19:18,990 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 376 [2022-12-13 19:19:18,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 121 flow. Second operand has 11 states, 11 states have (on average 162.9090909090909) internal successors, (1792), 11 states have internal predecessors, (1792), 0 states have call successors, (0), 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 19:19:18,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:18,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 376 [2022-12-13 19:19:18,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:19,543 INFO L130 PetriNetUnfolder]: 3629/6201 cut-off events. [2022-12-13 19:19:19,543 INFO L131 PetriNetUnfolder]: For 1278/1278 co-relation queries the response was YES. [2022-12-13 19:19:19,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12758 conditions, 6201 events. 3629/6201 cut-off events. For 1278/1278 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 44754 event pairs, 1175 based on Foata normal form. 0/5398 useless extension candidates. Maximal degree in co-relation 12750. Up to 2047 conditions per place. [2022-12-13 19:19:19,568 INFO L137 encePairwiseOnDemand]: 372/376 looper letters, 58 selfloop transitions, 4 changer transitions 0/80 dead transitions. [2022-12-13 19:19:19,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 80 transitions, 349 flow [2022-12-13 19:19:19,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:19:19,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:19:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 862 transitions. [2022-12-13 19:19:19,571 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45851063829787236 [2022-12-13 19:19:19,571 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 862 transitions. [2022-12-13 19:19:19,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 862 transitions. [2022-12-13 19:19:19,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:19,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 862 transitions. [2022-12-13 19:19:19,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.4) internal successors, (862), 5 states have internal predecessors, (862), 0 states have call successors, (0), 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 19:19:19,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 376.0) internal successors, (2256), 6 states have internal predecessors, (2256), 0 states have call successors, (0), 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 19:19:19,573 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 376.0) internal successors, (2256), 6 states have internal predecessors, (2256), 0 states have call successors, (0), 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 19:19:19,573 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 121 flow. Second operand 5 states and 862 transitions. [2022-12-13 19:19:19,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 80 transitions, 349 flow [2022-12-13 19:19:19,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 80 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:19:19,575 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 135 flow [2022-12-13 19:19:19,575 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2022-12-13 19:19:19,575 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2022-12-13 19:19:19,576 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 135 flow [2022-12-13 19:19:19,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 162.9090909090909) internal successors, (1792), 11 states have internal predecessors, (1792), 0 states have call successors, (0), 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 19:19:19,576 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:19,576 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:19,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 19:19:19,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 19:19:19,777 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:19,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:19,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2040970837, now seen corresponding path program 1 times [2022-12-13 19:19:19,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:19,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942000579] [2022-12-13 19:19:19,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:19,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:19:19,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:19,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942000579] [2022-12-13 19:19:19,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942000579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:19,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:19,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:19:19,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243238173] [2022-12-13 19:19:19,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:19,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:19:19,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:19,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:19:19,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:19:19,832 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 376 [2022-12-13 19:19:19,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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 19:19:19,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:19,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 376 [2022-12-13 19:19:19,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:20,604 INFO L130 PetriNetUnfolder]: 7620/12237 cut-off events. [2022-12-13 19:19:20,605 INFO L131 PetriNetUnfolder]: For 3100/3100 co-relation queries the response was YES. [2022-12-13 19:19:20,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25693 conditions, 12237 events. 7620/12237 cut-off events. For 3100/3100 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 90291 event pairs, 3942 based on Foata normal form. 0/10515 useless extension candidates. Maximal degree in co-relation 25684. Up to 7581 conditions per place. [2022-12-13 19:19:20,648 INFO L137 encePairwiseOnDemand]: 370/376 looper letters, 48 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2022-12-13 19:19:20,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 315 flow [2022-12-13 19:19:20,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2022-12-13 19:19:20,649 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4654255319148936 [2022-12-13 19:19:20,649 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2022-12-13 19:19:20,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2022-12-13 19:19:20,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:20,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2022-12-13 19:19:20,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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 19:19:20,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 0 states have call successors, (0), 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 19:19:20,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 0 states have call successors, (0), 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 19:19:20,652 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 135 flow. Second operand 3 states and 525 transitions. [2022-12-13 19:19:20,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 315 flow [2022-12-13 19:19:20,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 301 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 19:19:20,654 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 161 flow [2022-12-13 19:19:20,654 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2022-12-13 19:19:20,655 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2022-12-13 19:19:20,655 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 161 flow [2022-12-13 19:19:20,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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 19:19:20,655 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:20,655 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:20,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 19:19:20,655 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:20,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1485632884, now seen corresponding path program 2 times [2022-12-13 19:19:20,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:20,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460709451] [2022-12-13 19:19:20,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:20,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:19:20,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:20,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460709451] [2022-12-13 19:19:20,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460709451] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:19:20,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748683005] [2022-12-13 19:19:20,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:19:20,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:20,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:19:20,685 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:19:20,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 19:19:20,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:19:20,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:19:20,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 19:19:20,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:19:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:19:20,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:19:20,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748683005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:20,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 19:19:20,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-13 19:19:20,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973214869] [2022-12-13 19:19:20,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:20,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:19:20,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:20,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:19:20,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:19:20,767 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 376 [2022-12-13 19:19:20,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:20,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:20,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 376 [2022-12-13 19:19:20,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:21,310 INFO L130 PetriNetUnfolder]: 4282/7831 cut-off events. [2022-12-13 19:19:21,310 INFO L131 PetriNetUnfolder]: For 1626/1714 co-relation queries the response was YES. [2022-12-13 19:19:21,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16061 conditions, 7831 events. 4282/7831 cut-off events. For 1626/1714 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 64024 event pairs, 155 based on Foata normal form. 112/7077 useless extension candidates. Maximal degree in co-relation 16051. Up to 4575 conditions per place. [2022-12-13 19:19:21,343 INFO L137 encePairwiseOnDemand]: 372/376 looper letters, 70 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2022-12-13 19:19:21,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 95 transitions, 447 flow [2022-12-13 19:19:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:19:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:19:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 880 transitions. [2022-12-13 19:19:21,344 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2022-12-13 19:19:21,345 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 880 transitions. [2022-12-13 19:19:21,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 880 transitions. [2022-12-13 19:19:21,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:21,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 880 transitions. [2022-12-13 19:19:21,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 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 19:19:21,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 376.0) internal successors, (2256), 6 states have internal predecessors, (2256), 0 states have call successors, (0), 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 19:19:21,347 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 376.0) internal successors, (2256), 6 states have internal predecessors, (2256), 0 states have call successors, (0), 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 19:19:21,347 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 161 flow. Second operand 5 states and 880 transitions. [2022-12-13 19:19:21,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 95 transitions, 447 flow [2022-12-13 19:19:21,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 95 transitions, 427 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 19:19:21,353 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 151 flow [2022-12-13 19:19:21,353 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 19:19:21,353 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2022-12-13 19:19:21,353 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 151 flow [2022-12-13 19:19:21,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:21,353 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:21,353 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:21,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 19:19:21,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 19:19:21,555 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:21,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash -230937993, now seen corresponding path program 1 times [2022-12-13 19:19:21,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:21,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564350844] [2022-12-13 19:19:21,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:21,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 19:19:21,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:21,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564350844] [2022-12-13 19:19:21,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564350844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:21,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:21,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:19:21,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660418727] [2022-12-13 19:19:21,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:21,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:19:21,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:21,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:19:21,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:19:21,703 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 376 [2022-12-13 19:19:21,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:21,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:21,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 376 [2022-12-13 19:19:21,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:22,474 INFO L130 PetriNetUnfolder]: 6924/12348 cut-off events. [2022-12-13 19:19:22,474 INFO L131 PetriNetUnfolder]: For 3177/3377 co-relation queries the response was YES. [2022-12-13 19:19:22,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25504 conditions, 12348 events. 6924/12348 cut-off events. For 3177/3377 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 102836 event pairs, 3285 based on Foata normal form. 0/10825 useless extension candidates. Maximal degree in co-relation 25496. Up to 5645 conditions per place. [2022-12-13 19:19:22,528 INFO L137 encePairwiseOnDemand]: 372/376 looper letters, 45 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2022-12-13 19:19:22,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 314 flow [2022-12-13 19:19:22,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:19:22,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:19:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 685 transitions. [2022-12-13 19:19:22,530 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4554521276595745 [2022-12-13 19:19:22,530 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 685 transitions. [2022-12-13 19:19:22,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 685 transitions. [2022-12-13 19:19:22,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:22,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 685 transitions. [2022-12-13 19:19:22,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.25) internal successors, (685), 4 states have internal predecessors, (685), 0 states have call successors, (0), 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 19:19:22,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 376.0) internal successors, (1880), 5 states have internal predecessors, (1880), 0 states have call successors, (0), 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 19:19:22,532 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 376.0) internal successors, (1880), 5 states have internal predecessors, (1880), 0 states have call successors, (0), 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 19:19:22,532 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 151 flow. Second operand 4 states and 685 transitions. [2022-12-13 19:19:22,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 314 flow [2022-12-13 19:19:22,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 296 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 19:19:22,535 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 156 flow [2022-12-13 19:19:22,535 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2022-12-13 19:19:22,535 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2022-12-13 19:19:22,535 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 156 flow [2022-12-13 19:19:22,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:22,535 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:22,535 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:22,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 19:19:22,536 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:22,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:22,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1857786827, now seen corresponding path program 1 times [2022-12-13 19:19:22,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:22,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888274543] [2022-12-13 19:19:22,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:22,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:19:22,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:22,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888274543] [2022-12-13 19:19:22,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888274543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:22,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:22,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:19:22,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915164211] [2022-12-13 19:19:22,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:22,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:19:22,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:22,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:19:22,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:19:22,562 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 376 [2022-12-13 19:19:22,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:22,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:22,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 376 [2022-12-13 19:19:22,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:22,974 INFO L130 PetriNetUnfolder]: 3529/5951 cut-off events. [2022-12-13 19:19:22,974 INFO L131 PetriNetUnfolder]: For 1436/1518 co-relation queries the response was YES. [2022-12-13 19:19:22,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13057 conditions, 5951 events. 3529/5951 cut-off events. For 1436/1518 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 41507 event pairs, 2335 based on Foata normal form. 182/5645 useless extension candidates. Maximal degree in co-relation 13048. Up to 4140 conditions per place. [2022-12-13 19:19:22,998 INFO L137 encePairwiseOnDemand]: 373/376 looper letters, 42 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2022-12-13 19:19:22,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 298 flow [2022-12-13 19:19:22,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:22,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2022-12-13 19:19:22,999 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2022-12-13 19:19:22,999 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2022-12-13 19:19:23,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2022-12-13 19:19:23,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:23,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2022-12-13 19:19:23,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 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 19:19:23,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 0 states have call successors, (0), 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 19:19:23,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 0 states have call successors, (0), 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 19:19:23,001 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 156 flow. Second operand 3 states and 528 transitions. [2022-12-13 19:19:23,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 298 flow [2022-12-13 19:19:23,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:19:23,005 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 152 flow [2022-12-13 19:19:23,005 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2022-12-13 19:19:23,005 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2022-12-13 19:19:23,005 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 152 flow [2022-12-13 19:19:23,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:23,005 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:23,005 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:23,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 19:19:23,006 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:23,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:23,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1430862547, now seen corresponding path program 1 times [2022-12-13 19:19:23,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:23,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468010606] [2022-12-13 19:19:23,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 19:19:23,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:23,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468010606] [2022-12-13 19:19:23,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468010606] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:19:23,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480288711] [2022-12-13 19:19:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:23,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:23,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:19:23,124 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:19:23,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 19:19:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:23,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 19:19:23,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:19:23,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:19:23,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:19:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 19:19:23,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:19:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 19:19:23,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480288711] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:19:23,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:19:23,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 19:19:23,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438692557] [2022-12-13 19:19:23,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:19:23,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 19:19:23,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:23,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 19:19:23,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:19:23,661 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 376 [2022-12-13 19:19:23,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 152 flow. Second operand has 11 states, 11 states have (on average 163.1818181818182) internal successors, (1795), 11 states have internal predecessors, (1795), 0 states have call successors, (0), 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 19:19:23,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:23,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 376 [2022-12-13 19:19:23,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:24,868 INFO L130 PetriNetUnfolder]: 7880/13938 cut-off events. [2022-12-13 19:19:24,868 INFO L131 PetriNetUnfolder]: For 3028/3218 co-relation queries the response was YES. [2022-12-13 19:19:24,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29684 conditions, 13938 events. 7880/13938 cut-off events. For 3028/3218 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 115839 event pairs, 1411 based on Foata normal form. 0/12865 useless extension candidates. Maximal degree in co-relation 29675. Up to 2553 conditions per place. [2022-12-13 19:19:24,922 INFO L137 encePairwiseOnDemand]: 372/376 looper letters, 100 selfloop transitions, 7 changer transitions 0/127 dead transitions. [2022-12-13 19:19:24,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 127 transitions, 606 flow [2022-12-13 19:19:24,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 19:19:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 19:19:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1211 transitions. [2022-12-13 19:19:24,924 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4601063829787234 [2022-12-13 19:19:24,924 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1211 transitions. [2022-12-13 19:19:24,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1211 transitions. [2022-12-13 19:19:24,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:24,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1211 transitions. [2022-12-13 19:19:24,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:24,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 376.0) internal successors, (3008), 8 states have internal predecessors, (3008), 0 states have call successors, (0), 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 19:19:24,927 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 376.0) internal successors, (3008), 8 states have internal predecessors, (3008), 0 states have call successors, (0), 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 19:19:24,927 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 152 flow. Second operand 7 states and 1211 transitions. [2022-12-13 19:19:24,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 127 transitions, 606 flow [2022-12-13 19:19:24,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 127 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:19:24,931 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 194 flow [2022-12-13 19:19:24,931 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=194, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2022-12-13 19:19:24,931 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2022-12-13 19:19:24,931 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 194 flow [2022-12-13 19:19:24,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 163.1818181818182) internal successors, (1795), 11 states have internal predecessors, (1795), 0 states have call successors, (0), 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 19:19:24,932 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:24,932 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:24,936 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 19:19:25,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:25,132 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:25,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:25,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1059830837, now seen corresponding path program 1 times [2022-12-13 19:19:25,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:25,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23605564] [2022-12-13 19:19:25,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:25,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:19:25,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:25,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23605564] [2022-12-13 19:19:25,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23605564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:25,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:25,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:19:25,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102131742] [2022-12-13 19:19:25,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:25,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:19:25,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:25,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:19:25,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:19:25,167 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 376 [2022-12-13 19:19:25,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 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 19:19:25,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:25,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 376 [2022-12-13 19:19:25,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:26,881 INFO L130 PetriNetUnfolder]: 15735/25717 cut-off events. [2022-12-13 19:19:26,881 INFO L131 PetriNetUnfolder]: For 8242/8428 co-relation queries the response was YES. [2022-12-13 19:19:26,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58374 conditions, 25717 events. 15735/25717 cut-off events. For 8242/8428 co-relation queries the response was YES. Maximal size of possible extension queue 1573. Compared 214115 event pairs, 7824 based on Foata normal form. 0/24007 useless extension candidates. Maximal degree in co-relation 58362. Up to 15083 conditions per place. [2022-12-13 19:19:27,039 INFO L137 encePairwiseOnDemand]: 370/376 looper letters, 58 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2022-12-13 19:19:27,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 77 transitions, 439 flow [2022-12-13 19:19:27,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2022-12-13 19:19:27,040 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4627659574468085 [2022-12-13 19:19:27,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2022-12-13 19:19:27,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2022-12-13 19:19:27,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:27,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2022-12-13 19:19:27,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 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 19:19:27,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 0 states have call successors, (0), 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 19:19:27,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 376.0) internal successors, (1504), 4 states have internal predecessors, (1504), 0 states have call successors, (0), 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 19:19:27,043 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 194 flow. Second operand 3 states and 522 transitions. [2022-12-13 19:19:27,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 77 transitions, 439 flow [2022-12-13 19:19:27,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 418 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 19:19:27,053 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 235 flow [2022-12-13 19:19:27,053 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=376, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2022-12-13 19:19:27,054 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2022-12-13 19:19:27,054 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 235 flow [2022-12-13 19:19:27,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 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 19:19:27,054 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:27,054 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-12-13 19:19:27,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 19:19:27,055 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2022-12-13 19:19:27,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:27,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1395018936, now seen corresponding path program 1 times [2022-12-13 19:19:27,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:27,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422678477] [2022-12-13 19:19:27,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:27,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:19:27,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:19:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:19:27,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:19:27,069 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 19:19:27,069 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2022-12-13 19:19:27,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2022-12-13 19:19:27,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 19:19:27,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (12 of 16 remaining) [2022-12-13 19:19:27,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 19:19:27,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 19:19:27,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (9 of 16 remaining) [2022-12-13 19:19:27,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 19:19:27,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 19:19:27,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2022-12-13 19:19:27,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2022-12-13 19:19:27,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2022-12-13 19:19:27,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (3 of 16 remaining) [2022-12-13 19:19:27,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2022-12-13 19:19:27,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2022-12-13 19:19:27,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 19:19:27,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 19:19:27,071 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:27,071 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 19:19:27,071 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-12-13 19:19:27,100 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 19:19:27,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 243 transitions, 518 flow [2022-12-13 19:19:27,142 INFO L130 PetriNetUnfolder]: 33/313 cut-off events. [2022-12-13 19:19:27,142 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 19:19:27,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 313 events. 33/313 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1013 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 253. Up to 10 conditions per place. [2022-12-13 19:19:27,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 243 transitions, 518 flow [2022-12-13 19:19:27,146 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 243 transitions, 518 flow [2022-12-13 19:19:27,146 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 19:19:27,146 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 243 transitions, 518 flow [2022-12-13 19:19:27,146 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 243 transitions, 518 flow [2022-12-13 19:19:27,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 243 transitions, 518 flow [2022-12-13 19:19:27,182 INFO L130 PetriNetUnfolder]: 33/313 cut-off events. [2022-12-13 19:19:27,182 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 19:19:27,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 313 events. 33/313 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1013 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 253. Up to 10 conditions per place. [2022-12-13 19:19:27,195 INFO L119 LiptonReduction]: Number of co-enabled transitions 36848 [2022-12-13 19:19:31,248 INFO L134 LiptonReduction]: Checked pairs total: 55025 [2022-12-13 19:19:31,249 INFO L136 LiptonReduction]: Total number of compositions: 236 [2022-12-13 19:19:31,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:19:31,250 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@64312577, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:19:31,250 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2022-12-13 19:19:31,250 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-13 19:19:31,250 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:19:31,250 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:31,251 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 19:19:31,251 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:19:31,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:31,251 INFO L85 PathProgramCache]: Analyzing trace with hash 55574, now seen corresponding path program 1 times [2022-12-13 19:19:31,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:31,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873032400] [2022-12-13 19:19:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:31,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:31,256 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 19:19:31,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:31,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873032400] [2022-12-13 19:19:31,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873032400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:31,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:31,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:19:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347846306] [2022-12-13 19:19:31,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:31,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 19:19:31,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:31,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 19:19:31,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 19:19:31,258 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 479 [2022-12-13 19:19:31,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 69 transitions, 170 flow. Second operand has 2 states, 2 states have (on average 214.0) internal successors, (428), 2 states have internal predecessors, (428), 0 states have call successors, (0), 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 19:19:31,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:31,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 479 [2022-12-13 19:19:31,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:34,969 INFO L130 PetriNetUnfolder]: 42152/60736 cut-off events. [2022-12-13 19:19:34,969 INFO L131 PetriNetUnfolder]: For 5321/5321 co-relation queries the response was YES. [2022-12-13 19:19:35,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115608 conditions, 60736 events. 42152/60736 cut-off events. For 5321/5321 co-relation queries the response was YES. Maximal size of possible extension queue 3465. Compared 452586 event pairs, 34416 based on Foata normal form. 6079/40805 useless extension candidates. Maximal degree in co-relation 13312. Up to 51757 conditions per place. [2022-12-13 19:19:35,262 INFO L137 encePairwiseOnDemand]: 469/479 looper letters, 36 selfloop transitions, 0 changer transitions 0/59 dead transitions. [2022-12-13 19:19:35,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 59 transitions, 222 flow [2022-12-13 19:19:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 19:19:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 19:19:35,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 472 transitions. [2022-12-13 19:19:35,263 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49269311064718163 [2022-12-13 19:19:35,263 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 472 transitions. [2022-12-13 19:19:35,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 472 transitions. [2022-12-13 19:19:35,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:35,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 472 transitions. [2022-12-13 19:19:35,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 236.0) internal successors, (472), 2 states have internal predecessors, (472), 0 states have call successors, (0), 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 19:19:35,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 479.0) internal successors, (1437), 3 states have internal predecessors, (1437), 0 states have call successors, (0), 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 19:19:35,265 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 479.0) internal successors, (1437), 3 states have internal predecessors, (1437), 0 states have call successors, (0), 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 19:19:35,265 INFO L175 Difference]: Start difference. First operand has 62 places, 69 transitions, 170 flow. Second operand 2 states and 472 transitions. [2022-12-13 19:19:35,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 59 transitions, 222 flow [2022-12-13 19:19:35,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 210 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-13 19:19:35,270 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 138 flow [2022-12-13 19:19:35,270 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=138, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2022-12-13 19:19:35,271 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2022-12-13 19:19:35,271 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 138 flow [2022-12-13 19:19:35,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 214.0) internal successors, (428), 2 states have internal predecessors, (428), 0 states have call successors, (0), 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 19:19:35,271 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:35,271 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 19:19:35,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 19:19:35,271 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:19:35,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:35,271 INFO L85 PathProgramCache]: Analyzing trace with hash 55558, now seen corresponding path program 1 times [2022-12-13 19:19:35,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:35,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209042869] [2022-12-13 19:19:35,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:35,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:35,282 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 19:19:35,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:35,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209042869] [2022-12-13 19:19:35,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209042869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:35,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:35,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:19:35,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911908101] [2022-12-13 19:19:35,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:35,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:19:35,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:35,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:19:35,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:19:35,305 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 479 [2022-12-13 19:19:35,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 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 19:19:35,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:35,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 479 [2022-12-13 19:19:35,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:38,230 INFO L130 PetriNetUnfolder]: 31014/45197 cut-off events. [2022-12-13 19:19:38,230 INFO L131 PetriNetUnfolder]: For 1099/1099 co-relation queries the response was YES. [2022-12-13 19:19:38,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84914 conditions, 45197 events. 31014/45197 cut-off events. For 1099/1099 co-relation queries the response was YES. Maximal size of possible extension queue 2521. Compared 329643 event pairs, 25212 based on Foata normal form. 0/26990 useless extension candidates. Maximal degree in co-relation 84907. Up to 38217 conditions per place. [2022-12-13 19:19:38,472 INFO L137 encePairwiseOnDemand]: 477/479 looper letters, 34 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2022-12-13 19:19:38,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 206 flow [2022-12-13 19:19:38,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 657 transitions. [2022-12-13 19:19:38,474 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4572025052192067 [2022-12-13 19:19:38,474 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 657 transitions. [2022-12-13 19:19:38,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 657 transitions. [2022-12-13 19:19:38,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:38,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 657 transitions. [2022-12-13 19:19:38,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 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 19:19:38,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:38,476 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:38,476 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 138 flow. Second operand 3 states and 657 transitions. [2022-12-13 19:19:38,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 206 flow [2022-12-13 19:19:38,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 206 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 19:19:38,477 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 138 flow [2022-12-13 19:19:38,478 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2022-12-13 19:19:38,478 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2022-12-13 19:19:38,478 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 138 flow [2022-12-13 19:19:38,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 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 19:19:38,478 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:38,478 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 19:19:38,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 19:19:38,478 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:19:38,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:38,479 INFO L85 PathProgramCache]: Analyzing trace with hash 55559, now seen corresponding path program 1 times [2022-12-13 19:19:38,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:38,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903936320] [2022-12-13 19:19:38,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:38,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:38,571 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 19:19:38,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:38,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903936320] [2022-12-13 19:19:38,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903936320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:38,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:38,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:19:38,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903720449] [2022-12-13 19:19:38,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:38,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:19:38,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:38,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:19:38,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:19:38,594 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 479 [2022-12-13 19:19:38,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 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 19:19:38,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:38,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 479 [2022-12-13 19:19:38,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:40,469 INFO L130 PetriNetUnfolder]: 19876/29658 cut-off events. [2022-12-13 19:19:40,469 INFO L131 PetriNetUnfolder]: For 1099/1099 co-relation queries the response was YES. [2022-12-13 19:19:40,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55838 conditions, 29658 events. 19876/29658 cut-off events. For 1099/1099 co-relation queries the response was YES. Maximal size of possible extension queue 1567. Compared 210446 event pairs, 16008 based on Foata normal form. 0/19254 useless extension candidates. Maximal degree in co-relation 55830. Up to 24678 conditions per place. [2022-12-13 19:19:40,640 INFO L137 encePairwiseOnDemand]: 477/479 looper letters, 33 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2022-12-13 19:19:40,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 57 transitions, 204 flow [2022-12-13 19:19:40,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2022-12-13 19:19:40,642 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4606819763395964 [2022-12-13 19:19:40,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 662 transitions. [2022-12-13 19:19:40,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 662 transitions. [2022-12-13 19:19:40,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:40,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 662 transitions. [2022-12-13 19:19:40,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 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 19:19:40,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:40,645 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:40,645 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 138 flow. Second operand 3 states and 662 transitions. [2022-12-13 19:19:40,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 57 transitions, 204 flow [2022-12-13 19:19:40,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 57 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:19:40,646 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 137 flow [2022-12-13 19:19:40,646 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2022-12-13 19:19:40,647 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2022-12-13 19:19:40,647 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 137 flow [2022-12-13 19:19:40,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 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 19:19:40,647 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:40,647 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 19:19:40,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 19:19:40,647 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:19:40,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1656567774, now seen corresponding path program 1 times [2022-12-13 19:19:40,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:40,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347364966] [2022-12-13 19:19:40,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:40,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:40,717 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 19:19:40,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:40,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347364966] [2022-12-13 19:19:40,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347364966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:40,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:40,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:19:40,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188372223] [2022-12-13 19:19:40,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:40,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:19:40,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:40,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:19:40,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:19:40,782 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 479 [2022-12-13 19:19:40,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 206.25) internal successors, (825), 4 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:40,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:40,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 479 [2022-12-13 19:19:40,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:43,430 INFO L130 PetriNetUnfolder]: 25410/36740 cut-off events. [2022-12-13 19:19:43,430 INFO L131 PetriNetUnfolder]: For 1441/1441 co-relation queries the response was YES. [2022-12-13 19:19:43,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70313 conditions, 36740 events. 25410/36740 cut-off events. For 1441/1441 co-relation queries the response was YES. Maximal size of possible extension queue 1906. Compared 258545 event pairs, 14590 based on Foata normal form. 0/23506 useless extension candidates. Maximal degree in co-relation 70305. Up to 24678 conditions per place. [2022-12-13 19:19:43,647 INFO L137 encePairwiseOnDemand]: 474/479 looper letters, 58 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2022-12-13 19:19:43,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 84 transitions, 328 flow [2022-12-13 19:19:43,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:19:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:19:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 883 transitions. [2022-12-13 19:19:43,649 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46085594989561585 [2022-12-13 19:19:43,649 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 883 transitions. [2022-12-13 19:19:43,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 883 transitions. [2022-12-13 19:19:43,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:43,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 883 transitions. [2022-12-13 19:19:43,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 220.75) internal successors, (883), 4 states have internal predecessors, (883), 0 states have call successors, (0), 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 19:19:43,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 479.0) internal successors, (2395), 5 states have internal predecessors, (2395), 0 states have call successors, (0), 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 19:19:43,652 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 479.0) internal successors, (2395), 5 states have internal predecessors, (2395), 0 states have call successors, (0), 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 19:19:43,652 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 137 flow. Second operand 4 states and 883 transitions. [2022-12-13 19:19:43,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 84 transitions, 328 flow [2022-12-13 19:19:43,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 84 transitions, 327 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:19:43,654 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 152 flow [2022-12-13 19:19:43,654 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2022-12-13 19:19:43,654 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2022-12-13 19:19:43,654 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 152 flow [2022-12-13 19:19:43,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 206.25) internal successors, (825), 4 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:43,655 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:43,655 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 19:19:43,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 19:19:43,655 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:19:43,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:43,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1656567773, now seen corresponding path program 1 times [2022-12-13 19:19:43,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:43,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456763841] [2022-12-13 19:19:43,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:43,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:43,693 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 19:19:43,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:43,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456763841] [2022-12-13 19:19:43,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456763841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:43,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:43,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:19:43,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344064501] [2022-12-13 19:19:43,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:43,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:19:43,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:43,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:19:43,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:19:43,728 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 479 [2022-12-13 19:19:43,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 199.25) internal successors, (797), 4 states have internal predecessors, (797), 0 states have call successors, (0), 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 19:19:43,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:43,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 479 [2022-12-13 19:19:43,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:45,093 INFO L130 PetriNetUnfolder]: 12881/19631 cut-off events. [2022-12-13 19:19:45,093 INFO L131 PetriNetUnfolder]: For 3403/3403 co-relation queries the response was YES. [2022-12-13 19:19:45,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39773 conditions, 19631 events. 12881/19631 cut-off events. For 3403/3403 co-relation queries the response was YES. Maximal size of possible extension queue 940. Compared 134731 event pairs, 10067 based on Foata normal form. 1036/15335 useless extension candidates. Maximal degree in co-relation 39764. Up to 15907 conditions per place. [2022-12-13 19:19:45,216 INFO L137 encePairwiseOnDemand]: 474/479 looper letters, 30 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2022-12-13 19:19:45,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 54 transitions, 206 flow [2022-12-13 19:19:45,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:19:45,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:19:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 628 transitions. [2022-12-13 19:19:45,218 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43702157272094644 [2022-12-13 19:19:45,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 628 transitions. [2022-12-13 19:19:45,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 628 transitions. [2022-12-13 19:19:45,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:45,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 628 transitions. [2022-12-13 19:19:45,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 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 19:19:45,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:45,220 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:19:45,220 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 152 flow. Second operand 3 states and 628 transitions. [2022-12-13 19:19:45,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 54 transitions, 206 flow [2022-12-13 19:19:45,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 54 transitions, 200 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 19:19:45,222 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 140 flow [2022-12-13 19:19:45,222 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2022-12-13 19:19:45,222 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2022-12-13 19:19:45,222 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 140 flow [2022-12-13 19:19:45,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 199.25) internal successors, (797), 4 states have internal predecessors, (797), 0 states have call successors, (0), 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 19:19:45,223 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:45,223 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 19:19:45,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 19:19:45,223 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:19:45,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:45,223 INFO L85 PathProgramCache]: Analyzing trace with hash -186000881, now seen corresponding path program 1 times [2022-12-13 19:19:45,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:45,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700598005] [2022-12-13 19:19:45,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:45,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:19:45,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:45,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700598005] [2022-12-13 19:19:45,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700598005] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:19:45,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131592822] [2022-12-13 19:19:45,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:45,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:45,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:19:45,358 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:19:45,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 19:19:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:45,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 19:19:45,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:19:45,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:19:45,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:19:45,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:19:45,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:19:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:19:45,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131592822] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:19:45,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:19:45,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 19:19:45,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661744441] [2022-12-13 19:19:45,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:19:45,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 19:19:45,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:45,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 19:19:45,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:19:45,900 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 479 [2022-12-13 19:19:45,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 140 flow. Second operand has 11 states, 11 states have (on average 203.63636363636363) internal successors, (2240), 11 states have internal predecessors, (2240), 0 states have call successors, (0), 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 19:19:45,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:45,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 479 [2022-12-13 19:19:45,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:48,439 INFO L130 PetriNetUnfolder]: 20331/30781 cut-off events. [2022-12-13 19:19:48,440 INFO L131 PetriNetUnfolder]: For 2386/2386 co-relation queries the response was YES. [2022-12-13 19:19:48,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60497 conditions, 30781 events. 20331/30781 cut-off events. For 2386/2386 co-relation queries the response was YES. Maximal size of possible extension queue 1491. Compared 229678 event pairs, 8555 based on Foata normal form. 0/22568 useless extension candidates. Maximal degree in co-relation 60488. Up to 13635 conditions per place. [2022-12-13 19:19:48,650 INFO L137 encePairwiseOnDemand]: 475/479 looper letters, 75 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2022-12-13 19:19:48,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 428 flow [2022-12-13 19:19:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:19:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:19:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1090 transitions. [2022-12-13 19:19:48,652 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4551148225469729 [2022-12-13 19:19:48,652 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1090 transitions. [2022-12-13 19:19:48,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1090 transitions. [2022-12-13 19:19:48,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:48,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1090 transitions. [2022-12-13 19:19:48,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 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 19:19:48,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 479.0) internal successors, (2874), 6 states have internal predecessors, (2874), 0 states have call successors, (0), 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 19:19:48,657 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 479.0) internal successors, (2874), 6 states have internal predecessors, (2874), 0 states have call successors, (0), 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 19:19:48,657 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 140 flow. Second operand 5 states and 1090 transitions. [2022-12-13 19:19:48,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 428 flow [2022-12-13 19:19:48,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 427 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:19:48,659 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 157 flow [2022-12-13 19:19:48,659 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2022-12-13 19:19:48,659 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2022-12-13 19:19:48,660 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 157 flow [2022-12-13 19:19:48,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 203.63636363636363) internal successors, (2240), 11 states have internal predecessors, (2240), 0 states have call successors, (0), 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 19:19:48,660 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:48,660 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2022-12-13 19:19:48,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 19:19:48,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 19:19:48,861 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:19:48,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:48,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1471054338, now seen corresponding path program 2 times [2022-12-13 19:19:48,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:48,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191649577] [2022-12-13 19:19:48,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:48,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:19:48,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:48,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191649577] [2022-12-13 19:19:48,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191649577] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:19:48,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168323056] [2022-12-13 19:19:48,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:19:48,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:48,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:19:48,892 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:19:48,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 19:19:48,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:19:48,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:19:48,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 19:19:48,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:19:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:19:48,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:19:48,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168323056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:48,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 19:19:48,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-13 19:19:48,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12571] [2022-12-13 19:19:48,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:48,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:19:48,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:48,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:19:48,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:19:48,987 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 479 [2022-12-13 19:19:48,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 207.4) internal successors, (1037), 5 states have internal predecessors, (1037), 0 states have call successors, (0), 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 19:19:48,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:48,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 479 [2022-12-13 19:19:48,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:51,168 INFO L130 PetriNetUnfolder]: 18145/27919 cut-off events. [2022-12-13 19:19:51,168 INFO L131 PetriNetUnfolder]: For 2828/2828 co-relation queries the response was YES. [2022-12-13 19:19:51,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55604 conditions, 27919 events. 18145/27919 cut-off events. For 2828/2828 co-relation queries the response was YES. Maximal size of possible extension queue 1400. Compared 217069 event pairs, 995 based on Foata normal form. 518/22389 useless extension candidates. Maximal degree in co-relation 55594. Up to 15904 conditions per place. [2022-12-13 19:19:51,322 INFO L137 encePairwiseOnDemand]: 475/479 looper letters, 93 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2022-12-13 19:19:51,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 120 transitions, 520 flow [2022-12-13 19:19:51,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:19:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:19:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1129 transitions. [2022-12-13 19:19:51,324 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47139874739039667 [2022-12-13 19:19:51,324 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1129 transitions. [2022-12-13 19:19:51,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1129 transitions. [2022-12-13 19:19:51,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:51,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1129 transitions. [2022-12-13 19:19:51,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 225.8) internal successors, (1129), 5 states have internal predecessors, (1129), 0 states have call successors, (0), 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 19:19:51,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 479.0) internal successors, (2874), 6 states have internal predecessors, (2874), 0 states have call successors, (0), 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 19:19:51,327 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 479.0) internal successors, (2874), 6 states have internal predecessors, (2874), 0 states have call successors, (0), 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 19:19:51,327 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 157 flow. Second operand 5 states and 1129 transitions. [2022-12-13 19:19:51,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 120 transitions, 520 flow [2022-12-13 19:19:51,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 120 transitions, 512 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 19:19:51,373 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 154 flow [2022-12-13 19:19:51,373 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2022-12-13 19:19:51,373 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 3 predicate places. [2022-12-13 19:19:51,373 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 154 flow [2022-12-13 19:19:51,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.4) internal successors, (1037), 5 states have internal predecessors, (1037), 0 states have call successors, (0), 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 19:19:51,373 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:51,373 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:51,377 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 19:19:51,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:51,574 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:19:51,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:51,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1903744757, now seen corresponding path program 1 times [2022-12-13 19:19:51,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:51,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942008127] [2022-12-13 19:19:51,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:51,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:19:51,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:51,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942008127] [2022-12-13 19:19:51,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942008127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:51,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:51,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:19:51,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562247421] [2022-12-13 19:19:51,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:51,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:19:51,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:51,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:19:51,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:19:51,707 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 479 [2022-12-13 19:19:51,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 206.5) internal successors, (826), 4 states have internal predecessors, (826), 0 states have call successors, (0), 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 19:19:51,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:51,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 479 [2022-12-13 19:19:51,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:54,271 INFO L130 PetriNetUnfolder]: 20703/31143 cut-off events. [2022-12-13 19:19:54,271 INFO L131 PetriNetUnfolder]: For 12226/12226 co-relation queries the response was YES. [2022-12-13 19:19:54,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66105 conditions, 31143 events. 20703/31143 cut-off events. For 12226/12226 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 225555 event pairs, 14603 based on Foata normal form. 0/24483 useless extension candidates. Maximal degree in co-relation 66095. Up to 22205 conditions per place. [2022-12-13 19:19:54,515 INFO L137 encePairwiseOnDemand]: 474/479 looper letters, 51 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2022-12-13 19:19:54,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 77 transitions, 341 flow [2022-12-13 19:19:54,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:19:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:19:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 872 transitions. [2022-12-13 19:19:54,518 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4551148225469729 [2022-12-13 19:19:54,518 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 872 transitions. [2022-12-13 19:19:54,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 872 transitions. [2022-12-13 19:19:54,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:54,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 872 transitions. [2022-12-13 19:19:54,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 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 19:19:54,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 479.0) internal successors, (2395), 5 states have internal predecessors, (2395), 0 states have call successors, (0), 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 19:19:54,522 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 479.0) internal successors, (2395), 5 states have internal predecessors, (2395), 0 states have call successors, (0), 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 19:19:54,522 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 154 flow. Second operand 4 states and 872 transitions. [2022-12-13 19:19:54,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 77 transitions, 341 flow [2022-12-13 19:19:54,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 319 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 19:19:54,526 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 159 flow [2022-12-13 19:19:54,526 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2022-12-13 19:19:54,527 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2022-12-13 19:19:54,527 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 159 flow [2022-12-13 19:19:54,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 206.5) internal successors, (826), 4 states have internal predecessors, (826), 0 states have call successors, (0), 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 19:19:54,527 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:54,527 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:54,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 19:19:54,527 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:19:54,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:54,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1113448563, now seen corresponding path program 1 times [2022-12-13 19:19:54,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:54,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533047327] [2022-12-13 19:19:54,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:54,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:19:54,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:54,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533047327] [2022-12-13 19:19:54,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533047327] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:19:54,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140943283] [2022-12-13 19:19:54,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:54,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:54,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:19:54,665 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:19:54,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 19:19:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:54,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 19:19:54,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:19:54,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:19:54,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:19:54,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:19:54,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:19:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:19:54,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140943283] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:19:54,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:19:54,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 19:19:54,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084728234] [2022-12-13 19:19:54,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:19:54,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 19:19:54,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:54,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 19:19:54,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:19:55,198 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 479 [2022-12-13 19:19:55,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 159 flow. Second operand has 11 states, 11 states have (on average 203.9090909090909) internal successors, (2243), 11 states have internal predecessors, (2243), 0 states have call successors, (0), 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 19:19:55,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:55,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 479 [2022-12-13 19:19:55,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:19:58,470 INFO L130 PetriNetUnfolder]: 23789/35615 cut-off events. [2022-12-13 19:19:58,470 INFO L131 PetriNetUnfolder]: For 9883/9883 co-relation queries the response was YES. [2022-12-13 19:19:58,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78069 conditions, 35615 events. 23789/35615 cut-off events. For 9883/9883 co-relation queries the response was YES. Maximal size of possible extension queue 1677. Compared 264399 event pairs, 9045 based on Foata normal form. 0/28231 useless extension candidates. Maximal degree in co-relation 78058. Up to 15907 conditions per place. [2022-12-13 19:19:58,709 INFO L137 encePairwiseOnDemand]: 475/479 looper letters, 76 selfloop transitions, 4 changer transitions 0/103 dead transitions. [2022-12-13 19:19:58,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 103 transitions, 463 flow [2022-12-13 19:19:58,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:19:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:19:58,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1085 transitions. [2022-12-13 19:19:58,711 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.453027139874739 [2022-12-13 19:19:58,711 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1085 transitions. [2022-12-13 19:19:58,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1085 transitions. [2022-12-13 19:19:58,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:19:58,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1085 transitions. [2022-12-13 19:19:58,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 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 19:19:58,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 479.0) internal successors, (2874), 6 states have internal predecessors, (2874), 0 states have call successors, (0), 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 19:19:58,714 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 479.0) internal successors, (2874), 6 states have internal predecessors, (2874), 0 states have call successors, (0), 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 19:19:58,714 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 159 flow. Second operand 5 states and 1085 transitions. [2022-12-13 19:19:58,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 103 transitions, 463 flow [2022-12-13 19:19:58,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 103 transitions, 457 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 19:19:58,720 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 171 flow [2022-12-13 19:19:58,720 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2022-12-13 19:19:58,720 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 7 predicate places. [2022-12-13 19:19:58,720 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 171 flow [2022-12-13 19:19:58,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 203.9090909090909) internal successors, (2243), 11 states have internal predecessors, (2243), 0 states have call successors, (0), 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 19:19:58,721 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:19:58,721 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:19:58,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 19:19:58,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:19:58,921 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:19:58,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:19:58,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1565478834, now seen corresponding path program 1 times [2022-12-13 19:19:58,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:19:58,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584535712] [2022-12-13 19:19:58,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:19:58,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:19:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:19:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:19:58,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:19:58,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584535712] [2022-12-13 19:19:58,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584535712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:19:58,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:19:58,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:19:58,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301432232] [2022-12-13 19:19:58,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:19:58,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:19:58,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:19:58,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:19:58,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:19:58,956 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 479 [2022-12-13 19:19:58,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 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 19:19:58,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:19:58,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 479 [2022-12-13 19:19:58,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:20:05,153 INFO L130 PetriNetUnfolder]: 60372/86283 cut-off events. [2022-12-13 19:20:05,153 INFO L131 PetriNetUnfolder]: For 27018/27018 co-relation queries the response was YES. [2022-12-13 19:20:05,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189403 conditions, 86283 events. 60372/86283 cut-off events. For 27018/27018 co-relation queries the response was YES. Maximal size of possible extension queue 3864. Compared 653230 event pairs, 31914 based on Foata normal form. 0/71654 useless extension candidates. Maximal degree in co-relation 189391. Up to 56645 conditions per place. [2022-12-13 19:20:05,691 INFO L137 encePairwiseOnDemand]: 472/479 looper letters, 63 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2022-12-13 19:20:05,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 85 transitions, 404 flow [2022-12-13 19:20:05,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:20:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:20:05,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2022-12-13 19:20:05,693 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4641614474599861 [2022-12-13 19:20:05,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 667 transitions. [2022-12-13 19:20:05,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 667 transitions. [2022-12-13 19:20:05,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:20:05,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 667 transitions. [2022-12-13 19:20:05,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 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 19:20:05,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:20:05,697 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:20:05,697 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 171 flow. Second operand 3 states and 667 transitions. [2022-12-13 19:20:05,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 85 transitions, 404 flow [2022-12-13 19:20:05,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 394 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 19:20:05,711 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 207 flow [2022-12-13 19:20:05,711 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2022-12-13 19:20:05,712 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2022-12-13 19:20:05,712 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 207 flow [2022-12-13 19:20:05,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 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 19:20:05,712 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:20:05,712 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:20:05,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 19:20:05,712 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:20:05,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:20:05,712 INFO L85 PathProgramCache]: Analyzing trace with hash -157160971, now seen corresponding path program 2 times [2022-12-13 19:20:05,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:20:05,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142798428] [2022-12-13 19:20:05,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:20:05,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:20:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:20:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:20:05,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:20:05,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142798428] [2022-12-13 19:20:05,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142798428] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:20:05,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266944604] [2022-12-13 19:20:05,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:20:05,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:20:05,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:20:05,746 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:20:05,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 19:20:05,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:20:05,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:20:05,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 19:20:05,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:20:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:20:05,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:20:05,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266944604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:20:05,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 19:20:05,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-13 19:20:05,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594676760] [2022-12-13 19:20:05,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:20:05,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:20:05,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:20:05,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:20:05,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:20:05,835 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 479 [2022-12-13 19:20:05,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 207.6) internal successors, (1038), 5 states have internal predecessors, (1038), 0 states have call successors, (0), 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 19:20:05,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:20:05,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 479 [2022-12-13 19:20:05,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:20:09,111 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][89], [thr1Thread4of4ForFork0InUse, 408#true, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 170#L714-1true, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 187#L729-5true, 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:09,111 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is not cut-off event [2022-12-13 19:20:09,112 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is not cut-off event [2022-12-13 19:20:09,112 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2022-12-13 19:20:09,112 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is not cut-off event [2022-12-13 19:20:09,210 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][89], [thr1Thread4of4ForFork0InUse, 408#true, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 170#L714-1true, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 187#L729-5true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:09,210 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is not cut-off event [2022-12-13 19:20:09,210 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2022-12-13 19:20:09,210 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2022-12-13 19:20:09,210 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2022-12-13 19:20:09,213 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][89], [thr1Thread4of4ForFork0InUse, 408#true, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 170#L714-1true, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 187#L729-5true, 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:09,213 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is not cut-off event [2022-12-13 19:20:09,213 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2022-12-13 19:20:09,213 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is not cut-off event [2022-12-13 19:20:09,213 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2022-12-13 19:20:09,268 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][89], [thr1Thread4of4ForFork0InUse, 408#true, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 170#L714-1true, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 187#L729-5true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:09,268 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is not cut-off event [2022-12-13 19:20:09,268 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2022-12-13 19:20:09,268 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is not cut-off event [2022-12-13 19:20:09,268 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is not cut-off event [2022-12-13 19:20:09,275 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][89], [408#true, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 170#L714-1true, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:09,275 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is not cut-off event [2022-12-13 19:20:09,275 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is not cut-off event [2022-12-13 19:20:09,275 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is not cut-off event [2022-12-13 19:20:09,275 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is not cut-off event [2022-12-13 19:20:09,303 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][89], [408#true, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 170#L714-1true, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:09,303 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is not cut-off event [2022-12-13 19:20:09,303 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is not cut-off event [2022-12-13 19:20:09,303 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is not cut-off event [2022-12-13 19:20:09,304 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is not cut-off event [2022-12-13 19:20:09,306 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][89], [408#true, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 170#L714-1true, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:09,306 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is not cut-off event [2022-12-13 19:20:09,306 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is not cut-off event [2022-12-13 19:20:09,306 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is not cut-off event [2022-12-13 19:20:09,306 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is not cut-off event [2022-12-13 19:20:09,327 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][89], [408#true, thr1Thread4of4ForFork0InUse, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 170#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), Black: 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:09,327 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is not cut-off event [2022-12-13 19:20:09,327 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is not cut-off event [2022-12-13 19:20:09,328 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is not cut-off event [2022-12-13 19:20:09,328 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is not cut-off event [2022-12-13 19:20:09,337 INFO L130 PetriNetUnfolder]: 30514/47539 cut-off events. [2022-12-13 19:20:09,337 INFO L131 PetriNetUnfolder]: For 12790/13529 co-relation queries the response was YES. [2022-12-13 19:20:09,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104053 conditions, 47539 events. 30514/47539 cut-off events. For 12790/13529 co-relation queries the response was YES. Maximal size of possible extension queue 2274. Compared 396959 event pairs, 1673 based on Foata normal form. 782/40797 useless extension candidates. Maximal degree in co-relation 104040. Up to 27683 conditions per place. [2022-12-13 19:20:09,674 INFO L137 encePairwiseOnDemand]: 475/479 looper letters, 98 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2022-12-13 19:20:09,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 128 transitions, 625 flow [2022-12-13 19:20:09,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:20:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:20:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1122 transitions. [2022-12-13 19:20:09,676 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4684759916492693 [2022-12-13 19:20:09,676 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1122 transitions. [2022-12-13 19:20:09,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1122 transitions. [2022-12-13 19:20:09,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:20:09,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1122 transitions. [2022-12-13 19:20:09,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 224.4) internal successors, (1122), 5 states have internal predecessors, (1122), 0 states have call successors, (0), 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 19:20:09,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 479.0) internal successors, (2874), 6 states have internal predecessors, (2874), 0 states have call successors, (0), 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 19:20:09,679 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 479.0) internal successors, (2874), 6 states have internal predecessors, (2874), 0 states have call successors, (0), 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 19:20:09,679 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 207 flow. Second operand 5 states and 1122 transitions. [2022-12-13 19:20:09,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 128 transitions, 625 flow [2022-12-13 19:20:09,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 128 transitions, 605 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 19:20:09,807 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 198 flow [2022-12-13 19:20:09,807 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=71, PETRI_TRANSITIONS=59} [2022-12-13 19:20:09,808 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 9 predicate places. [2022-12-13 19:20:09,808 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 198 flow [2022-12-13 19:20:09,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.6) internal successors, (1038), 5 states have internal predecessors, (1038), 0 states have call successors, (0), 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 19:20:09,808 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:20:09,808 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 19:20:09,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 19:20:10,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-12-13 19:20:10,009 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:20:10,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:20:10,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1904564577, now seen corresponding path program 1 times [2022-12-13 19:20:10,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:20:10,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996880135] [2022-12-13 19:20:10,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:20:10,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:20:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:20:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 19:20:10,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:20:10,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996880135] [2022-12-13 19:20:10,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996880135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:20:10,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:20:10,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:20:10,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567160535] [2022-12-13 19:20:10,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:20:10,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:20:10,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:20:10,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:20:10,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:20:10,146 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 479 [2022-12-13 19:20:10,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 59 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 206.75) internal successors, (827), 4 states have internal predecessors, (827), 0 states have call successors, (0), 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 19:20:10,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:20:10,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 479 [2022-12-13 19:20:10,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:20:13,541 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 25#L705-6true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,541 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-12-13 19:20:13,542 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 19:20:13,542 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 19:20:13,542 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-12-13 19:20:13,731 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 38#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,731 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,731 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 19:20:13,731 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,731 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 19:20:13,731 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 193#L712true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,732 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,732 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 19:20:13,732 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,732 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 19:20:13,732 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 25#L705-6true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,732 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,732 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,732 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 19:20:13,732 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 19:20:13,744 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 25#L705-6true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,744 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,744 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,744 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 19:20:13,744 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 19:20:13,756 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,756 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,756 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 19:20:13,756 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,756 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-12-13 19:20:13,875 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 38#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,875 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,875 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,875 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,875 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,875 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 193#L712true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,875 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,875 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,876 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,876 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,876 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 122#L718true, 100#L718true, 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,876 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,876 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,876 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,876 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,885 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 38#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,885 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,885 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,885 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,885 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,885 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 193#L712true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,885 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,885 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,885 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,885 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,886 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 25#L705-6true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,886 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,886 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,886 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,886 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,893 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,893 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,893 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,893 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,893 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,894 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,894 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,894 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,894 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,894 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,896 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,896 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,896 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,896 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,896 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:13,926 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 25#L705-6true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:13,926 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,926 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,926 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,926 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,973 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,973 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,973 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,973 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,973 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,985 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 122#L718true, 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,985 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,985 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,985 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,985 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,986 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 122#L718true, 100#L718true, 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,986 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,986 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,986 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,986 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,992 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 38#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,992 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,992 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,992 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,993 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,993 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 193#L712true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,993 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,993 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,993 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,993 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,993 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,994 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,994 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,994 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,994 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,997 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,998 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,998 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,998 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,998 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,999 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:13,999 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:13,999 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,999 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:13,999 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,000 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:14,000 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,000 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:14,000 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:14,000 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,027 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 38#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,027 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,028 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,028 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,028 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,028 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 193#L712true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,028 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,028 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,028 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,028 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,029 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 25#L705-6true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,029 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,029 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,029 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,029 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,041 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 25#L705-6true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,041 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,041 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,041 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,041 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,053 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,053 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,053 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,053 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,053 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,063 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:14,064 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,064 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,064 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,064 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,064 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:14,064 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,064 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,064 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,064 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,066 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:14,066 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,066 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,066 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,066 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,070 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 122#L718true, 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:14,070 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,070 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,070 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,070 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,075 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 122#L718true, 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:14,075 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,075 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,075 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,075 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,076 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:14,076 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,076 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,076 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,076 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,082 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:14,082 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,082 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,082 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,082 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:14,100 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 38#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,100 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,100 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,101 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,101 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,101 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 193#L712true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,101 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,101 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,101 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,101 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,102 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 122#L718true, 100#L718true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,102 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,102 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,102 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,102 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,110 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 38#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,110 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,110 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,111 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,111 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,111 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 193#L712true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,111 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,111 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,111 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,111 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,112 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 25#L705-6true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,112 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,112 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,112 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,112 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,119 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,119 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,119 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,119 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,119 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,119 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,119 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,119 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,119 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,120 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,121 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,121 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,121 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,121 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,121 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,124 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:14,125 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,125 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,125 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,125 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,126 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:14,126 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,126 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,126 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,126 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,126 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:14,127 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,127 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,127 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,127 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,131 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 122#L718true, 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:14,131 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,131 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,131 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,131 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:14,133 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,133 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,133 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,133 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,133 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,143 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 122#L718true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,143 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,143 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,143 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,144 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,144 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 122#L718true, 100#L718true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,144 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,144 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,144 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,144 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,151 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 38#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,151 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,151 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,151 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,151 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,152 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 193#L712true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,152 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,152 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,152 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,152 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,152 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,152 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,152 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,152 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,152 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,156 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,156 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,156 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,156 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,156 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,158 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,158 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,158 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,158 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,158 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,158 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,158 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,158 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,158 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,158 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,160 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:14,160 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,160 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,160 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,160 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:14,163 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,163 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,163 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,163 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,163 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,164 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 100#L718true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,164 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,164 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,164 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,164 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,166 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,166 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,166 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,166 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,166 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,169 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 122#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,169 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,169 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,169 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,169 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,174 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 122#L718true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,174 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,175 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,175 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,175 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,175 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,175 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,175 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,175 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,175 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,178 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,178 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,178 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,178 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,178 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:14,180 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 405#(and (= (mod (+ |thr1Thread2of4ForFork0_findMax_~i~0#1| 1) 2) 0) (<= (+ (* |thr1Thread2of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 1 |thr1Thread2of4ForFork0_findMax_~i~0#1|)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,180 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:20:14,180 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,180 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:14,180 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,181 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,181 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:20:14,182 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,182 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,182 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:14,182 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,182 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:20:14,182 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:14,182 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,182 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,186 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 122#L718true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,186 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:20:14,186 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,186 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:14,186 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:14,188 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:14,188 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2022-12-13 19:20:14,188 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2022-12-13 19:20:14,188 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:14,188 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:14,190 INFO L130 PetriNetUnfolder]: 34260/50883 cut-off events. [2022-12-13 19:20:14,190 INFO L131 PetriNetUnfolder]: For 25701/26713 co-relation queries the response was YES. [2022-12-13 19:20:14,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117890 conditions, 50883 events. 34260/50883 cut-off events. For 25701/26713 co-relation queries the response was YES. Maximal size of possible extension queue 2276. Compared 384861 event pairs, 21635 based on Foata normal form. 0/41969 useless extension candidates. Maximal degree in co-relation 117877. Up to 36958 conditions per place. [2022-12-13 19:20:14,538 INFO L137 encePairwiseOnDemand]: 474/479 looper letters, 54 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2022-12-13 19:20:14,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 83 transitions, 404 flow [2022-12-13 19:20:14,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:20:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:20:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 869 transitions. [2022-12-13 19:20:14,540 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4535490605427975 [2022-12-13 19:20:14,540 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 869 transitions. [2022-12-13 19:20:14,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 869 transitions. [2022-12-13 19:20:14,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:20:14,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 869 transitions. [2022-12-13 19:20:14,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 217.25) internal successors, (869), 4 states have internal predecessors, (869), 0 states have call successors, (0), 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 19:20:14,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 479.0) internal successors, (2395), 5 states have internal predecessors, (2395), 0 states have call successors, (0), 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 19:20:14,542 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 479.0) internal successors, (2395), 5 states have internal predecessors, (2395), 0 states have call successors, (0), 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 19:20:14,542 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 198 flow. Second operand 4 states and 869 transitions. [2022-12-13 19:20:14,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 83 transitions, 404 flow [2022-12-13 19:20:14,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 382 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 19:20:14,554 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 203 flow [2022-12-13 19:20:14,554 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2022-12-13 19:20:14,554 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2022-12-13 19:20:14,555 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 203 flow [2022-12-13 19:20:14,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 206.75) internal successors, (827), 4 states have internal predecessors, (827), 0 states have call successors, (0), 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 19:20:14,555 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:20:14,555 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:20:14,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 19:20:14,555 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:20:14,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:20:14,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1088033965, now seen corresponding path program 1 times [2022-12-13 19:20:14,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:20:14,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583783410] [2022-12-13 19:20:14,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:20:14,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:20:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:20:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 19:20:14,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:20:14,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583783410] [2022-12-13 19:20:14,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583783410] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:20:14,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125525026] [2022-12-13 19:20:14,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:20:14,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:20:14,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:20:14,647 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:20:14,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 19:20:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:20:14,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 19:20:14,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:20:14,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:20:14,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:20:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 19:20:14,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:20:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 19:20:14,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125525026] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:20:14,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:20:14,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 19:20:14,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961847060] [2022-12-13 19:20:14,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:20:14,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 19:20:14,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:20:14,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 19:20:14,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:20:15,312 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 479 [2022-12-13 19:20:15,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 203 flow. Second operand has 11 states, 11 states have (on average 204.1818181818182) internal successors, (2246), 11 states have internal predecessors, (2246), 0 states have call successors, (0), 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 19:20:15,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:20:15,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 479 [2022-12-13 19:20:15,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:20:19,539 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][74], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 170#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,539 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,539 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,540 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,540 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,564 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 38#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,565 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,565 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:19,565 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:19,565 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,565 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 193#L712true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,565 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,565 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:19,565 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:19,565 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,577 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,577 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,577 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,577 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:19,577 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:19,663 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][74], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 170#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,663 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,663 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,663 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,663 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,680 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 38#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,680 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,680 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,680 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,680 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,680 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 193#L712true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,681 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,681 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,681 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,681 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,681 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,681 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,681 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,681 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,681 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,688 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,688 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,688 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,688 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,688 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,689 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,689 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,689 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,689 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:19,689 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,752 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 187#L729-5true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,753 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,753 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,753 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,753 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,762 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 122#L718true, 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,762 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,762 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,762 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,762 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,762 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,762 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,762 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,763 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,763 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,767 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,767 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,767 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,767 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,767 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:19,770 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][74], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 170#L714-1true, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,770 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,770 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,770 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,770 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,795 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 38#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,795 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,795 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,795 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,795 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,796 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 193#L712true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,796 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,796 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,796 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,796 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,807 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,807 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,807 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,807 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,807 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,812 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,812 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,812 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,812 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,812 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,813 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,813 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,813 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,813 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,813 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,818 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 122#L718true, 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,818 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,818 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,818 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,818 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:19,821 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][74], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 170#L714-1true, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,822 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,822 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,822 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,822 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:19,838 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 38#thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,838 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,838 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,838 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,838 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,839 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 193#L712true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,839 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,839 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,839 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,839 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,839 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,839 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,839 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,840 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,840 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,846 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,846 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,846 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,846 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,846 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,846 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,847 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,847 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,847 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,847 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,848 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 187#L729-5true, 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse]) [2022-12-13 19:20:19,848 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,848 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,848 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:19,849 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,854 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,854 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:19,854 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:19,854 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,854 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,863 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 122#L718true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,863 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:19,863 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:19,863 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,863 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,863 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,863 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:19,863 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,863 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:19,863 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,867 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 78#L714-1true, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,867 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:19,867 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,867 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:19,867 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:19,870 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,870 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:20:19,870 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:19,870 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:19,870 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:19,871 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 100#L718true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,871 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:20:19,871 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:19,871 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:19,871 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:19,876 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 122#L718true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,876 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:20:19,876 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:19,876 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:19,876 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:19,878 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1454] L714-1-->L718: Formula: (and (not (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|) (= |v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= v_~m~0_35 1) 1 0)) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1_11|, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~m~0, thr1Thread2of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread2of4ForFork0_assume_abort_if_not_~cond#1][26], [thr1Thread4of4ForFork0InUse, 113#thr1EXITtrue, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 105#L718true, 454#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 550#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, 178#L729-4true]) [2022-12-13 19:20:19,878 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2022-12-13 19:20:19,878 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:19,878 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:19,878 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2022-12-13 19:20:19,881 INFO L130 PetriNetUnfolder]: 38159/57644 cut-off events. [2022-12-13 19:20:19,881 INFO L131 PetriNetUnfolder]: For 22771/23672 co-relation queries the response was YES. [2022-12-13 19:20:20,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136241 conditions, 57644 events. 38159/57644 cut-off events. For 22771/23672 co-relation queries the response was YES. Maximal size of possible extension queue 2663. Compared 458234 event pairs, 14502 based on Foata normal form. 0/48722 useless extension candidates. Maximal degree in co-relation 136227. Up to 25308 conditions per place. [2022-12-13 19:20:20,268 INFO L137 encePairwiseOnDemand]: 475/479 looper letters, 80 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2022-12-13 19:20:20,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 110 transitions, 541 flow [2022-12-13 19:20:20,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:20:20,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:20:20,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1080 transitions. [2022-12-13 19:20:20,271 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4509394572025052 [2022-12-13 19:20:20,271 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1080 transitions. [2022-12-13 19:20:20,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1080 transitions. [2022-12-13 19:20:20,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:20:20,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1080 transitions. [2022-12-13 19:20:20,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 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 19:20:20,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 479.0) internal successors, (2874), 6 states have internal predecessors, (2874), 0 states have call successors, (0), 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 19:20:20,274 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 479.0) internal successors, (2874), 6 states have internal predecessors, (2874), 0 states have call successors, (0), 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 19:20:20,274 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 203 flow. Second operand 5 states and 1080 transitions. [2022-12-13 19:20:20,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 110 transitions, 541 flow [2022-12-13 19:20:20,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 110 transitions, 535 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 19:20:20,307 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 215 flow [2022-12-13 19:20:20,307 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2022-12-13 19:20:20,307 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2022-12-13 19:20:20,307 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 215 flow [2022-12-13 19:20:20,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 204.1818181818182) internal successors, (2246), 11 states have internal predecessors, (2246), 0 states have call successors, (0), 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 19:20:20,307 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:20:20,307 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:20:20,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 19:20:20,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-13 19:20:20,508 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:20:20,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:20:20,509 INFO L85 PathProgramCache]: Analyzing trace with hash -584364948, now seen corresponding path program 1 times [2022-12-13 19:20:20,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:20:20,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025160656] [2022-12-13 19:20:20,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:20:20,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:20:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:20:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 19:20:20,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:20:20,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025160656] [2022-12-13 19:20:20,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025160656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:20:20,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:20:20,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:20:20,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240598884] [2022-12-13 19:20:20,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:20:20,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:20:20,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:20:20,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:20:20,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:20:20,585 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 479 [2022-12-13 19:20:20,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 215 flow. Second operand has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 0 states have call successors, (0), 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 19:20:20,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:20:20,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 479 [2022-12-13 19:20:20,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:20:31,051 INFO L130 PetriNetUnfolder]: 88896/127726 cut-off events. [2022-12-13 19:20:31,051 INFO L131 PetriNetUnfolder]: For 65538/66932 co-relation queries the response was YES. [2022-12-13 19:20:31,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311466 conditions, 127726 events. 88896/127726 cut-off events. For 65538/66932 co-relation queries the response was YES. Maximal size of possible extension queue 5710. Compared 1017796 event pairs, 45430 based on Foata normal form. 72/112258 useless extension candidates. Maximal degree in co-relation 311451. Up to 81601 conditions per place. [2022-12-13 19:20:31,965 INFO L137 encePairwiseOnDemand]: 472/479 looper letters, 68 selfloop transitions, 9 changer transitions 0/93 dead transitions. [2022-12-13 19:20:31,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 93 transitions, 491 flow [2022-12-13 19:20:31,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:20:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:20:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2022-12-13 19:20:31,967 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46207376478775225 [2022-12-13 19:20:31,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 664 transitions. [2022-12-13 19:20:31,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 664 transitions. [2022-12-13 19:20:31,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:20:31,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 664 transitions. [2022-12-13 19:20:31,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 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 19:20:31,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:20:31,969 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:20:31,969 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 215 flow. Second operand 3 states and 664 transitions. [2022-12-13 19:20:31,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 93 transitions, 491 flow [2022-12-13 19:20:32,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 93 transitions, 481 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 19:20:32,058 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 281 flow [2022-12-13 19:20:32,058 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=281, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2022-12-13 19:20:32,058 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 14 predicate places. [2022-12-13 19:20:32,058 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 281 flow [2022-12-13 19:20:32,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 0 states have call successors, (0), 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 19:20:32,059 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:20:32,059 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 19:20:32,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 19:20:32,059 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:20:32,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:20:32,059 INFO L85 PathProgramCache]: Analyzing trace with hash 630691745, now seen corresponding path program 2 times [2022-12-13 19:20:32,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:20:32,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659160244] [2022-12-13 19:20:32,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:20:32,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:20:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:20:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 19:20:32,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:20:32,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659160244] [2022-12-13 19:20:32,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659160244] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:20:32,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490048439] [2022-12-13 19:20:32,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:20:32,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:20:32,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:20:32,087 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:20:32,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 19:20:32,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:20:32,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:20:32,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 19:20:32,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:20:32,159 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 19:20:32,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:20:32,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490048439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:20:32,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 19:20:32,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-13 19:20:32,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862510173] [2022-12-13 19:20:32,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:20:32,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:20:32,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:20:32,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:20:32,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:20:32,175 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 479 [2022-12-13 19:20:32,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 0 states have call successors, (0), 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 19:20:32,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:20:32,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 479 [2022-12-13 19:20:32,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:20:38,887 INFO L130 PetriNetUnfolder]: 47122/75133 cut-off events. [2022-12-13 19:20:38,887 INFO L131 PetriNetUnfolder]: For 35241/39548 co-relation queries the response was YES. [2022-12-13 19:20:39,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178850 conditions, 75133 events. 47122/75133 cut-off events. For 35241/39548 co-relation queries the response was YES. Maximal size of possible extension queue 3850. Compared 680397 event pairs, 2653 based on Foata normal form. 1257/68319 useless extension candidates. Maximal degree in co-relation 178834. Up to 43759 conditions per place. [2022-12-13 19:20:39,455 INFO L137 encePairwiseOnDemand]: 475/479 looper letters, 103 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2022-12-13 19:20:39,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 138 transitions, 748 flow [2022-12-13 19:20:39,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:20:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:20:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1115 transitions. [2022-12-13 19:20:39,458 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46555323590814196 [2022-12-13 19:20:39,458 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1115 transitions. [2022-12-13 19:20:39,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1115 transitions. [2022-12-13 19:20:39,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:20:39,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1115 transitions. [2022-12-13 19:20:39,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 0 states have call successors, (0), 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 19:20:39,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 479.0) internal successors, (2874), 6 states have internal predecessors, (2874), 0 states have call successors, (0), 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 19:20:39,461 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 479.0) internal successors, (2874), 6 states have internal predecessors, (2874), 0 states have call successors, (0), 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 19:20:39,461 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 281 flow. Second operand 5 states and 1115 transitions. [2022-12-13 19:20:39,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 138 transitions, 748 flow [2022-12-13 19:20:39,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 138 transitions, 722 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 19:20:39,641 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 266 flow [2022-12-13 19:20:39,641 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2022-12-13 19:20:39,642 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 15 predicate places. [2022-12-13 19:20:39,642 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 266 flow [2022-12-13 19:20:39,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 0 states have call successors, (0), 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 19:20:39,642 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:20:39,642 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:20:39,645 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 19:20:39,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:20:39,843 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:20:39,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:20:39,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1119013184, now seen corresponding path program 1 times [2022-12-13 19:20:39,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:20:39,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141420791] [2022-12-13 19:20:39,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:20:39,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:20:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:20:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 19:20:39,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:20:39,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141420791] [2022-12-13 19:20:39,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141420791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:20:39,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:20:39,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:20:39,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090038296] [2022-12-13 19:20:39,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:20:39,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:20:39,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:20:39,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:20:39,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:20:40,039 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 479 [2022-12-13 19:20:40,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 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 19:20:40,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:20:40,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 479 [2022-12-13 19:20:40,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:20:47,727 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 187#L729-5true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:20:47,727 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 19:20:47,727 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:47,727 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:47,727 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:47,893 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:20:47,893 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 19:20:47,893 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:47,893 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:47,893 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:48,663 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 187#L729-5true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:20:48,663 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:48,663 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:48,663 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:48,663 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:48,791 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:20:48,791 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:48,791 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:48,791 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:48,791 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:48,793 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:20:48,793 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:48,793 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:48,793 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:48,793 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:48,807 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:20:48,807 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:20:48,808 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:48,808 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:20:48,808 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:48,808 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:49,619 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:20:49,620 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:49,620 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:49,620 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:49,620 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:49,646 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:20:49,647 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:49,647 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:49,647 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:49,647 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:49,647 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:20:49,647 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:49,647 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:49,647 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:49,647 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:49,664 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:20:49,664 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:49,664 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:49,664 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:49,664 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:49,669 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:20:49,669 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:49,669 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:49,669 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:49,669 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:49,674 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:20:49,674 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:49,675 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:49,675 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:49,675 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:49,680 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:20:49,680 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:20:49,680 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:49,680 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:49,680 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:49,680 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:49,812 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:20:49,812 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:49,812 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:49,812 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:49,812 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,081 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:20:50,081 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,081 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,081 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,081 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,210 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:20:50,210 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,210 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,210 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:50,211 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:50,231 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 187#L729-5true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:20:50,231 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,231 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:50,231 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,231 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:50,237 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:20:50,238 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,238 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,238 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:50,238 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:50,251 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 187#L729-5true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:20:50,251 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,251 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:50,251 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,251 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:50,252 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 187#L729-5true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 194#thr1EXITtrue, 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:20:50,252 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,252 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,252 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,252 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,260 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:20:50,260 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,260 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,260 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,260 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,264 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:20:50,265 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,265 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,265 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:50,265 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:20:50,345 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:20:50,345 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,345 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,345 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,345 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,430 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:20:50,430 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,430 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,430 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,430 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,431 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:20:50,431 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,431 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,431 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,431 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,434 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:20:50,434 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,434 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,434 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,434 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,442 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:20:50,442 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,442 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,442 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,442 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,442 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,513 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:20:50,513 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,513 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,513 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,513 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,517 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:20:50,517 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,517 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,517 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,517 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,530 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 187#L729-5true, 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:20:50,531 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,531 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,531 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:20:50,531 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,644 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:20:50,644 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,644 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,644 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,644 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,662 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:20:50,662 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,662 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,663 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,663 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,663 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:20:50,663 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,663 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,663 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,663 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,674 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:20:50,674 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,675 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,675 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,675 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,681 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:20:50,681 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,681 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,681 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,681 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,684 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:20:50,684 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,684 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,684 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,684 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,685 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,725 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:20:50,726 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,726 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,726 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:20:50,726 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,785 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:20:50,785 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,785 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,785 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,785 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,805 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:20:50,805 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,805 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,805 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,805 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,811 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:20:50,811 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,811 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,811 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,811 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,825 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 194#thr1EXITtrue, 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:20:50,825 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:20:50,825 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,825 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:50,825 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,825 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:20:50,825 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,825 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,825 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,825 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,832 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:20:50,833 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,833 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:50,833 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,833 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:50,837 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:20:50,837 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,837 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,837 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,837 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:20:50,892 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:20:50,892 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:20:50,892 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:50,892 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,892 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,895 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 554#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread3of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|) (<= 4 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~i~0#1|)))), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:20:50,895 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:20:50,895 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,895 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:50,895 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,909 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:20:50,909 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:20:50,909 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:50,909 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:50,909 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:20:51,032 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][79], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:20:51,032 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2022-12-13 19:20:51,032 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:51,032 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2022-12-13 19:20:51,032 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:20:51,070 INFO L130 PetriNetUnfolder]: 77510/122126 cut-off events. [2022-12-13 19:20:51,070 INFO L131 PetriNetUnfolder]: For 73988/81248 co-relation queries the response was YES. [2022-12-13 19:20:51,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294628 conditions, 122126 events. 77510/122126 cut-off events. For 73988/81248 co-relation queries the response was YES. Maximal size of possible extension queue 6286. Compared 1137158 event pairs, 35370 based on Foata normal form. 245/107579 useless extension candidates. Maximal degree in co-relation 294612. Up to 57655 conditions per place. [2022-12-13 19:20:51,982 INFO L137 encePairwiseOnDemand]: 475/479 looper letters, 60 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2022-12-13 19:20:51,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 94 transitions, 503 flow [2022-12-13 19:20:51,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:20:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:20:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 868 transitions. [2022-12-13 19:20:51,984 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.453027139874739 [2022-12-13 19:20:51,984 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 868 transitions. [2022-12-13 19:20:51,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 868 transitions. [2022-12-13 19:20:51,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:20:51,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 868 transitions. [2022-12-13 19:20:51,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 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 19:20:51,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 479.0) internal successors, (2395), 5 states have internal predecessors, (2395), 0 states have call successors, (0), 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 19:20:51,987 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 479.0) internal successors, (2395), 5 states have internal predecessors, (2395), 0 states have call successors, (0), 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 19:20:51,987 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 266 flow. Second operand 4 states and 868 transitions. [2022-12-13 19:20:51,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 94 transitions, 503 flow [2022-12-13 19:20:52,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 94 transitions, 481 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 19:20:52,077 INFO L231 Difference]: Finished difference. Result has 78 places, 67 transitions, 269 flow [2022-12-13 19:20:52,077 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=78, PETRI_TRANSITIONS=67} [2022-12-13 19:20:52,077 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 16 predicate places. [2022-12-13 19:20:52,077 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 269 flow [2022-12-13 19:20:52,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 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 19:20:52,077 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:20:52,077 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:20:52,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 19:20:52,077 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:20:52,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:20:52,078 INFO L85 PathProgramCache]: Analyzing trace with hash -329663196, now seen corresponding path program 1 times [2022-12-13 19:20:52,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:20:52,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960513299] [2022-12-13 19:20:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:20:52,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:20:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:20:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 19:20:52,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:20:52,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960513299] [2022-12-13 19:20:52,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960513299] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:20:52,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759404822] [2022-12-13 19:20:52,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:20:52,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:20:52,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:20:52,199 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:20:52,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 19:20:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:20:52,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 19:20:52,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:20:52,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:20:52,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:20:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 19:20:52,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:20:52,485 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-12-13 19:20:52,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759404822] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:20:52,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:20:52,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2022-12-13 19:20:52,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277075158] [2022-12-13 19:20:52,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:20:52,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 19:20:52,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:20:52,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 19:20:52,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-13 19:20:52,797 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 479 [2022-12-13 19:20:52,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 67 transitions, 269 flow. Second operand has 11 states, 11 states have (on average 206.45454545454547) internal successors, (2271), 11 states have internal predecessors, (2271), 0 states have call successors, (0), 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 19:20:52,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:20:52,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 479 [2022-12-13 19:20:52,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:20:59,982 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:20:59,982 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 19:20:59,982 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:59,982 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:20:59,982 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:21:00,124 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:21:00,125 INFO L383 tUnfolder$Statistics]: this new event has 35 ancestors and is cut-off event [2022-12-13 19:21:00,125 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:21:00,125 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:21:00,125 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:21:00,701 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:21:00,702 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:21:00,702 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:00,702 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:00,702 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:21:00,703 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:21:00,703 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:21:00,703 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:00,703 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:21:00,703 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:00,814 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:21:00,814 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:21:00,814 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:00,814 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:00,814 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:21:00,816 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:21:00,817 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:21:00,817 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:00,817 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:21:00,817 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:00,835 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:21:00,835 INFO L383 tUnfolder$Statistics]: this new event has 36 ancestors and is cut-off event [2022-12-13 19:21:00,835 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:21:00,835 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:21:00,835 INFO L386 tUnfolder$Statistics]: existing Event has 35 ancestors and is cut-off event [2022-12-13 19:21:00,835 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:21:01,360 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:21:01,360 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,360 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,360 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,360 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,360 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 735#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:21:01,360 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,360 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,360 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,360 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,387 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:21:01,387 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,387 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:21:01,387 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,388 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:21:01,419 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:21:01,419 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,419 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,419 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,419 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,420 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 735#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:21:01,420 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,420 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,420 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,420 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,426 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:21:01,426 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,426 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,426 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:21:01,426 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,426 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:21:01,427 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:21:01,427 INFO L383 tUnfolder$Statistics]: this new event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,427 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,427 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:21:01,427 INFO L386 tUnfolder$Statistics]: existing Event has 36 ancestors and is cut-off event [2022-12-13 19:21:01,427 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,509 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:21:01,509 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,509 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,509 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,509 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,607 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:21:01,607 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,607 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,607 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,607 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,770 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:21:01,771 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,771 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,771 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,771 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,777 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 735#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:21:01,777 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,777 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,777 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,777 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,793 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:21:01,793 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,793 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,793 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,793 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,796 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:21:01,796 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,796 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,796 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,796 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,815 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 735#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:21:01,815 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,815 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,815 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,815 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,819 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true]) [2022-12-13 19:21:01,819 INFO L383 tUnfolder$Statistics]: this new event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,819 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,819 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,819 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,819 INFO L386 tUnfolder$Statistics]: existing Event has 37 ancestors and is cut-off event [2022-12-13 19:21:01,888 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:21:01,888 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,888 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:01,888 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,888 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:01,889 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:21:01,889 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,889 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,889 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:01,890 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:01,965 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:21:01,965 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,965 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:01,965 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:01,965 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,967 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:21:01,967 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,967 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:01,967 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:01,967 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,976 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:21:01,976 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,976 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:01,976 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,976 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:01,976 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:02,037 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:21:02,037 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:21:02,037 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:02,037 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:02,037 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:02,039 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:21:02,039 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:21:02,039 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:02,039 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:02,039 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:02,052 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:21:02,052 INFO L383 tUnfolder$Statistics]: this new event has 39 ancestors and is cut-off event [2022-12-13 19:21:02,052 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:02,052 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:02,052 INFO L386 tUnfolder$Statistics]: existing Event has 38 ancestors and is cut-off event [2022-12-13 19:21:02,163 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 735#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:21:02,163 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,163 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,163 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,163 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,164 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:21:02,165 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,165 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,165 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,165 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,189 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:21:02,189 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,190 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:02,190 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,190 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:02,209 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), 18#L714-1true, Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 735#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:21:02,209 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:21:02,209 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,209 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,209 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:21:02,217 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 735#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:21:02,217 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,217 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,217 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,217 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,220 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:21:02,220 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,220 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,220 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,220 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,222 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][39], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 735#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:21:02,222 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:21:02,222 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:21:02,222 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,222 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,226 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:21:02,226 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,226 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,226 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:02,226 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,226 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:02,227 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:21:02,227 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,227 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,227 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,227 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:02,227 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:02,261 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 187#L729-5true, Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 194#thr1EXITtrue, 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24))]) [2022-12-13 19:21:02,261 INFO L383 tUnfolder$Statistics]: this new event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,261 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:02,261 INFO L386 tUnfolder$Statistics]: existing Event has 39 ancestors and is cut-off event [2022-12-13 19:21:02,261 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,308 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), 4#L718true, Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:21:02,308 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,308 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,308 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,308 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,330 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:21:02,330 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,330 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,330 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,330 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,332 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:21:02,332 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,332 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,332 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,332 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,355 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 78#L714-1true, 178#L729-4true]) [2022-12-13 19:21:02,355 INFO L383 tUnfolder$Statistics]: this new event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,355 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,355 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,355 INFO L386 tUnfolder$Statistics]: existing Event has 40 ancestors and is cut-off event [2022-12-13 19:21:02,355 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,400 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][91], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 737#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 16) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:21:02,400 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:21:02,400 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:21:02,400 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,400 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,401 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 4#L718true, Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:21:02,401 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:21:02,401 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:21:02,401 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,401 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,414 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 90#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, thr1Thread2of4ForFork0InUse, 226#true, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 122#L718true, 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:21:02,414 INFO L383 tUnfolder$Statistics]: this new event has 42 ancestors and is cut-off event [2022-12-13 19:21:02,414 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,414 INFO L386 tUnfolder$Statistics]: existing Event has 41 ancestors and is cut-off event [2022-12-13 19:21:02,414 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:21:02,449 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1307] L714-1-->L718: Formula: (and (= (ite (= v_~m~0_35 1) 1 0) |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (not (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| 0)) (= |v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11| |v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|) (= v_~m~0_34 0)) InVars {~m~0=v_~m~0_35} OutVars{~m~0=v_~m~0_34, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1_7|, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1_11|} AuxVars[] AssignedVars[~m~0, thr1Thread3of4ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread3of4ForFork0_assume_abort_if_not_~cond#1][108], [418#(<= (+ 2 |thr1Thread2of4ForFork0_findMax_~offset#1|) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 417#(<= (+ |thr1Thread2of4ForFork0_findMax_~offset#1| 1) |thr1Thread2of4ForFork0_findMax_~i~0#1|), Black: 304#(<= (+ |thr1Thread1of4ForFork0_findMax_~offset#1| 1) |thr1Thread1of4ForFork0_findMax_~i~0#1|), Black: 457#(and (<= 0 |~#storage~0.offset|) (= |thr1Thread3of4ForFork0_findMax_~i~0#1| |thr1Thread3of4ForFork0_findMax_~offset#1|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|)) 20) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread3of4ForFork0_findMax_~offset#1|))) (= (select |#length| |~#storage~0.base|) 24)), Black: 332#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread2of4ForFork0_findMax_~offset#1|))) (= |thr1Thread2of4ForFork0_findMax_~i~0#1| |thr1Thread2of4ForFork0_findMax_~offset#1|)), 305#(<= (+ 2 |thr1Thread1of4ForFork0_findMax_~offset#1|) |thr1Thread1of4ForFork0_findMax_~i~0#1|), 739#(and (<= 4 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (<= |thr1Thread4of4ForFork0_findMax_~i~0#1| 5) (= (select |#length| |~#storage~0.base|) 24) (= 3 |~#storage~0.base|)), 194#thr1EXITtrue, 231#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 90#thr1EXITtrue, 615#(and (<= 0 |~#storage~0.offset|) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), 250#(and (or (= |~#storage~0.base| |ULTIMATE.start_main_~#t~0#1.base|) (not (= 3 |ULTIMATE.start_main_~#t~0#1.base|))) (= (select |#valid| |~#storage~0.base|) 1)), thr1Thread1of4ForFork0InUse, 19#thr1EXITtrue, 226#true, thr1Thread2of4ForFork0InUse, Black: 410#(not (<= (+ ~max~0 1) |thr1Thread1of4ForFork0_findMax_~my_max~0#1|)), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 235#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), Black: 566#(<= (+ |thr1Thread3of4ForFork0_findMax_~offset#1| 1) |thr1Thread3of4ForFork0_findMax_~i~0#1|), 100#L718true, 567#(<= (+ 2 |thr1Thread3of4ForFork0_findMax_~offset#1|) |thr1Thread3of4ForFork0_findMax_~i~0#1|), Black: 618#(and (<= 0 (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|)) (<= 0 |~#storage~0.offset|) (<= (+ (* |thr1Thread4of4ForFork0_findMax_~i~0#1| 4) |~#storage~0.offset|) 20) (<= |~#storage~0.offset| 0) (= (select |#length| |~#storage~0.base|) 24)), Black: 559#(not (<= (+ ~max~0 1) |thr1Thread2of4ForFork0_findMax_~my_max~0#1|)), Black: 242#(and (<= 0 |~#storage~0.offset|) (<= 0 (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|))) (<= |~#storage~0.offset| 0) (= |thr1Thread1of4ForFork0_findMax_~i~0#1| |thr1Thread1of4ForFork0_findMax_~offset#1|) (<= (+ |~#storage~0.offset| (* 4 |thr1Thread1of4ForFork0_findMax_~offset#1|)) 20) (= (select |#length| |~#storage~0.base|) 24)), 178#L729-4true]) [2022-12-13 19:21:02,450 INFO L383 tUnfolder$Statistics]: this new event has 43 ancestors and is cut-off event [2022-12-13 19:21:02,450 INFO L386 tUnfolder$Statistics]: existing Event has 43 ancestors and is cut-off event [2022-12-13 19:21:02,450 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:21:02,450 INFO L386 tUnfolder$Statistics]: existing Event has 42 ancestors and is cut-off event [2022-12-13 19:21:02,482 INFO L130 PetriNetUnfolder]: 72713/114164 cut-off events. [2022-12-13 19:21:02,482 INFO L131 PetriNetUnfolder]: For 56694/63207 co-relation queries the response was YES. [2022-12-13 19:21:02,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278137 conditions, 114164 events. 72713/114164 cut-off events. For 56694/63207 co-relation queries the response was YES. Maximal size of possible extension queue 5862. Compared 1046281 event pairs, 20447 based on Foata normal form. 236/104961 useless extension candidates. Maximal degree in co-relation 278120. Up to 34041 conditions per place. [2022-12-13 19:21:03,471 INFO L137 encePairwiseOnDemand]: 475/479 looper letters, 110 selfloop transitions, 5 changer transitions 0/146 dead transitions. [2022-12-13 19:21:03,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 146 transitions, 791 flow [2022-12-13 19:21:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 19:21:03,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 19:21:03,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1308 transitions. [2022-12-13 19:21:03,475 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4551148225469729 [2022-12-13 19:21:03,475 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1308 transitions. [2022-12-13 19:21:03,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1308 transitions. [2022-12-13 19:21:03,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:21:03,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1308 transitions. [2022-12-13 19:21:03,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 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 19:21:03,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 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 19:21:03,480 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 479.0) internal successors, (3353), 7 states have internal predecessors, (3353), 0 states have call successors, (0), 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 19:21:03,480 INFO L175 Difference]: Start difference. First operand has 78 places, 67 transitions, 269 flow. Second operand 6 states and 1308 transitions. [2022-12-13 19:21:03,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 146 transitions, 791 flow [2022-12-13 19:21:03,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 146 transitions, 787 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:21:03,782 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 283 flow [2022-12-13 19:21:03,782 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2022-12-13 19:21:03,782 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 20 predicate places. [2022-12-13 19:21:03,782 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 283 flow [2022-12-13 19:21:03,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 206.45454545454547) internal successors, (2271), 11 states have internal predecessors, (2271), 0 states have call successors, (0), 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 19:21:03,783 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:21:03,783 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:21:03,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 19:21:03,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:21:03,984 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:21:03,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:21:03,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1660968068, now seen corresponding path program 1 times [2022-12-13 19:21:03,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:21:03,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979556919] [2022-12-13 19:21:03,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:21:03,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:21:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:21:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 19:21:04,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:21:04,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979556919] [2022-12-13 19:21:04,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979556919] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:21:04,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:21:04,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:21:04,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070788347] [2022-12-13 19:21:04,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:21:04,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:21:04,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:21:04,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:21:04,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:21:04,062 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 479 [2022-12-13 19:21:04,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 283 flow. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 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 19:21:04,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:21:04,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 479 [2022-12-13 19:21:04,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:21:24,144 INFO L130 PetriNetUnfolder]: 157859/231624 cut-off events. [2022-12-13 19:21:24,144 INFO L131 PetriNetUnfolder]: For 161502/166517 co-relation queries the response was YES. [2022-12-13 19:21:25,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601411 conditions, 231624 events. 157859/231624 cut-off events. For 161502/166517 co-relation queries the response was YES. Maximal size of possible extension queue 11119. Compared 2039805 event pairs, 78802 based on Foata normal form. 0/219312 useless extension candidates. Maximal degree in co-relation 601393. Up to 142521 conditions per place. [2022-12-13 19:21:26,079 INFO L137 encePairwiseOnDemand]: 472/479 looper letters, 74 selfloop transitions, 14 changer transitions 0/104 dead transitions. [2022-12-13 19:21:26,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 104 transitions, 622 flow [2022-12-13 19:21:26,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:21:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:21:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2022-12-13 19:21:26,081 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45998608211551845 [2022-12-13 19:21:26,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 661 transitions. [2022-12-13 19:21:26,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 661 transitions. [2022-12-13 19:21:26,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:21:26,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 661 transitions. [2022-12-13 19:21:26,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:21:26,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:21:26,083 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 479.0) internal successors, (1916), 4 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:21:26,083 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 283 flow. Second operand 3 states and 661 transitions. [2022-12-13 19:21:26,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 104 transitions, 622 flow [2022-12-13 19:21:27,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 104 transitions, 613 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 19:21:27,147 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 404 flow [2022-12-13 19:21:27,147 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=479, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2022-12-13 19:21:27,147 INFO L288 CegarLoopForPetriNet]: 62 programPoint places, 22 predicate places. [2022-12-13 19:21:27,147 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 404 flow [2022-12-13 19:21:27,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 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 19:21:27,147 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:21:27,147 INFO L209 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1] [2022-12-13 19:21:27,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 19:21:27,148 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2022-12-13 19:21:27,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:21:27,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1644722400, now seen corresponding path program 1 times [2022-12-13 19:21:27,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:21:27,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874754622] [2022-12-13 19:21:27,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:21:27,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:21:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:21:27,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:21:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:21:27,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:21:27,161 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 19:21:27,161 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2022-12-13 19:21:27,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 19 remaining) [2022-12-13 19:21:27,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 19 remaining) [2022-12-13 19:21:27,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (15 of 19 remaining) [2022-12-13 19:21:27,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 19 remaining) [2022-12-13 19:21:27,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 19 remaining) [2022-12-13 19:21:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (12 of 19 remaining) [2022-12-13 19:21:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 19 remaining) [2022-12-13 19:21:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 19 remaining) [2022-12-13 19:21:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (9 of 19 remaining) [2022-12-13 19:21:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 19 remaining) [2022-12-13 19:21:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 19 remaining) [2022-12-13 19:21:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (6 of 19 remaining) [2022-12-13 19:21:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 19 remaining) [2022-12-13 19:21:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 19 remaining) [2022-12-13 19:21:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (3 of 19 remaining) [2022-12-13 19:21:27,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 19 remaining) [2022-12-13 19:21:27,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 19 remaining) [2022-12-13 19:21:27,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (0 of 19 remaining) [2022-12-13 19:21:27,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 19:21:27,163 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:21:27,163 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2022-12-13 19:21:27,163 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2022-12-13 19:21:27,184 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 19:21:27,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 268 places, 293 transitions, 631 flow [2022-12-13 19:21:27,223 INFO L130 PetriNetUnfolder]: 41/381 cut-off events. [2022-12-13 19:21:27,223 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-13 19:21:27,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 381 events. 41/381 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1332 event pairs, 0 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 326. Up to 12 conditions per place. [2022-12-13 19:21:27,226 INFO L82 GeneralOperation]: Start removeDead. Operand has 268 places, 293 transitions, 631 flow [2022-12-13 19:21:27,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 268 places, 293 transitions, 631 flow [2022-12-13 19:21:27,228 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 19:21:27,228 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 268 places, 293 transitions, 631 flow [2022-12-13 19:21:27,228 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 268 places, 293 transitions, 631 flow [2022-12-13 19:21:27,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 268 places, 293 transitions, 631 flow [2022-12-13 19:21:27,266 INFO L130 PetriNetUnfolder]: 41/381 cut-off events. [2022-12-13 19:21:27,266 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-13 19:21:27,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 381 events. 41/381 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1332 event pairs, 0 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 326. Up to 12 conditions per place. [2022-12-13 19:21:27,280 INFO L119 LiptonReduction]: Number of co-enabled transitions 58310 [2022-12-13 19:21:31,405 INFO L134 LiptonReduction]: Checked pairs total: 86467 [2022-12-13 19:21:31,406 INFO L136 LiptonReduction]: Total number of compositions: 280 [2022-12-13 19:21:31,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 19:21:31,407 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@64312577, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 19:21:31,407 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-12-13 19:21:31,407 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 19:21:31,407 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 19:21:31,407 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:21:31,407 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 19:21:31,407 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2022-12-13 19:21:31,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:21:31,408 INFO L85 PathProgramCache]: Analyzing trace with hash 75462, now seen corresponding path program 1 times [2022-12-13 19:21:31,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:21:31,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132407234] [2022-12-13 19:21:31,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:21:31,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:21:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:21:31,417 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 19:21:31,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:21:31,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132407234] [2022-12-13 19:21:31,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132407234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:21:31,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:21:31,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:21:31,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479071081] [2022-12-13 19:21:31,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:21:31,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:21:31,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:21:31,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:21:31,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:21:31,442 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 573 [2022-12-13 19:21:31,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 84 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 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 19:21:31,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:21:31,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 573 [2022-12-13 19:21:31,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:21:57,422 INFO L130 PetriNetUnfolder]: 275916/375212 cut-off events. [2022-12-13 19:21:57,422 INFO L131 PetriNetUnfolder]: For 58682/58682 co-relation queries the response was YES. [2022-12-13 19:21:58,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728186 conditions, 375212 events. 275916/375212 cut-off events. For 58682/58682 co-relation queries the response was YES. Maximal size of possible extension queue 16383. Compared 2917588 event pairs, 226896 based on Foata normal form. 40217/262763 useless extension candidates. Maximal degree in co-relation 87218. Up to 326337 conditions per place. [2022-12-13 19:22:00,270 INFO L137 encePairwiseOnDemand]: 559/573 looper letters, 42 selfloop transitions, 1 changer transitions 0/71 dead transitions. [2022-12-13 19:22:00,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 71 transitions, 273 flow [2022-12-13 19:22:00,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:22:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:22:00,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 806 transitions. [2022-12-13 19:22:00,290 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4688772542175684 [2022-12-13 19:22:00,290 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 806 transitions. [2022-12-13 19:22:00,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 806 transitions. [2022-12-13 19:22:00,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:22:00,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 806 transitions. [2022-12-13 19:22:00,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 268.6666666666667) internal successors, (806), 3 states have internal predecessors, (806), 0 states have call successors, (0), 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 19:22:00,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 573.0) internal successors, (2292), 4 states have internal predecessors, (2292), 0 states have call successors, (0), 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 19:22:00,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 573.0) internal successors, (2292), 4 states have internal predecessors, (2292), 0 states have call successors, (0), 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 19:22:00,292 INFO L175 Difference]: Start difference. First operand has 75 places, 84 transitions, 213 flow. Second operand 3 states and 806 transitions. [2022-12-13 19:22:00,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 71 transitions, 273 flow [2022-12-13 19:22:00,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 71 transitions, 253 flow, removed 10 selfloop flow, removed 0 redundant places. [2022-12-13 19:22:00,330 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 169 flow [2022-12-13 19:22:00,330 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=573, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2022-12-13 19:22:00,330 INFO L288 CegarLoopForPetriNet]: 75 programPoint places, -1 predicate places. [2022-12-13 19:22:00,330 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 169 flow [2022-12-13 19:22:00,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 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 19:22:00,331 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:22:00,331 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1] [2022-12-13 19:22:00,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 19:22:00,331 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2022-12-13 19:22:00,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:22:00,331 INFO L85 PathProgramCache]: Analyzing trace with hash 75463, now seen corresponding path program 1 times [2022-12-13 19:22:00,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:22:00,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653646092] [2022-12-13 19:22:00,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:22:00,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:22:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:22:00,349 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 19:22:00,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:22:00,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653646092] [2022-12-13 19:22:00,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653646092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:22:00,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:22:00,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 19:22:00,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457187857] [2022-12-13 19:22:00,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:22:00,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:22:00,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:22:00,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:22:00,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:22:00,376 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 573 [2022-12-13 19:22:00,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 252.66666666666666) internal successors, (758), 3 states have internal predecessors, (758), 0 states have call successors, (0), 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 19:22:00,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:22:00,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 573 [2022-12-13 19:22:00,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:22:16,963 INFO L130 PetriNetUnfolder]: 178342/246826 cut-off events. [2022-12-13 19:22:16,963 INFO L131 PetriNetUnfolder]: For 7714/7714 co-relation queries the response was YES. [2022-12-13 19:22:17,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469251 conditions, 246826 events. 178342/246826 cut-off events. For 7714/7714 co-relation queries the response was YES. Maximal size of possible extension queue 10263. Compared 1892933 event pairs, 145662 based on Foata normal form. 0/157186 useless extension candidates. Maximal degree in co-relation 469240. Up to 211956 conditions per place. [2022-12-13 19:22:18,677 INFO L137 encePairwiseOnDemand]: 571/573 looper letters, 41 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2022-12-13 19:22:18,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 251 flow [2022-12-13 19:22:18,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:22:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:22:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 799 transitions. [2022-12-13 19:22:18,679 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46480511925538104 [2022-12-13 19:22:18,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 799 transitions. [2022-12-13 19:22:18,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 799 transitions. [2022-12-13 19:22:18,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:22:18,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 799 transitions. [2022-12-13 19:22:18,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 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 19:22:18,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 573.0) internal successors, (2292), 4 states have internal predecessors, (2292), 0 states have call successors, (0), 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 19:22:18,682 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 573.0) internal successors, (2292), 4 states have internal predecessors, (2292), 0 states have call successors, (0), 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 19:22:18,682 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 169 flow. Second operand 3 states and 799 transitions. [2022-12-13 19:22:18,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 251 flow [2022-12-13 19:22:18,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 70 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:22:18,684 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 168 flow [2022-12-13 19:22:18,684 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=573, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2022-12-13 19:22:18,685 INFO L288 CegarLoopForPetriNet]: 75 programPoint places, -1 predicate places. [2022-12-13 19:22:18,685 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 168 flow [2022-12-13 19:22:18,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.66666666666666) internal successors, (758), 3 states have internal predecessors, (758), 0 states have call successors, (0), 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 19:22:18,685 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:22:18,685 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 19:22:18,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 19:22:18,685 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2022-12-13 19:22:18,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:22:18,686 INFO L85 PathProgramCache]: Analyzing trace with hash -2044864117, now seen corresponding path program 1 times [2022-12-13 19:22:18,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:22:18,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581442836] [2022-12-13 19:22:18,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:22:18,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:22:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:22:18,718 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 19:22:18,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:22:18,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581442836] [2022-12-13 19:22:18,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581442836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:22:18,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:22:18,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:22:18,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517011072] [2022-12-13 19:22:18,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:22:18,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:22:18,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:22:18,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:22:18,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 19:22:18,762 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 573 [2022-12-13 19:22:18,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 241.25) internal successors, (965), 4 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:22:18,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:22:18,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 573 [2022-12-13 19:22:18,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:22:26,876 INFO L130 PetriNetUnfolder]: 84915/119689 cut-off events. [2022-12-13 19:22:26,876 INFO L131 PetriNetUnfolder]: For 4230/4230 co-relation queries the response was YES. [2022-12-13 19:22:27,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225910 conditions, 119689 events. 84915/119689 cut-off events. For 4230/4230 co-relation queries the response was YES. Maximal size of possible extension queue 4693. Compared 877541 event pairs, 66875 based on Foata normal form. 0/85162 useless extension candidates. Maximal degree in co-relation 225898. Up to 100467 conditions per place. [2022-12-13 19:22:27,649 INFO L137 encePairwiseOnDemand]: 567/573 looper letters, 36 selfloop transitions, 1 changer transitions 0/65 dead transitions. [2022-12-13 19:22:27,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 65 transitions, 232 flow [2022-12-13 19:22:27,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:22:27,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:22:27,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2022-12-13 19:22:27,650 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4432809773123909 [2022-12-13 19:22:27,650 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 762 transitions. [2022-12-13 19:22:27,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 762 transitions. [2022-12-13 19:22:27,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:22:27,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 762 transitions. [2022-12-13 19:22:27,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 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 19:22:27,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 573.0) internal successors, (2292), 4 states have internal predecessors, (2292), 0 states have call successors, (0), 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 19:22:27,653 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 573.0) internal successors, (2292), 4 states have internal predecessors, (2292), 0 states have call successors, (0), 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 19:22:27,653 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 168 flow. Second operand 3 states and 762 transitions. [2022-12-13 19:22:27,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 65 transitions, 232 flow [2022-12-13 19:22:27,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 65 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:22:27,658 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 159 flow [2022-12-13 19:22:27,658 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=573, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2022-12-13 19:22:27,658 INFO L288 CegarLoopForPetriNet]: 75 programPoint places, -5 predicate places. [2022-12-13 19:22:27,658 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 159 flow [2022-12-13 19:22:27,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 241.25) internal successors, (965), 4 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:22:27,659 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:22:27,659 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 19:22:27,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-13 19:22:27,659 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2022-12-13 19:22:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:22:27,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2044864116, now seen corresponding path program 1 times [2022-12-13 19:22:27,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:22:27,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646922613] [2022-12-13 19:22:27,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:22:27,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:22:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:22:27,721 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 19:22:27,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:22:27,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646922613] [2022-12-13 19:22:27,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646922613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:22:27,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:22:27,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:22:27,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918731797] [2022-12-13 19:22:27,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:22:27,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:22:27,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:22:27,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:22:27,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 19:22:27,793 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 573 [2022-12-13 19:22:27,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 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 19:22:27,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:22:27,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 573 [2022-12-13 19:22:27,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:22:42,313 INFO L130 PetriNetUnfolder]: 142559/202205 cut-off events. [2022-12-13 19:22:42,313 INFO L131 PetriNetUnfolder]: For 7338/7338 co-relation queries the response was YES. [2022-12-13 19:22:42,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378511 conditions, 202205 events. 142559/202205 cut-off events. For 7338/7338 co-relation queries the response was YES. Maximal size of possible extension queue 8081. Compared 1625604 event pairs, 66875 based on Foata normal form. 0/145224 useless extension candidates. Maximal degree in co-relation 378498. Up to 100467 conditions per place. [2022-12-13 19:22:43,870 INFO L137 encePairwiseOnDemand]: 569/573 looper letters, 67 selfloop transitions, 3 changer transitions 0/98 dead transitions. [2022-12-13 19:22:43,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 98 transitions, 385 flow [2022-12-13 19:22:43,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:22:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:22:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1055 transitions. [2022-12-13 19:22:43,873 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46029668411867364 [2022-12-13 19:22:43,873 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1055 transitions. [2022-12-13 19:22:43,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1055 transitions. [2022-12-13 19:22:43,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:22:43,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1055 transitions. [2022-12-13 19:22:43,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 263.75) internal successors, (1055), 4 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:22:43,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 573.0) internal successors, (2865), 5 states have internal predecessors, (2865), 0 states have call successors, (0), 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 19:22:43,876 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 573.0) internal successors, (2865), 5 states have internal predecessors, (2865), 0 states have call successors, (0), 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 19:22:43,876 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 159 flow. Second operand 4 states and 1055 transitions. [2022-12-13 19:22:43,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 98 transitions, 385 flow [2022-12-13 19:22:43,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 98 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 19:22:43,884 INFO L231 Difference]: Finished difference. Result has 73 places, 66 transitions, 172 flow [2022-12-13 19:22:43,884 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=573, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=73, PETRI_TRANSITIONS=66} [2022-12-13 19:22:43,884 INFO L288 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2022-12-13 19:22:43,884 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 66 transitions, 172 flow [2022-12-13 19:22:43,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 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 19:22:43,885 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:22:43,885 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 19:22:43,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 19:22:43,885 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2022-12-13 19:22:43,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:22:43,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1033729053, now seen corresponding path program 1 times [2022-12-13 19:22:43,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:22:43,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80089915] [2022-12-13 19:22:43,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:22:43,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:22:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:22:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:22:44,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:22:44,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80089915] [2022-12-13 19:22:44,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80089915] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:22:44,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234620621] [2022-12-13 19:22:44,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:22:44,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:22:44,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:22:44,002 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:22:44,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 19:22:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:22:44,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 19:22:44,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:22:44,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:22:44,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:22:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:22:44,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:22:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:22:44,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234620621] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:22:44,200 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:22:44,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2022-12-13 19:22:44,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17769924] [2022-12-13 19:22:44,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:22:44,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 19:22:44,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:22:44,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 19:22:44,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-12-13 19:22:44,629 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 573 [2022-12-13 19:22:44,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 66 transitions, 172 flow. Second operand has 12 states, 12 states have (on average 247.5) internal successors, (2970), 12 states have internal predecessors, (2970), 0 states have call successors, (0), 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 19:22:44,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:22:44,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 573 [2022-12-13 19:22:44,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:23:05,608 INFO L130 PetriNetUnfolder]: 198091/278691 cut-off events. [2022-12-13 19:23:05,608 INFO L131 PetriNetUnfolder]: For 25004/25004 co-relation queries the response was YES. [2022-12-13 19:23:06,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543743 conditions, 278691 events. 198091/278691 cut-off events. For 25004/25004 co-relation queries the response was YES. Maximal size of possible extension queue 11225. Compared 2285172 event pairs, 68809 based on Foata normal form. 0/211484 useless extension candidates. Maximal degree in co-relation 543728. Up to 100467 conditions per place. [2022-12-13 19:23:07,654 INFO L137 encePairwiseOnDemand]: 569/573 looper letters, 99 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2022-12-13 19:23:07,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 131 transitions, 550 flow [2022-12-13 19:23:07,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:23:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:23:07,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1334 transitions. [2022-12-13 19:23:07,657 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4656195462478185 [2022-12-13 19:23:07,657 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1334 transitions. [2022-12-13 19:23:07,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1334 transitions. [2022-12-13 19:23:07,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:23:07,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1334 transitions. [2022-12-13 19:23:07,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 266.8) internal successors, (1334), 5 states have internal predecessors, (1334), 0 states have call successors, (0), 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 19:23:07,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 573.0) internal successors, (3438), 6 states have internal predecessors, (3438), 0 states have call successors, (0), 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 19:23:07,661 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 573.0) internal successors, (3438), 6 states have internal predecessors, (3438), 0 states have call successors, (0), 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 19:23:07,661 INFO L175 Difference]: Start difference. First operand has 73 places, 66 transitions, 172 flow. Second operand 5 states and 1334 transitions. [2022-12-13 19:23:07,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 131 transitions, 550 flow [2022-12-13 19:23:07,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 131 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:23:07,676 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 186 flow [2022-12-13 19:23:07,677 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=573, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2022-12-13 19:23:07,677 INFO L288 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2022-12-13 19:23:07,677 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 186 flow [2022-12-13 19:23:07,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 247.5) internal successors, (2970), 12 states have internal predecessors, (2970), 0 states have call successors, (0), 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 19:23:07,677 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:23:07,677 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2022-12-13 19:23:07,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 19:23:07,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:23:07,879 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2022-12-13 19:23:07,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:07,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1980836780, now seen corresponding path program 2 times [2022-12-13 19:23:07,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:07,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445884050] [2022-12-13 19:23:07,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:07,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:23:07,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:07,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445884050] [2022-12-13 19:23:07,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445884050] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:23:07,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453139829] [2022-12-13 19:23:07,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 19:23:07,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:23:07,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:23:07,939 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:23:07,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 19:23:08,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 19:23:08,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 19:23:08,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 19:23:08,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:23:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:23:08,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:23:08,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453139829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:08,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 19:23:08,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-13 19:23:08,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27139653] [2022-12-13 19:23:08,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:08,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 19:23:08,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:08,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 19:23:08,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 19:23:08,027 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 573 [2022-12-13 19:23:08,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 250.4) internal successors, (1252), 5 states have internal predecessors, (1252), 0 states have call successors, (0), 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 19:23:08,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:23:08,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 573 [2022-12-13 19:23:08,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:23:27,574 INFO L130 PetriNetUnfolder]: 183981/264419 cut-off events. [2022-12-13 19:23:27,574 INFO L131 PetriNetUnfolder]: For 19355/19355 co-relation queries the response was YES. [2022-12-13 19:23:28,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511051 conditions, 264419 events. 183981/264419 cut-off events. For 19355/19355 co-relation queries the response was YES. Maximal size of possible extension queue 10872. Compared 2299085 event pairs, 8555 based on Foata normal form. 3110/205943 useless extension candidates. Maximal degree in co-relation 511035. Up to 167440 conditions per place. [2022-12-13 19:23:29,713 INFO L137 encePairwiseOnDemand]: 569/573 looper letters, 121 selfloop transitions, 5 changer transitions 0/154 dead transitions. [2022-12-13 19:23:29,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 154 transitions, 664 flow [2022-12-13 19:23:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:23:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:23:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1373 transitions. [2022-12-13 19:23:29,715 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4792321116928447 [2022-12-13 19:23:29,715 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1373 transitions. [2022-12-13 19:23:29,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1373 transitions. [2022-12-13 19:23:29,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:23:29,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1373 transitions. [2022-12-13 19:23:29,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 274.6) internal successors, (1373), 5 states have internal predecessors, (1373), 0 states have call successors, (0), 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 19:23:29,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 573.0) internal successors, (3438), 6 states have internal predecessors, (3438), 0 states have call successors, (0), 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 19:23:29,719 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 573.0) internal successors, (3438), 6 states have internal predecessors, (3438), 0 states have call successors, (0), 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 19:23:29,719 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 186 flow. Second operand 5 states and 1373 transitions. [2022-12-13 19:23:29,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 154 transitions, 664 flow [2022-12-13 19:23:31,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 154 transitions, 652 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-13 19:23:31,667 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 178 flow [2022-12-13 19:23:31,667 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=573, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2022-12-13 19:23:31,667 INFO L288 CegarLoopForPetriNet]: 75 programPoint places, -1 predicate places. [2022-12-13 19:23:31,667 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 178 flow [2022-12-13 19:23:31,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 250.4) internal successors, (1252), 5 states have internal predecessors, (1252), 0 states have call successors, (0), 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 19:23:31,668 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:23:31,668 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:23:31,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 19:23:31,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:23:31,869 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2022-12-13 19:23:31,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:23:31,870 INFO L85 PathProgramCache]: Analyzing trace with hash 698421972, now seen corresponding path program 1 times [2022-12-13 19:23:31,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:23:31,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366237192] [2022-12-13 19:23:31,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:31,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:23:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:23:31,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:23:31,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366237192] [2022-12-13 19:23:31,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366237192] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:23:31,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909155139] [2022-12-13 19:23:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:23:31,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:23:31,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:23:31,972 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:23:31,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 19:23:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:23:32,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 19:23:32,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:23:32,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:23:32,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:23:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:23:32,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 19:23:32,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909155139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:23:32,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 19:23:32,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2022-12-13 19:23:32,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703521471] [2022-12-13 19:23:32,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:23:32,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 19:23:32,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:23:32,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 19:23:32,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 19:23:32,192 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 573 [2022-12-13 19:23:32,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 251.5) internal successors, (1006), 4 states have internal predecessors, (1006), 0 states have call successors, (0), 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 19:23:32,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:23:32,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 573 [2022-12-13 19:23:32,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:24:04,824 INFO L130 PetriNetUnfolder]: 299937/421149 cut-off events. [2022-12-13 19:24:04,824 INFO L131 PetriNetUnfolder]: For 67682/67682 co-relation queries the response was YES. [2022-12-13 19:24:06,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839340 conditions, 421149 events. 299937/421149 cut-off events. For 67682/67682 co-relation queries the response was YES. Maximal size of possible extension queue 16711. Compared 3555711 event pairs, 150759 based on Foata normal form. 0/324909 useless extension candidates. Maximal degree in co-relation 839327. Up to 214565 conditions per place. [2022-12-13 19:24:08,233 INFO L137 encePairwiseOnDemand]: 569/573 looper letters, 70 selfloop transitions, 3 changer transitions 0/101 dead transitions. [2022-12-13 19:24:08,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 101 transitions, 423 flow [2022-12-13 19:24:08,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 19:24:08,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 19:24:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1068 transitions. [2022-12-13 19:24:08,236 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46596858638743455 [2022-12-13 19:24:08,236 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1068 transitions. [2022-12-13 19:24:08,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1068 transitions. [2022-12-13 19:24:08,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:24:08,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1068 transitions. [2022-12-13 19:24:08,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 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 19:24:08,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 573.0) internal successors, (2865), 5 states have internal predecessors, (2865), 0 states have call successors, (0), 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 19:24:08,240 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 573.0) internal successors, (2865), 5 states have internal predecessors, (2865), 0 states have call successors, (0), 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 19:24:08,240 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 178 flow. Second operand 4 states and 1068 transitions. [2022-12-13 19:24:08,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 101 transitions, 423 flow [2022-12-13 19:24:08,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 101 transitions, 405 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 19:24:08,262 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 183 flow [2022-12-13 19:24:08,262 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=573, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2022-12-13 19:24:08,262 INFO L288 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2022-12-13 19:24:08,262 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 183 flow [2022-12-13 19:24:08,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 251.5) internal successors, (1006), 4 states have internal predecessors, (1006), 0 states have call successors, (0), 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 19:24:08,262 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:24:08,263 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:08,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 19:24:08,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-12-13 19:24:08,464 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2022-12-13 19:24:08,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:08,465 INFO L85 PathProgramCache]: Analyzing trace with hash 772968877, now seen corresponding path program 1 times [2022-12-13 19:24:08,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:08,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327679438] [2022-12-13 19:24:08,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:08,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:08,512 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 19:24:08,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:08,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327679438] [2022-12-13 19:24:08,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327679438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:08,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:08,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:24:08,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328712808] [2022-12-13 19:24:08,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:08,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:08,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:08,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:08,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:08,526 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 573 [2022-12-13 19:24:08,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 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 19:24:08,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:24:08,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 573 [2022-12-13 19:24:08,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:24:25,548 INFO L130 PetriNetUnfolder]: 164237/227349 cut-off events. [2022-12-13 19:24:25,548 INFO L131 PetriNetUnfolder]: For 36803/36803 co-relation queries the response was YES. [2022-12-13 19:24:26,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467222 conditions, 227349 events. 164237/227349 cut-off events. For 36803/36803 co-relation queries the response was YES. Maximal size of possible extension queue 8497. Compared 1736247 event pairs, 113523 based on Foata normal form. 5182/186820 useless extension candidates. Maximal degree in co-relation 467207. Up to 167428 conditions per place. [2022-12-13 19:24:27,262 INFO L137 encePairwiseOnDemand]: 570/573 looper letters, 67 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2022-12-13 19:24:27,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 97 transitions, 407 flow [2022-12-13 19:24:27,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:24:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 19:24:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 817 transitions. [2022-12-13 19:24:27,264 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4752763234438627 [2022-12-13 19:24:27,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 817 transitions. [2022-12-13 19:24:27,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 817 transitions. [2022-12-13 19:24:27,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:24:27,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 817 transitions. [2022-12-13 19:24:27,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 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 19:24:27,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 573.0) internal successors, (2292), 4 states have internal predecessors, (2292), 0 states have call successors, (0), 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 19:24:27,266 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 573.0) internal successors, (2292), 4 states have internal predecessors, (2292), 0 states have call successors, (0), 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 19:24:27,266 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 183 flow. Second operand 3 states and 817 transitions. [2022-12-13 19:24:27,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 97 transitions, 407 flow [2022-12-13 19:24:27,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 97 transitions, 401 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 19:24:27,290 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 179 flow [2022-12-13 19:24:27,290 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=573, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2022-12-13 19:24:27,290 INFO L288 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2022-12-13 19:24:27,290 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 179 flow [2022-12-13 19:24:27,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 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 19:24:27,291 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:24:27,291 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:27,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 19:24:27,291 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2022-12-13 19:24:27,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash 176251958, now seen corresponding path program 1 times [2022-12-13 19:24:27,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:27,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524907734] [2022-12-13 19:24:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:27,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:24:27,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:27,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524907734] [2022-12-13 19:24:27,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524907734] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 19:24:27,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162386940] [2022-12-13 19:24:27,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:27,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 19:24:27,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:24:27,387 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 19:24:27,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 19:24:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:27,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 19:24:27,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 19:24:27,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 19:24:27,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 19:24:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:24:27,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 19:24:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 19:24:27,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162386940] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 19:24:27,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 19:24:27,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2022-12-13 19:24:27,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324787302] [2022-12-13 19:24:27,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 19:24:27,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 19:24:27,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:27,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 19:24:27,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-13 19:24:28,011 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 573 [2022-12-13 19:24:28,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 179 flow. Second operand has 12 states, 12 states have (on average 244.83333333333334) internal successors, (2938), 12 states have internal predecessors, (2938), 0 states have call successors, (0), 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 19:24:28,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:24:28,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 573 [2022-12-13 19:24:28,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 19:24:47,263 INFO L130 PetriNetUnfolder]: 182213/255373 cut-off events. [2022-12-13 19:24:47,263 INFO L131 PetriNetUnfolder]: For 39519/39519 co-relation queries the response was YES. [2022-12-13 19:24:48,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528092 conditions, 255373 events. 182213/255373 cut-off events. For 39519/39519 co-relation queries the response was YES. Maximal size of possible extension queue 9606. Compared 2048860 event pairs, 78539 based on Foata normal form. 3626/209055 useless extension candidates. Maximal degree in co-relation 528078. Up to 117211 conditions per place. [2022-12-13 19:24:49,216 INFO L137 encePairwiseOnDemand]: 568/573 looper letters, 97 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2022-12-13 19:24:49,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 129 transitions, 555 flow [2022-12-13 19:24:49,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 19:24:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 19:24:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1312 transitions. [2022-12-13 19:24:49,218 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45794066317626525 [2022-12-13 19:24:49,218 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1312 transitions. [2022-12-13 19:24:49,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1312 transitions. [2022-12-13 19:24:49,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:24:49,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1312 transitions. [2022-12-13 19:24:49,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 262.4) internal successors, (1312), 5 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 19:24:49,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 573.0) internal successors, (3438), 6 states have internal predecessors, (3438), 0 states have call successors, (0), 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 19:24:49,222 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 573.0) internal successors, (3438), 6 states have internal predecessors, (3438), 0 states have call successors, (0), 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 19:24:49,222 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 179 flow. Second operand 5 states and 1312 transitions. [2022-12-13 19:24:49,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 129 transitions, 555 flow [2022-12-13 19:24:49,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 129 transitions, 541 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 19:24:49,253 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 195 flow [2022-12-13 19:24:49,253 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=573, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2022-12-13 19:24:49,253 INFO L288 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2022-12-13 19:24:49,253 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 195 flow [2022-12-13 19:24:49,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 244.83333333333334) internal successors, (2938), 12 states have internal predecessors, (2938), 0 states have call successors, (0), 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 19:24:49,253 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 19:24:49,254 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 19:24:49,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 19:24:49,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13a4447f-31e3-46c6-b1c6-c10c60e588c8/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-13 19:24:49,455 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2ASSERT_VIOLATIONMEMORY_LEAK (and 19 more)] === [2022-12-13 19:24:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:24:49,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1875870786, now seen corresponding path program 1 times [2022-12-13 19:24:49,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:24:49,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106502043] [2022-12-13 19:24:49,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:24:49,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:24:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:24:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 19:24:49,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:24:49,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106502043] [2022-12-13 19:24:49,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106502043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:24:49,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:24:49,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:24:49,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257319299] [2022-12-13 19:24:49,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:24:49,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 19:24:49,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:24:49,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:24:49,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:24:49,532 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 573 [2022-12-13 19:24:49,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 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 19:24:49,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 19:24:49,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 573 [2022-12-13 19:24:49,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand