./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R --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 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:06:03,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:06:03,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:06:03,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:06:03,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:06:03,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:06:03,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:06:03,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:06:03,320 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:06:03,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:06:03,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:06:03,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:06:03,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:06:03,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:06:03,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:06:03,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:06:03,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:06:03,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:06:03,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:06:03,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:06:03,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:06:03,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:06:03,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:06:03,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:06:03,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:06:03,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:06:03,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:06:03,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:06:03,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:06:03,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:06:03,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:06:03,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:06:03,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:06:03,381 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:06:03,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:06:03,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:06:03,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:06:03,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:06:03,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:06:03,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:06:03,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:06:03,390 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 18:06:03,431 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:06:03,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:06:03,433 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:06:03,433 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:06:03,434 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:06:03,434 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:06:03,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:06:03,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:06:03,436 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:06:03,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:06:03,438 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:06:03,438 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:06:03,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:06:03,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:06:03,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:06:03,439 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:06:03,440 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:06:03,440 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:06:03,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:06:03,440 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:06:03,441 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:06:03,441 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:06:03,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:06:03,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:06:03,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:06:03,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:06:03,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:06:03,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:06:03,443 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:06:03,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:06:03,444 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:06:03,444 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:06:03,445 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:06:03,445 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_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 [2022-11-25 18:06:03,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:06:03,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:06:03,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:06:03,798 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:06:03,798 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:06:03,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2022-11-25 18:06:06,998 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:06:07,382 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:06:07,383 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2022-11-25 18:06:07,397 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/data/0d8a10aa8/e2fac8f2789f4fefb92f98ff75166777/FLAGbe736b841 [2022-11-25 18:06:07,414 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/data/0d8a10aa8/e2fac8f2789f4fefb92f98ff75166777 [2022-11-25 18:06:07,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:06:07,418 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:06:07,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:06:07,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:06:07,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:06:07,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:06:07" (1/1) ... [2022-11-25 18:06:07,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a696c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:07, skipping insertion in model container [2022-11-25 18:06:07,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:06:07" (1/1) ... [2022-11-25 18:06:07,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:06:07,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:06:07,661 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_55a1f0a1-5850-4449-b0ea-9125f477a624/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014] [2022-11-25 18:06:07,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,919 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,920 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,976 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,977 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,978 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,983 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:07,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:07,999 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:06:08,022 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:06:08,038 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_55a1f0a1-5850-4449-b0ea-9125f477a624/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014] [2022-11-25 18:06:08,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,075 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:06:08,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:06:08,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:06:08,138 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:06:08,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:08 WrapperNode [2022-11-25 18:06:08,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:06:08,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:06:08,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:06:08,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:06:08,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:08" (1/1) ... [2022-11-25 18:06:08,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:08" (1/1) ... [2022-11-25 18:06:08,228 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-25 18:06:08,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:06:08,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:06:08,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:06:08,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:06:08,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:08" (1/1) ... [2022-11-25 18:06:08,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:08" (1/1) ... [2022-11-25 18:06:08,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:08" (1/1) ... [2022-11-25 18:06:08,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:08" (1/1) ... [2022-11-25 18:06:08,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:08" (1/1) ... [2022-11-25 18:06:08,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:08" (1/1) ... [2022-11-25 18:06:08,290 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:08" (1/1) ... [2022-11-25 18:06:08,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:08" (1/1) ... [2022-11-25 18:06:08,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:06:08,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:06:08,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:06:08,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:06:08,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:08" (1/1) ... [2022-11-25 18:06:08,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:06:08,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:06:08,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:06:08,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:06:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:06:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:06:08,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:06:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:06:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:06:08,407 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 18:06:08,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 18:06:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 18:06:08,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 18:06:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 18:06:08,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 18:06:08,408 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 18:06:08,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 18:06:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:06:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:06:08,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:06:08,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:06:08,411 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:06:08,622 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:06:08,643 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:06:09,069 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:06:09,191 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:06:09,191 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:06:09,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:06:09 BoogieIcfgContainer [2022-11-25 18:06:09,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:06:09,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:06:09,198 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:06:09,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:06:09,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:06:07" (1/3) ... [2022-11-25 18:06:09,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9ecc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:06:09, skipping insertion in model container [2022-11-25 18:06:09,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:06:08" (2/3) ... [2022-11-25 18:06:09,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9ecc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:06:09, skipping insertion in model container [2022-11-25 18:06:09,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:06:09" (3/3) ... [2022-11-25 18:06:09,205 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2022-11-25 18:06:09,227 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:06:09,228 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 18:06:09,228 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:06:09,299 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:06:09,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-11-25 18:06:09,504 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-25 18:06:09,506 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:06:09,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-25 18:06:09,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 149 transitions, 318 flow [2022-11-25 18:06:09,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 145 transitions, 302 flow [2022-11-25 18:06:09,532 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:06:09,565 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 145 transitions, 302 flow [2022-11-25 18:06:09,568 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 145 transitions, 302 flow [2022-11-25 18:06:09,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 302 flow [2022-11-25 18:06:09,602 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-25 18:06:09,603 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:06:09,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-25 18:06:09,609 INFO L119 LiptonReduction]: Number of co-enabled transitions 3570 [2022-11-25 18:06:16,500 INFO L134 LiptonReduction]: Checked pairs total: 9787 [2022-11-25 18:06:16,500 INFO L136 LiptonReduction]: Total number of compositions: 142 [2022-11-25 18:06:16,519 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:06:16,526 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;@1b67175, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:06:16,527 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 18:06:16,530 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 18:06:16,530 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:06:16,530 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:16,531 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 18:06:16,532 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:16,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash 615, now seen corresponding path program 1 times [2022-11-25 18:06:16,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:16,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943847043] [2022-11-25 18:06:16,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:16,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:16,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:16,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943847043] [2022-11-25 18:06:16,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943847043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:16,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:16,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 18:06:16,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107721620] [2022-11-25 18:06:16,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:16,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:06:16,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:16,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:06:16,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:06:16,761 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 291 [2022-11-25 18:06:16,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:16,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:16,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 291 [2022-11-25 18:06:16,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:18,593 INFO L130 PetriNetUnfolder]: 6949/9676 cut-off events. [2022-11-25 18:06:18,593 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-11-25 18:06:18,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19290 conditions, 9676 events. 6949/9676 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 51355 event pairs, 6949 based on Foata normal form. 0/8287 useless extension candidates. Maximal degree in co-relation 19278. Up to 9399 conditions per place. [2022-11-25 18:06:18,674 INFO L137 encePairwiseOnDemand]: 282/291 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2022-11-25 18:06:18,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2022-11-25 18:06:18,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:06:18,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 18:06:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 306 transitions. [2022-11-25 18:06:18,697 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5257731958762887 [2022-11-25 18:06:18,698 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 306 transitions. [2022-11-25 18:06:18,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 306 transitions. [2022-11-25 18:06:18,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:18,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 306 transitions. [2022-11-25 18:06:18,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:18,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:18,721 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:18,723 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 306 transitions. [2022-11-25 18:06:18,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2022-11-25 18:06:18,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 18:06:18,733 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2022-11-25 18:06:18,735 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-11-25 18:06:18,740 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2022-11-25 18:06:18,741 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2022-11-25 18:06:18,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:18,743 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:18,743 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:06:18,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:06:18,744 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:18,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:18,746 INFO L85 PathProgramCache]: Analyzing trace with hash 582497423, now seen corresponding path program 1 times [2022-11-25 18:06:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:18,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552118287] [2022-11-25 18:06:18,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:18,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:19,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:19,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552118287] [2022-11-25 18:06:19,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552118287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:19,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:19,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:06:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630595202] [2022-11-25 18:06:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:19,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:06:19,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:19,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:06:19,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:06:19,185 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 291 [2022-11-25 18:06:19,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:19,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:19,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 291 [2022-11-25 18:06:19,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:20,441 INFO L130 PetriNetUnfolder]: 5463/7744 cut-off events. [2022-11-25 18:06:20,441 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:06:20,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15341 conditions, 7744 events. 5463/7744 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 41926 event pairs, 1453 based on Foata normal form. 0/7160 useless extension candidates. Maximal degree in co-relation 15338. Up to 5923 conditions per place. [2022-11-25 18:06:20,511 INFO L137 encePairwiseOnDemand]: 288/291 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2022-11-25 18:06:20,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 200 flow [2022-11-25 18:06:20,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:06:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:06:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2022-11-25 18:06:20,515 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5131729667812142 [2022-11-25 18:06:20,515 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2022-11-25 18:06:20,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2022-11-25 18:06:20,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:20,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2022-11-25 18:06:20,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:20,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:20,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:20,524 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 448 transitions. [2022-11-25 18:06:20,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 200 flow [2022-11-25 18:06:20,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 18:06:20,526 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2022-11-25 18:06:20,526 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-11-25 18:06:20,527 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2022-11-25 18:06:20,527 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2022-11-25 18:06:20,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:20,529 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:20,530 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:20,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:06:20,534 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:20,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:20,538 INFO L85 PathProgramCache]: Analyzing trace with hash -643992638, now seen corresponding path program 1 times [2022-11-25 18:06:20,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:20,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737416024] [2022-11-25 18:06:20,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:20,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:20,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:20,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737416024] [2022-11-25 18:06:20,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737416024] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:20,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:20,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:06:20,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57933302] [2022-11-25 18:06:20,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:20,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:06:20,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:20,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:06:20,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:06:20,834 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 291 [2022-11-25 18:06:20,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:20,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:20,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 291 [2022-11-25 18:06:20,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:24,249 INFO L130 PetriNetUnfolder]: 18481/24958 cut-off events. [2022-11-25 18:06:24,249 INFO L131 PetriNetUnfolder]: For 1252/1252 co-relation queries the response was YES. [2022-11-25 18:06:24,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51521 conditions, 24958 events. 18481/24958 cut-off events. For 1252/1252 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 132292 event pairs, 6623 based on Foata normal form. 0/24378 useless extension candidates. Maximal degree in co-relation 51517. Up to 15811 conditions per place. [2022-11-25 18:06:24,406 INFO L137 encePairwiseOnDemand]: 282/291 looper letters, 47 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2022-11-25 18:06:24,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 240 flow [2022-11-25 18:06:24,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:06:24,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:06:24,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2022-11-25 18:06:24,409 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4936998854524628 [2022-11-25 18:06:24,410 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2022-11-25 18:06:24,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2022-11-25 18:06:24,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:24,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2022-11-25 18:06:24,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:24,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:24,415 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:24,415 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 431 transitions. [2022-11-25 18:06:24,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 240 flow [2022-11-25 18:06:24,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:06:24,419 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 128 flow [2022-11-25 18:06:24,419 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-11-25 18:06:24,420 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2022-11-25 18:06:24,421 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 128 flow [2022-11-25 18:06:24,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:24,421 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:24,422 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:24,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:06:24,422 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:24,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1511063406, now seen corresponding path program 1 times [2022-11-25 18:06:24,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:24,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053041730] [2022-11-25 18:06:24,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:24,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:24,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:24,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:24,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053041730] [2022-11-25 18:06:24,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053041730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:24,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:24,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:06:24,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686813227] [2022-11-25 18:06:24,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:24,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:06:24,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:24,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:06:24,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:06:24,732 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 291 [2022-11-25 18:06:24,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:24,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:24,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 291 [2022-11-25 18:06:24,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:27,698 INFO L130 PetriNetUnfolder]: 17653/23842 cut-off events. [2022-11-25 18:06:27,699 INFO L131 PetriNetUnfolder]: For 8999/8999 co-relation queries the response was YES. [2022-11-25 18:06:27,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59523 conditions, 23842 events. 17653/23842 cut-off events. For 8999/8999 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 122561 event pairs, 4451 based on Foata normal form. 180/24022 useless extension candidates. Maximal degree in co-relation 59518. Up to 10673 conditions per place. [2022-11-25 18:06:27,856 INFO L137 encePairwiseOnDemand]: 283/291 looper letters, 60 selfloop transitions, 8 changer transitions 0/68 dead transitions. [2022-11-25 18:06:27,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 352 flow [2022-11-25 18:06:27,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:06:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:06:27,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2022-11-25 18:06:27,860 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4836769759450172 [2022-11-25 18:06:27,860 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 563 transitions. [2022-11-25 18:06:27,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 563 transitions. [2022-11-25 18:06:27,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:27,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 563 transitions. [2022-11-25 18:06:27,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:27,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:27,866 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:27,867 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 128 flow. Second operand 4 states and 563 transitions. [2022-11-25 18:06:27,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 352 flow [2022-11-25 18:06:27,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:06:27,926 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 170 flow [2022-11-25 18:06:27,926 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-11-25 18:06:27,928 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2022-11-25 18:06:27,928 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 170 flow [2022-11-25 18:06:27,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:27,929 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:27,930 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:27,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:06:27,930 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:27,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:27,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1511065571, now seen corresponding path program 1 times [2022-11-25 18:06:27,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:27,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418101194] [2022-11-25 18:06:27,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:28,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:28,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418101194] [2022-11-25 18:06:28,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418101194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:28,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:28,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:06:28,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762142872] [2022-11-25 18:06:28,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:28,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:06:28,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:28,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:06:28,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:06:29,094 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 291 [2022-11-25 18:06:29,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 170 flow. Second operand has 7 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:29,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:29,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 291 [2022-11-25 18:06:29,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:30,474 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([564] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| (mod v_~main$tmp_guard1~0_46 256)) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_50) (= v_~__unbuffered_p1_EAX~0_54 0) (= 0 v_~__unbuffered_p3_EBX~0_52) (= v_~__unbuffered_p0_EAX~0_80 0) (= v_~z~0_69 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][52], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 153#L822true, 81#L838true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 76#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 58#P1ENTRYtrue, P1Thread1of1ForFork2InUse, 127#L770true, 176#true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:30,474 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-11-25 18:06:30,475 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 18:06:30,475 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 18:06:30,475 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 18:06:30,475 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L880-->L866-3: Formula: (and (= v_~main$tmp_guard1~0_74 (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_76) (= v_~__unbuffered_p0_EAX~0_110 0) (= 0 v_~__unbuffered_p3_EBX~0_80) (= v_~__unbuffered_p1_EAX~0_84 0) (= v_~z~0_96 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| (mod v_~main$tmp_guard1~0_74 256)) (= |v_ULTIMATE.start_main_#res#1_36| 0) (= |v_#valid_216| (store (store (store |v_#valid_218| |v_ULTIMATE.start_main_~#t685~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0))) InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_218|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_53|, ~z~0=v_~z~0_96, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80} OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_74, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_216|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~z~0=v_~z~0_96} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][53], [30#L866-3true, P2Thread1of1ForFork1InUse, 190#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), 153#L822true, Black: 170#true, 81#L838true, 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 176#true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 58#P1ENTRYtrue, P1Thread1of1ForFork2InUse, 127#L770true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:30,476 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-11-25 18:06:30,476 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 18:06:30,476 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 18:06:30,476 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 18:06:30,477 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][54], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 41#L880true, 149#L845true, 153#L822true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 58#P1ENTRYtrue, P1Thread1of1ForFork2InUse, 176#true, 127#L770true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:30,478 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-11-25 18:06:30,478 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 18:06:30,478 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 18:06:30,478 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 18:06:30,479 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][54], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 149#L845true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L873true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, 58#P1ENTRYtrue, P1Thread1of1ForFork2InUse, 176#true, 127#L770true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:30,480 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-11-25 18:06:30,480 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 18:06:30,480 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 18:06:30,480 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-11-25 18:06:30,692 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([564] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| (mod v_~main$tmp_guard1~0_46 256)) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_50) (= v_~__unbuffered_p1_EAX~0_54 0) (= 0 v_~__unbuffered_p3_EBX~0_52) (= v_~__unbuffered_p0_EAX~0_80 0) (= v_~z~0_69 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][52], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 153#L822true, 81#L838true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 76#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, P1Thread1of1ForFork2InUse, 176#true, 127#L770true, 82#L792true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:30,693 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,693 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,693 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,693 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,693 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L880-->L866-3: Formula: (and (= v_~main$tmp_guard1~0_74 (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_76) (= v_~__unbuffered_p0_EAX~0_110 0) (= 0 v_~__unbuffered_p3_EBX~0_80) (= v_~__unbuffered_p1_EAX~0_84 0) (= v_~z~0_96 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| (mod v_~main$tmp_guard1~0_74 256)) (= |v_ULTIMATE.start_main_#res#1_36| 0) (= |v_#valid_216| (store (store (store |v_#valid_218| |v_ULTIMATE.start_main_~#t685~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0))) InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_218|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_53|, ~z~0=v_~z~0_96, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80} OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_74, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_216|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~z~0=v_~z~0_96} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][53], [30#L866-3true, P2Thread1of1ForFork1InUse, 190#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), 153#L822true, Black: 170#true, 81#L838true, 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 176#true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), P1Thread1of1ForFork2InUse, 127#L770true, 82#L792true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:30,693 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,693 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,693 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,694 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,694 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][54], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 41#L880true, 149#L845true, 153#L822true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), P1Thread1of1ForFork2InUse, 176#true, 127#L770true, 82#L792true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:30,694 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,694 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,695 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,695 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][54], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 149#L845true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L873true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 176#true, 127#L770true, 82#L792true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:30,696 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,696 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,696 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,696 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,709 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([564] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| (mod v_~main$tmp_guard1~0_46 256)) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_50) (= v_~__unbuffered_p1_EAX~0_54 0) (= 0 v_~__unbuffered_p3_EBX~0_52) (= v_~__unbuffered_p0_EAX~0_80 0) (= v_~z~0_69 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][52], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 134#P0EXITtrue, 153#L822true, 81#L838true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 76#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 58#P1ENTRYtrue, P1Thread1of1ForFork2InUse, 176#true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:30,709 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,709 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,709 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,709 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,709 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L880-->L866-3: Formula: (and (= v_~main$tmp_guard1~0_74 (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_76) (= v_~__unbuffered_p0_EAX~0_110 0) (= 0 v_~__unbuffered_p3_EBX~0_80) (= v_~__unbuffered_p1_EAX~0_84 0) (= v_~z~0_96 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| (mod v_~main$tmp_guard1~0_74 256)) (= |v_ULTIMATE.start_main_#res#1_36| 0) (= |v_#valid_216| (store (store (store |v_#valid_218| |v_ULTIMATE.start_main_~#t685~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0))) InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_218|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_53|, ~z~0=v_~z~0_96, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80} OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_74, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_216|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~z~0=v_~z~0_96} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][53], [P2Thread1of1ForFork1InUse, 30#L866-3true, 190#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), 134#P0EXITtrue, 153#L822true, 81#L838true, Black: 170#true, 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 176#true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 58#P1ENTRYtrue, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:30,710 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,710 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,710 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,710 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,710 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][54], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 41#L880true, 134#P0EXITtrue, 149#L845true, 153#L822true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 58#P1ENTRYtrue, P1Thread1of1ForFork2InUse, 176#true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:30,710 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,711 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,711 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,711 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,857 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][54], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 134#P0EXITtrue, 149#L845true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L873true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, 58#P1ENTRYtrue, P1Thread1of1ForFork2InUse, 176#true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:30,857 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,857 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,857 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,857 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,858 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([564] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| (mod v_~main$tmp_guard1~0_46 256)) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_50) (= v_~__unbuffered_p1_EAX~0_54 0) (= 0 v_~__unbuffered_p3_EBX~0_52) (= v_~__unbuffered_p0_EAX~0_80 0) (= v_~z~0_69 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][52], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 81#L838true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 76#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 22#P2EXITtrue, 58#P1ENTRYtrue, P1Thread1of1ForFork2InUse, 127#L770true, 176#true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:30,858 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,858 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,859 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,859 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,859 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L880-->L866-3: Formula: (and (= v_~main$tmp_guard1~0_74 (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_76) (= v_~__unbuffered_p0_EAX~0_110 0) (= 0 v_~__unbuffered_p3_EBX~0_80) (= v_~__unbuffered_p1_EAX~0_84 0) (= v_~z~0_96 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| (mod v_~main$tmp_guard1~0_74 256)) (= |v_ULTIMATE.start_main_#res#1_36| 0) (= |v_#valid_216| (store (store (store |v_#valid_218| |v_ULTIMATE.start_main_~#t685~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0))) InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_218|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_53|, ~z~0=v_~z~0_96, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80} OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_74, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_216|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~z~0=v_~z~0_96} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][53], [30#L866-3true, P2Thread1of1ForFork1InUse, 190#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), Black: 170#true, 81#L838true, 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 176#true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, 58#P1ENTRYtrue, P1Thread1of1ForFork2InUse, 127#L770true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:30,859 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,859 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,859 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,859 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,860 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][54], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 41#L880true, 149#L845true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, 58#P1ENTRYtrue, P1Thread1of1ForFork2InUse, 176#true, 127#L770true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:30,860 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,860 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,860 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:30,860 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-11-25 18:06:31,059 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([564] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| (mod v_~main$tmp_guard1~0_46 256)) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_50) (= v_~__unbuffered_p1_EAX~0_54 0) (= 0 v_~__unbuffered_p3_EBX~0_52) (= v_~__unbuffered_p0_EAX~0_80 0) (= v_~z~0_69 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][52], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 134#P0EXITtrue, 153#L822true, 81#L838true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 76#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, P1Thread1of1ForFork2InUse, 176#true, 82#L792true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,060 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,060 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,060 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,060 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,061 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L880-->L866-3: Formula: (and (= v_~main$tmp_guard1~0_74 (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_76) (= v_~__unbuffered_p0_EAX~0_110 0) (= 0 v_~__unbuffered_p3_EBX~0_80) (= v_~__unbuffered_p1_EAX~0_84 0) (= v_~z~0_96 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| (mod v_~main$tmp_guard1~0_74 256)) (= |v_ULTIMATE.start_main_#res#1_36| 0) (= |v_#valid_216| (store (store (store |v_#valid_218| |v_ULTIMATE.start_main_~#t685~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0))) InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_218|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_53|, ~z~0=v_~z~0_96, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80} OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_74, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_216|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~z~0=v_~z~0_96} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][53], [30#L866-3true, P2Thread1of1ForFork1InUse, 190#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), 134#P0EXITtrue, 153#L822true, Black: 170#true, 81#L838true, 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 176#true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), P1Thread1of1ForFork2InUse, 82#L792true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,061 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,061 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,061 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,062 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,062 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][54], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 41#L880true, 134#P0EXITtrue, 149#L845true, 153#L822true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), P1Thread1of1ForFork2InUse, 176#true, 82#L792true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,062 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,063 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,063 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,063 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,064 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][54], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 134#P0EXITtrue, 149#L845true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L873true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 176#true, 82#L792true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,064 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,064 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,064 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,065 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,065 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([564] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| (mod v_~main$tmp_guard1~0_46 256)) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_50) (= v_~__unbuffered_p1_EAX~0_54 0) (= 0 v_~__unbuffered_p3_EBX~0_52) (= v_~__unbuffered_p0_EAX~0_80 0) (= v_~z~0_69 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][52], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 81#L838true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 76#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 176#true, 127#L770true, 82#L792true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,066 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,066 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,066 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,066 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,067 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L880-->L866-3: Formula: (and (= v_~main$tmp_guard1~0_74 (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_76) (= v_~__unbuffered_p0_EAX~0_110 0) (= 0 v_~__unbuffered_p3_EBX~0_80) (= v_~__unbuffered_p1_EAX~0_84 0) (= v_~z~0_96 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| (mod v_~main$tmp_guard1~0_74 256)) (= |v_ULTIMATE.start_main_#res#1_36| 0) (= |v_#valid_216| (store (store (store |v_#valid_218| |v_ULTIMATE.start_main_~#t685~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0))) InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_218|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_53|, ~z~0=v_~z~0_96, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80} OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_74, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_216|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~z~0=v_~z~0_96} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][53], [P2Thread1of1ForFork1InUse, 30#L866-3true, 190#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), Black: 170#true, 81#L838true, 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 176#true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 127#L770true, 82#L792true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,067 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,067 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,067 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,067 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,068 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][54], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 41#L880true, 149#L845true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 176#true, 127#L770true, 82#L792true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,068 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,068 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,068 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,069 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,080 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([564] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| (mod v_~main$tmp_guard1~0_46 256)) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_50) (= v_~__unbuffered_p1_EAX~0_54 0) (= 0 v_~__unbuffered_p3_EBX~0_52) (= v_~__unbuffered_p0_EAX~0_80 0) (= v_~z~0_69 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][52], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 134#P0EXITtrue, 81#L838true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 76#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 22#P2EXITtrue, 58#P1ENTRYtrue, P1Thread1of1ForFork2InUse, 176#true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,081 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,081 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,081 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,081 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,082 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L880-->L866-3: Formula: (and (= v_~main$tmp_guard1~0_74 (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_76) (= v_~__unbuffered_p0_EAX~0_110 0) (= 0 v_~__unbuffered_p3_EBX~0_80) (= v_~__unbuffered_p1_EAX~0_84 0) (= v_~z~0_96 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| (mod v_~main$tmp_guard1~0_74 256)) (= |v_ULTIMATE.start_main_#res#1_36| 0) (= |v_#valid_216| (store (store (store |v_#valid_218| |v_ULTIMATE.start_main_~#t685~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0))) InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_218|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_53|, ~z~0=v_~z~0_96, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80} OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_74, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_216|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~z~0=v_~z~0_96} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][53], [30#L866-3true, P2Thread1of1ForFork1InUse, 190#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), 134#P0EXITtrue, Black: 170#true, 81#L838true, 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 176#true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, 58#P1ENTRYtrue, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,082 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,082 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,082 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,082 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,083 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][54], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 41#L880true, 134#P0EXITtrue, 149#L845true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, 58#P1ENTRYtrue, P1Thread1of1ForFork2InUse, 176#true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,083 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,084 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,084 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,084 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:31,211 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([564] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| (mod v_~main$tmp_guard1~0_46 256)) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_50) (= v_~__unbuffered_p1_EAX~0_54 0) (= 0 v_~__unbuffered_p3_EBX~0_52) (= v_~__unbuffered_p0_EAX~0_80 0) (= v_~z~0_69 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][52], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 81#L838true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 147#L795true, Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 76#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 127#L770true, 176#true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,211 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,211 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,211 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,211 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,212 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][54], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 41#L880true, 149#L845true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 147#L795true, Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 127#L770true, 176#true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,212 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,212 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,212 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,212 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,222 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([564] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| (mod v_~main$tmp_guard1~0_46 256)) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_50) (= v_~__unbuffered_p1_EAX~0_54 0) (= 0 v_~__unbuffered_p3_EBX~0_52) (= v_~__unbuffered_p0_EAX~0_80 0) (= v_~z~0_69 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][52], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 134#P0EXITtrue, 81#L838true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 76#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 176#true, 82#L792true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,222 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,222 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,222 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,222 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,223 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L880-->L866-3: Formula: (and (= v_~main$tmp_guard1~0_74 (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_76) (= v_~__unbuffered_p0_EAX~0_110 0) (= 0 v_~__unbuffered_p3_EBX~0_80) (= v_~__unbuffered_p1_EAX~0_84 0) (= v_~z~0_96 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| (mod v_~main$tmp_guard1~0_74 256)) (= |v_ULTIMATE.start_main_#res#1_36| 0) (= |v_#valid_216| (store (store (store |v_#valid_218| |v_ULTIMATE.start_main_~#t685~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0))) InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_218|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_53|, ~z~0=v_~z~0_96, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80} OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_74, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_216|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~z~0=v_~z~0_96} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][53], [P2Thread1of1ForFork1InUse, 30#L866-3true, 190#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), 134#P0EXITtrue, Black: 170#true, 81#L838true, 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 176#true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 82#L792true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,223 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,223 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,223 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,224 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,224 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][54], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 41#L880true, 134#P0EXITtrue, 149#L845true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 176#true, 82#L792true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,224 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,224 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,225 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,225 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:31,294 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L880-->L866-3: Formula: (and (= v_~main$tmp_guard1~0_74 (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_76) (= v_~__unbuffered_p0_EAX~0_110 0) (= 0 v_~__unbuffered_p3_EBX~0_80) (= v_~__unbuffered_p1_EAX~0_84 0) (= v_~z~0_96 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| (mod v_~main$tmp_guard1~0_74 256)) (= |v_ULTIMATE.start_main_#res#1_36| 0) (= |v_#valid_216| (store (store (store |v_#valid_218| |v_ULTIMATE.start_main_~#t685~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0))) InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_218|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_53|, ~z~0=v_~z~0_96, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80} OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_74, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_216|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~z~0=v_~z~0_96} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][53], [P2Thread1of1ForFork1InUse, 30#L866-3true, 190#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), 81#L838true, Black: 170#true, 147#L795true, 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 176#true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 127#L770true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,295 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2022-11-25 18:06:31,295 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-25 18:06:31,295 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-25 18:06:31,295 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-11-25 18:06:31,355 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([564] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| (mod v_~main$tmp_guard1~0_46 256)) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_50) (= v_~__unbuffered_p1_EAX~0_54 0) (= 0 v_~__unbuffered_p3_EBX~0_52) (= v_~__unbuffered_p0_EAX~0_80 0) (= v_~z~0_69 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][52], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 134#P0EXITtrue, 81#L838true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 147#L795true, Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 76#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 176#true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,355 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 18:06:31,355 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 18:06:31,356 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 18:06:31,356 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 18:06:31,357 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][54], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 41#L880true, 134#P0EXITtrue, 149#L845true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 147#L795true, Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 176#true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,357 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 18:06:31,357 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 18:06:31,357 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 18:06:31,357 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 18:06:31,387 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([574] L880-->L866-3: Formula: (and (= v_~main$tmp_guard1~0_74 (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_76) (= v_~__unbuffered_p0_EAX~0_110 0) (= 0 v_~__unbuffered_p3_EBX~0_80) (= v_~__unbuffered_p1_EAX~0_84 0) (= v_~z~0_96 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| (mod v_~main$tmp_guard1~0_74 256)) (= |v_ULTIMATE.start_main_#res#1_36| 0) (= |v_#valid_216| (store (store (store |v_#valid_218| |v_ULTIMATE.start_main_~#t685~0#1.base_53| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_39| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0))) InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_218|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_53|, ~z~0=v_~z~0_96, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80} OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_31|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_74, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_80, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_84, #valid=|v_#valid_216|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_76, ~z~0=v_~z~0_96} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][53], [P2Thread1of1ForFork1InUse, 30#L866-3true, 190#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), 134#P0EXITtrue, Black: 170#true, 81#L838true, 147#L795true, 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 176#true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:31,388 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2022-11-25 18:06:31,388 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 18:06:31,388 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 18:06:31,388 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-11-25 18:06:31,491 INFO L130 PetriNetUnfolder]: 10611/15051 cut-off events. [2022-11-25 18:06:31,491 INFO L131 PetriNetUnfolder]: For 8960/10078 co-relation queries the response was YES. [2022-11-25 18:06:31,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38425 conditions, 15051 events. 10611/15051 cut-off events. For 8960/10078 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 87991 event pairs, 2659 based on Foata normal form. 973/15328 useless extension candidates. Maximal degree in co-relation 38418. Up to 9557 conditions per place. [2022-11-25 18:06:31,592 INFO L137 encePairwiseOnDemand]: 285/291 looper letters, 42 selfloop transitions, 4 changer transitions 18/74 dead transitions. [2022-11-25 18:06:31,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 74 transitions, 398 flow [2022-11-25 18:06:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:06:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:06:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2022-11-25 18:06:31,596 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4256259204712813 [2022-11-25 18:06:31,596 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 867 transitions. [2022-11-25 18:06:31,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 867 transitions. [2022-11-25 18:06:31,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:31,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 867 transitions. [2022-11-25 18:06:31,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 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-11-25 18:06:31,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:31,605 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:31,605 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 170 flow. Second operand 7 states and 867 transitions. [2022-11-25 18:06:31,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 74 transitions, 398 flow [2022-11-25 18:06:31,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 395 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:06:31,647 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 155 flow [2022-11-25 18:06:31,648 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=155, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2022-11-25 18:06:31,651 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2022-11-25 18:06:31,651 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 155 flow [2022-11-25 18:06:31,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:31,652 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:31,652 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:31,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:06:31,653 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:31,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:31,653 INFO L85 PathProgramCache]: Analyzing trace with hash -431378709, now seen corresponding path program 1 times [2022-11-25 18:06:31,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:31,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350002296] [2022-11-25 18:06:31,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:31,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:31,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:31,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350002296] [2022-11-25 18:06:31,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350002296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:31,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:31,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:31,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364550615] [2022-11-25 18:06:31,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:31,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:06:31,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:31,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:06:31,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:06:31,980 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 291 [2022-11-25 18:06:31,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:31,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:31,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 291 [2022-11-25 18:06:31,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:33,114 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][59], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 192#true, 149#L845true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 147#L795true, Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L873true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 176#true, 127#L770true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:33,114 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-11-25 18:06:33,114 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:33,114 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:33,115 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-11-25 18:06:33,283 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([564] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| (mod v_~main$tmp_guard1~0_46 256)) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_50) (= v_~__unbuffered_p1_EAX~0_54 0) (= 0 v_~__unbuffered_p3_EBX~0_52) (= v_~__unbuffered_p0_EAX~0_80 0) (= v_~z~0_69 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][63], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 192#true, 81#L838true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 147#L795true, Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 76#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 127#L770true, 176#true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:33,283 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 18:06:33,283 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:33,283 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:33,283 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:33,284 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][59], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 41#L880true, 192#true, 149#L845true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 147#L795true, Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 127#L770true, 176#true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:33,284 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 18:06:33,284 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:33,284 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:33,285 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:33,286 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][59], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 192#true, 134#P0EXITtrue, 149#L845true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 147#L795true, Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 49#L873true, Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 176#true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:33,286 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-11-25 18:06:33,286 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:33,286 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:33,286 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-11-25 18:06:33,402 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([564] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| (mod v_~main$tmp_guard1~0_46 256)) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_50) (= v_~__unbuffered_p1_EAX~0_54 0) (= 0 v_~__unbuffered_p3_EBX~0_52) (= v_~__unbuffered_p0_EAX~0_80 0) (= v_~z~0_69 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~z~0=v_~z~0_69, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_52} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][63], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 192#true, 134#P0EXITtrue, 81#L838true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 147#L795true, Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 76#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 176#true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:33,403 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 18:06:33,403 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 18:06:33,403 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 18:06:33,403 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 18:06:33,404 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([433] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_95 256) 0)) .cse4)) (.cse2 (and .cse5 .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39)) v_~x~0_38) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_94 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= v_~x$w_buff1_used~0_94 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_95))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_95, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_94, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][59], [P2Thread1of1ForFork1InUse, 189#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 41#L880true, 192#true, 134#P0EXITtrue, 149#L845true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 147#L795true, Black: 179#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 178#(= ~__unbuffered_p3_EAX~0 0), 22#P2EXITtrue, P1Thread1of1ForFork2InUse, 176#true, P3Thread1of1ForFork3InUse, 163#true, P0Thread1of1ForFork0InUse]) [2022-11-25 18:06:33,404 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-11-25 18:06:33,404 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 18:06:33,404 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 18:06:33,404 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-11-25 18:06:33,497 INFO L130 PetriNetUnfolder]: 6544/9728 cut-off events. [2022-11-25 18:06:33,497 INFO L131 PetriNetUnfolder]: For 3298/3481 co-relation queries the response was YES. [2022-11-25 18:06:33,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22987 conditions, 9728 events. 6544/9728 cut-off events. For 3298/3481 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 59789 event pairs, 1022 based on Foata normal form. 698/10043 useless extension candidates. Maximal degree in co-relation 22979. Up to 4239 conditions per place. [2022-11-25 18:06:33,564 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 57 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2022-11-25 18:06:33,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 399 flow [2022-11-25 18:06:33,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:06:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:06:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2022-11-25 18:06:33,567 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4879725085910653 [2022-11-25 18:06:33,568 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2022-11-25 18:06:33,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2022-11-25 18:06:33,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:33,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2022-11-25 18:06:33,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:33,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:33,574 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:33,574 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 155 flow. Second operand 4 states and 568 transitions. [2022-11-25 18:06:33,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 399 flow [2022-11-25 18:06:33,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 387 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 18:06:33,582 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 194 flow [2022-11-25 18:06:33,582 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2022-11-25 18:06:33,583 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2022-11-25 18:06:33,583 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 194 flow [2022-11-25 18:06:33,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:33,584 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:33,584 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:33,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:06:33,584 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:33,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:33,585 INFO L85 PathProgramCache]: Analyzing trace with hash -31870706, now seen corresponding path program 1 times [2022-11-25 18:06:33,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:33,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215877366] [2022-11-25 18:06:33,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:33,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:33,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:33,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215877366] [2022-11-25 18:06:33,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215877366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:33,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:33,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:33,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556164691] [2022-11-25 18:06:33,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:33,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:06:33,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:33,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:06:33,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:06:33,942 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 291 [2022-11-25 18:06:33,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:33,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:33,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 291 [2022-11-25 18:06:33,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:35,545 INFO L130 PetriNetUnfolder]: 11006/15728 cut-off events. [2022-11-25 18:06:35,545 INFO L131 PetriNetUnfolder]: For 14164/14164 co-relation queries the response was YES. [2022-11-25 18:06:35,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48642 conditions, 15728 events. 11006/15728 cut-off events. For 14164/14164 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 88886 event pairs, 1522 based on Foata normal form. 161/15889 useless extension candidates. Maximal degree in co-relation 48632. Up to 7348 conditions per place. [2022-11-25 18:06:35,652 INFO L137 encePairwiseOnDemand]: 282/291 looper letters, 93 selfloop transitions, 21 changer transitions 4/118 dead transitions. [2022-11-25 18:06:35,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 118 transitions, 750 flow [2022-11-25 18:06:35,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:06:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:06:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2022-11-25 18:06:35,658 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4865979381443299 [2022-11-25 18:06:35,659 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2022-11-25 18:06:35,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2022-11-25 18:06:35,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:35,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2022-11-25 18:06:35,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:35,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:35,667 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:35,667 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 194 flow. Second operand 5 states and 708 transitions. [2022-11-25 18:06:35,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 118 transitions, 750 flow [2022-11-25 18:06:35,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 118 transitions, 745 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:06:35,690 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 344 flow [2022-11-25 18:06:35,690 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=344, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2022-11-25 18:06:35,691 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2022-11-25 18:06:35,692 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 344 flow [2022-11-25 18:06:35,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:35,692 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:35,693 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:35,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:06:35,693 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:35,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:35,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1880730089, now seen corresponding path program 1 times [2022-11-25 18:06:35,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:35,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288791892] [2022-11-25 18:06:35,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:35,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:35,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:35,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288791892] [2022-11-25 18:06:35,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288791892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:35,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:35,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:06:35,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171479171] [2022-11-25 18:06:35,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:35,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:06:35,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:35,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:06:35,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:06:35,982 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 291 [2022-11-25 18:06:35,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 344 flow. Second operand has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:35,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:35,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 291 [2022-11-25 18:06:35,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:37,237 INFO L130 PetriNetUnfolder]: 4691/7286 cut-off events. [2022-11-25 18:06:37,237 INFO L131 PetriNetUnfolder]: For 9335/9486 co-relation queries the response was YES. [2022-11-25 18:06:37,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22836 conditions, 7286 events. 4691/7286 cut-off events. For 9335/9486 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 44589 event pairs, 482 based on Foata normal form. 635/7730 useless extension candidates. Maximal degree in co-relation 22823. Up to 2606 conditions per place. [2022-11-25 18:06:37,295 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 84 selfloop transitions, 10 changer transitions 0/113 dead transitions. [2022-11-25 18:06:37,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 113 transitions, 828 flow [2022-11-25 18:06:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:06:37,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:06:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2022-11-25 18:06:37,299 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48934707903780067 [2022-11-25 18:06:37,299 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2022-11-25 18:06:37,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2022-11-25 18:06:37,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:37,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2022-11-25 18:06:37,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:37,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:37,307 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:37,308 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 344 flow. Second operand 5 states and 712 transitions. [2022-11-25 18:06:37,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 113 transitions, 828 flow [2022-11-25 18:06:37,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 113 transitions, 820 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 18:06:37,328 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 403 flow [2022-11-25 18:06:37,329 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=403, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2022-11-25 18:06:37,329 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2022-11-25 18:06:37,330 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 403 flow [2022-11-25 18:06:37,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:37,330 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:37,331 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:37,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:06:37,331 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash 663606009, now seen corresponding path program 1 times [2022-11-25 18:06:37,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:37,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104423146] [2022-11-25 18:06:37,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:37,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:38,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:38,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104423146] [2022-11-25 18:06:38,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104423146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:38,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:38,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:06:38,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098307965] [2022-11-25 18:06:38,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:38,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:06:38,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:38,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:06:38,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:06:38,312 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2022-11-25 18:06:38,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 403 flow. Second operand has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:38,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:38,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2022-11-25 18:06:38,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:40,410 INFO L130 PetriNetUnfolder]: 7483/11812 cut-off events. [2022-11-25 18:06:40,410 INFO L131 PetriNetUnfolder]: For 25116/25475 co-relation queries the response was YES. [2022-11-25 18:06:40,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43566 conditions, 11812 events. 7483/11812 cut-off events. For 25116/25475 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 80439 event pairs, 589 based on Foata normal form. 109/11647 useless extension candidates. Maximal degree in co-relation 43551. Up to 5188 conditions per place. [2022-11-25 18:06:40,494 INFO L137 encePairwiseOnDemand]: 283/291 looper letters, 116 selfloop transitions, 10 changer transitions 47/192 dead transitions. [2022-11-25 18:06:40,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 192 transitions, 1571 flow [2022-11-25 18:06:40,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:06:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:06:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1009 transitions. [2022-11-25 18:06:40,499 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4953362788414335 [2022-11-25 18:06:40,499 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1009 transitions. [2022-11-25 18:06:40,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1009 transitions. [2022-11-25 18:06:40,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:40,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1009 transitions. [2022-11-25 18:06:40,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.14285714285714) internal successors, (1009), 7 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:40,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:40,508 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:40,508 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 403 flow. Second operand 7 states and 1009 transitions. [2022-11-25 18:06:40,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 192 transitions, 1571 flow [2022-11-25 18:06:40,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 192 transitions, 1497 flow, removed 22 selfloop flow, removed 2 redundant places. [2022-11-25 18:06:40,690 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 483 flow [2022-11-25 18:06:40,690 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=483, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2022-11-25 18:06:40,691 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2022-11-25 18:06:40,691 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 483 flow [2022-11-25 18:06:40,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:40,692 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:40,692 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:40,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:06:40,692 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:40,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:40,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1980000002, now seen corresponding path program 1 times [2022-11-25 18:06:40,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:40,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814175377] [2022-11-25 18:06:40,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:40,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:40,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:40,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814175377] [2022-11-25 18:06:40,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814175377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:40,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:40,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:06:40,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646246499] [2022-11-25 18:06:40,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:40,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:06:40,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:40,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:06:40,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:06:40,992 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 291 [2022-11-25 18:06:40,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 483 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:40,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:40,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 291 [2022-11-25 18:06:40,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:43,123 INFO L130 PetriNetUnfolder]: 11070/16934 cut-off events. [2022-11-25 18:06:43,123 INFO L131 PetriNetUnfolder]: For 54772/54772 co-relation queries the response was YES. [2022-11-25 18:06:43,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73983 conditions, 16934 events. 11070/16934 cut-off events. For 54772/54772 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 110226 event pairs, 1821 based on Foata normal form. 98/17032 useless extension candidates. Maximal degree in co-relation 73964. Up to 6586 conditions per place. [2022-11-25 18:06:43,227 INFO L137 encePairwiseOnDemand]: 282/291 looper letters, 149 selfloop transitions, 20 changer transitions 25/194 dead transitions. [2022-11-25 18:06:43,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 194 transitions, 1679 flow [2022-11-25 18:06:43,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:06:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:06:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions. [2022-11-25 18:06:43,232 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48396334478808706 [2022-11-25 18:06:43,233 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 845 transitions. [2022-11-25 18:06:43,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 845 transitions. [2022-11-25 18:06:43,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:43,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 845 transitions. [2022-11-25 18:06:43,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:43,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:43,244 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:43,244 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 483 flow. Second operand 6 states and 845 transitions. [2022-11-25 18:06:43,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 194 transitions, 1679 flow [2022-11-25 18:06:43,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 194 transitions, 1638 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-11-25 18:06:43,341 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 511 flow [2022-11-25 18:06:43,342 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=511, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2022-11-25 18:06:43,343 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2022-11-25 18:06:43,344 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 511 flow [2022-11-25 18:06:43,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:43,345 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:43,345 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:43,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:06:43,345 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:43,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:43,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2064252704, now seen corresponding path program 2 times [2022-11-25 18:06:43,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:43,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996285343] [2022-11-25 18:06:43,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:43,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:43,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:43,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:43,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996285343] [2022-11-25 18:06:43,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996285343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:43,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:43,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:06:43,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399061143] [2022-11-25 18:06:43,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:43,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:06:43,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:43,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:06:43,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:06:43,646 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 291 [2022-11-25 18:06:43,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 511 flow. Second operand has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:43,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:43,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 291 [2022-11-25 18:06:43,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:44,912 INFO L130 PetriNetUnfolder]: 4810/7997 cut-off events. [2022-11-25 18:06:44,912 INFO L131 PetriNetUnfolder]: For 26919/27253 co-relation queries the response was YES. [2022-11-25 18:06:44,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33053 conditions, 7997 events. 4810/7997 cut-off events. For 26919/27253 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 54882 event pairs, 483 based on Foata normal form. 561/8445 useless extension candidates. Maximal degree in co-relation 33034. Up to 2496 conditions per place. [2022-11-25 18:06:44,965 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 117 selfloop transitions, 14 changer transitions 7/157 dead transitions. [2022-11-25 18:06:44,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 157 transitions, 1393 flow [2022-11-25 18:06:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:06:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:06:44,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 854 transitions. [2022-11-25 18:06:44,969 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48911798396334477 [2022-11-25 18:06:44,969 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 854 transitions. [2022-11-25 18:06:44,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 854 transitions. [2022-11-25 18:06:44,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:44,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 854 transitions. [2022-11-25 18:06:44,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.33333333333334) internal successors, (854), 6 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:44,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:44,978 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:44,978 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 511 flow. Second operand 6 states and 854 transitions. [2022-11-25 18:06:44,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 157 transitions, 1393 flow [2022-11-25 18:06:45,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 157 transitions, 1298 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-11-25 18:06:45,264 INFO L231 Difference]: Finished difference. Result has 72 places, 68 transitions, 534 flow [2022-11-25 18:06:45,265 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=534, PETRI_PLACES=72, PETRI_TRANSITIONS=68} [2022-11-25 18:06:45,265 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2022-11-25 18:06:45,265 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 68 transitions, 534 flow [2022-11-25 18:06:45,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:45,266 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:45,266 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:45,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:06:45,267 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:45,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:45,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1414477832, now seen corresponding path program 1 times [2022-11-25 18:06:45,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:45,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791351466] [2022-11-25 18:06:45,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:45,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:45,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:45,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791351466] [2022-11-25 18:06:45,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791351466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:45,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:45,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:06:45,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649054222] [2022-11-25 18:06:45,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:45,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:06:45,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:45,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:06:45,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:06:45,564 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 291 [2022-11-25 18:06:45,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 534 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:45,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:45,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 291 [2022-11-25 18:06:45,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:47,172 INFO L130 PetriNetUnfolder]: 7929/12533 cut-off events. [2022-11-25 18:06:47,172 INFO L131 PetriNetUnfolder]: For 47916/47916 co-relation queries the response was YES. [2022-11-25 18:06:47,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56916 conditions, 12533 events. 7929/12533 cut-off events. For 47916/47916 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 81502 event pairs, 898 based on Foata normal form. 15/12548 useless extension candidates. Maximal degree in co-relation 56897. Up to 5421 conditions per place. [2022-11-25 18:06:47,266 INFO L137 encePairwiseOnDemand]: 282/291 looper letters, 109 selfloop transitions, 20 changer transitions 68/197 dead transitions. [2022-11-25 18:06:47,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 197 transitions, 1902 flow [2022-11-25 18:06:47,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:06:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:06:47,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 831 transitions. [2022-11-25 18:06:47,270 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47594501718213056 [2022-11-25 18:06:47,271 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 831 transitions. [2022-11-25 18:06:47,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 831 transitions. [2022-11-25 18:06:47,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:47,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 831 transitions. [2022-11-25 18:06:47,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:47,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:47,278 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:47,278 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 534 flow. Second operand 6 states and 831 transitions. [2022-11-25 18:06:47,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 197 transitions, 1902 flow [2022-11-25 18:06:47,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 197 transitions, 1791 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-11-25 18:06:47,577 INFO L231 Difference]: Finished difference. Result has 75 places, 66 transitions, 532 flow [2022-11-25 18:06:47,578 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=532, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2022-11-25 18:06:47,578 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2022-11-25 18:06:47,579 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 532 flow [2022-11-25 18:06:47,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:47,579 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:47,580 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:47,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:06:47,580 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:47,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:47,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1672130072, now seen corresponding path program 1 times [2022-11-25 18:06:47,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:47,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048545078] [2022-11-25 18:06:47,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:47,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:48,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:48,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048545078] [2022-11-25 18:06:48,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048545078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:48,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:48,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:06:48,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641529804] [2022-11-25 18:06:48,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:48,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:06:48,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:48,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:06:48,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:06:48,710 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 291 [2022-11-25 18:06:48,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 532 flow. Second operand has 7 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:48,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:48,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 291 [2022-11-25 18:06:48,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:50,393 INFO L130 PetriNetUnfolder]: 5715/9239 cut-off events. [2022-11-25 18:06:50,394 INFO L131 PetriNetUnfolder]: For 31680/31680 co-relation queries the response was YES. [2022-11-25 18:06:50,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41150 conditions, 9239 events. 5715/9239 cut-off events. For 31680/31680 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 59624 event pairs, 924 based on Foata normal form. 8/9247 useless extension candidates. Maximal degree in co-relation 41129. Up to 4163 conditions per place. [2022-11-25 18:06:50,447 INFO L137 encePairwiseOnDemand]: 279/291 looper letters, 142 selfloop transitions, 59 changer transitions 40/241 dead transitions. [2022-11-25 18:06:50,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 241 transitions, 2312 flow [2022-11-25 18:06:50,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:06:50,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 18:06:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1056 transitions. [2022-11-25 18:06:50,452 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4536082474226804 [2022-11-25 18:06:50,452 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1056 transitions. [2022-11-25 18:06:50,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1056 transitions. [2022-11-25 18:06:50,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:50,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1056 transitions. [2022-11-25 18:06:50,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:50,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 291.0) internal successors, (2619), 9 states have internal predecessors, (2619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:50,462 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 291.0) internal successors, (2619), 9 states have internal predecessors, (2619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:50,462 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 532 flow. Second operand 8 states and 1056 transitions. [2022-11-25 18:06:50,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 241 transitions, 2312 flow [2022-11-25 18:06:50,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 241 transitions, 2181 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-11-25 18:06:50,882 INFO L231 Difference]: Finished difference. Result has 83 places, 108 transitions, 1162 flow [2022-11-25 18:06:50,882 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1162, PETRI_PLACES=83, PETRI_TRANSITIONS=108} [2022-11-25 18:06:50,883 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 31 predicate places. [2022-11-25 18:06:50,883 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 108 transitions, 1162 flow [2022-11-25 18:06:50,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:50,884 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:50,884 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:50,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:06:50,885 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:50,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:50,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1069877811, now seen corresponding path program 1 times [2022-11-25 18:06:50,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:50,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011713393] [2022-11-25 18:06:50,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:50,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:51,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:51,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011713393] [2022-11-25 18:06:51,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011713393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:51,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:51,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:06:51,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143479275] [2022-11-25 18:06:51,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:51,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:06:51,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:51,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:06:51,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:06:51,120 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 291 [2022-11-25 18:06:51,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 108 transitions, 1162 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:51,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:51,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 291 [2022-11-25 18:06:51,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:52,888 INFO L130 PetriNetUnfolder]: 7606/12329 cut-off events. [2022-11-25 18:06:52,888 INFO L131 PetriNetUnfolder]: For 54323/54323 co-relation queries the response was YES. [2022-11-25 18:06:52,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58356 conditions, 12329 events. 7606/12329 cut-off events. For 54323/54323 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 82689 event pairs, 2417 based on Foata normal form. 14/12343 useless extension candidates. Maximal degree in co-relation 58331. Up to 6150 conditions per place. [2022-11-25 18:06:52,977 INFO L137 encePairwiseOnDemand]: 285/291 looper letters, 92 selfloop transitions, 21 changer transitions 58/171 dead transitions. [2022-11-25 18:06:52,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 171 transitions, 2030 flow [2022-11-25 18:06:52,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:06:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:06:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2022-11-25 18:06:52,979 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4802405498281787 [2022-11-25 18:06:52,979 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2022-11-25 18:06:52,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2022-11-25 18:06:52,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:52,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2022-11-25 18:06:52,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:52,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:52,985 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:52,985 INFO L175 Difference]: Start difference. First operand has 83 places, 108 transitions, 1162 flow. Second operand 4 states and 559 transitions. [2022-11-25 18:06:52,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 171 transitions, 2030 flow [2022-11-25 18:06:53,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 171 transitions, 1961 flow, removed 22 selfloop flow, removed 2 redundant places. [2022-11-25 18:06:53,906 INFO L231 Difference]: Finished difference. Result has 86 places, 87 transitions, 857 flow [2022-11-25 18:06:53,907 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=857, PETRI_PLACES=86, PETRI_TRANSITIONS=87} [2022-11-25 18:06:53,907 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 34 predicate places. [2022-11-25 18:06:53,907 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 87 transitions, 857 flow [2022-11-25 18:06:53,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:53,908 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:53,908 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:53,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:06:53,909 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:53,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:53,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1986242950, now seen corresponding path program 2 times [2022-11-25 18:06:53,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:53,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828926905] [2022-11-25 18:06:53,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:53,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:54,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:54,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828926905] [2022-11-25 18:06:54,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828926905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:54,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:54,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:06:54,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931247587] [2022-11-25 18:06:54,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:54,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:06:54,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:54,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:06:54,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:06:54,332 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 291 [2022-11-25 18:06:54,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 87 transitions, 857 flow. Second operand has 7 states, 7 states have (on average 130.85714285714286) internal successors, (916), 7 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:54,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:54,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 291 [2022-11-25 18:06:54,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:55,720 INFO L130 PetriNetUnfolder]: 4095/7085 cut-off events. [2022-11-25 18:06:55,721 INFO L131 PetriNetUnfolder]: For 30676/31166 co-relation queries the response was YES. [2022-11-25 18:06:55,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30852 conditions, 7085 events. 4095/7085 cut-off events. For 30676/31166 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 50746 event pairs, 378 based on Foata normal form. 318/7243 useless extension candidates. Maximal degree in co-relation 30826. Up to 2652 conditions per place. [2022-11-25 18:06:55,764 INFO L137 encePairwiseOnDemand]: 284/291 looper letters, 73 selfloop transitions, 18 changer transitions 85/181 dead transitions. [2022-11-25 18:06:55,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 181 transitions, 1960 flow [2022-11-25 18:06:55,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:06:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:06:55,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 970 transitions. [2022-11-25 18:06:55,769 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-11-25 18:06:55,769 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 970 transitions. [2022-11-25 18:06:55,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 970 transitions. [2022-11-25 18:06:55,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:55,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 970 transitions. [2022-11-25 18:06:55,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.57142857142858) internal successors, (970), 7 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:55,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:55,777 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:55,778 INFO L175 Difference]: Start difference. First operand has 86 places, 87 transitions, 857 flow. Second operand 7 states and 970 transitions. [2022-11-25 18:06:55,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 181 transitions, 1960 flow [2022-11-25 18:06:56,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 181 transitions, 1944 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-11-25 18:06:56,179 INFO L231 Difference]: Finished difference. Result has 93 places, 57 transitions, 502 flow [2022-11-25 18:06:56,180 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=502, PETRI_PLACES=93, PETRI_TRANSITIONS=57} [2022-11-25 18:06:56,180 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 41 predicate places. [2022-11-25 18:06:56,180 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 57 transitions, 502 flow [2022-11-25 18:06:56,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 130.85714285714286) internal successors, (916), 7 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:56,181 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:56,181 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:56,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:06:56,182 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:56,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1064101365, now seen corresponding path program 1 times [2022-11-25 18:06:56,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:56,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647068870] [2022-11-25 18:06:56,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:56,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:57,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:57,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647068870] [2022-11-25 18:06:57,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647068870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:57,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:57,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:06:57,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503460251] [2022-11-25 18:06:57,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:57,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:06:57,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:57,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:06:57,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:06:57,121 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 291 [2022-11-25 18:06:57,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 57 transitions, 502 flow. Second operand has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 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-11-25 18:06:57,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:57,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 291 [2022-11-25 18:06:57,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:57,645 INFO L130 PetriNetUnfolder]: 532/893 cut-off events. [2022-11-25 18:06:57,645 INFO L131 PetriNetUnfolder]: For 3550/3550 co-relation queries the response was YES. [2022-11-25 18:06:57,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4298 conditions, 893 events. 532/893 cut-off events. For 3550/3550 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3496 event pairs, 36 based on Foata normal form. 1/894 useless extension candidates. Maximal degree in co-relation 4270. Up to 368 conditions per place. [2022-11-25 18:06:57,653 INFO L137 encePairwiseOnDemand]: 281/291 looper letters, 82 selfloop transitions, 18 changer transitions 26/126 dead transitions. [2022-11-25 18:06:57,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 126 transitions, 1270 flow [2022-11-25 18:06:57,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:06:57,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 18:06:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1035 transitions. [2022-11-25 18:06:57,658 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44458762886597936 [2022-11-25 18:06:57,658 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1035 transitions. [2022-11-25 18:06:57,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1035 transitions. [2022-11-25 18:06:57,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:57,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1035 transitions. [2022-11-25 18:06:57,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.375) internal successors, (1035), 8 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:57,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 291.0) internal successors, (2619), 9 states have internal predecessors, (2619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:57,667 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 291.0) internal successors, (2619), 9 states have internal predecessors, (2619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:57,667 INFO L175 Difference]: Start difference. First operand has 93 places, 57 transitions, 502 flow. Second operand 8 states and 1035 transitions. [2022-11-25 18:06:57,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 126 transitions, 1270 flow [2022-11-25 18:06:57,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 126 transitions, 856 flow, removed 64 selfloop flow, removed 26 redundant places. [2022-11-25 18:06:57,685 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 401 flow [2022-11-25 18:06:57,686 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=401, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2022-11-25 18:06:57,686 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2022-11-25 18:06:57,686 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 401 flow [2022-11-25 18:06:57,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 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-11-25 18:06:57,688 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:57,688 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:57,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 18:06:57,689 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:57,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:57,689 INFO L85 PathProgramCache]: Analyzing trace with hash -89567907, now seen corresponding path program 2 times [2022-11-25 18:06:57,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:57,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469592300] [2022-11-25 18:06:57,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:57,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:06:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:06:58,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:06:58,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469592300] [2022-11-25 18:06:58,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469592300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:06:58,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:06:58,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:06:58,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000471241] [2022-11-25 18:06:58,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:06:58,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:06:58,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:06:58,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:06:58,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:06:59,014 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 291 [2022-11-25 18:06:59,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 401 flow. Second operand has 8 states, 8 states have (on average 130.875) internal successors, (1047), 8 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:59,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:06:59,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 291 [2022-11-25 18:06:59,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:06:59,464 INFO L130 PetriNetUnfolder]: 409/717 cut-off events. [2022-11-25 18:06:59,465 INFO L131 PetriNetUnfolder]: For 2014/2041 co-relation queries the response was YES. [2022-11-25 18:06:59,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 717 events. 409/717 cut-off events. For 2014/2041 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2827 event pairs, 56 based on Foata normal form. 9/716 useless extension candidates. Maximal degree in co-relation 2754. Up to 472 conditions per place. [2022-11-25 18:06:59,470 INFO L137 encePairwiseOnDemand]: 285/291 looper letters, 55 selfloop transitions, 6 changer transitions 35/100 dead transitions. [2022-11-25 18:06:59,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 100 transitions, 747 flow [2022-11-25 18:06:59,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:06:59,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:06:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 943 transitions. [2022-11-25 18:06:59,474 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46293568973981347 [2022-11-25 18:06:59,474 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 943 transitions. [2022-11-25 18:06:59,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 943 transitions. [2022-11-25 18:06:59,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:06:59,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 943 transitions. [2022-11-25 18:06:59,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.71428571428572) internal successors, (943), 7 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:59,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:59,482 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:59,482 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 401 flow. Second operand 7 states and 943 transitions. [2022-11-25 18:06:59,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 100 transitions, 747 flow [2022-11-25 18:06:59,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 100 transitions, 729 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-25 18:06:59,489 INFO L231 Difference]: Finished difference. Result has 77 places, 51 transitions, 309 flow [2022-11-25 18:06:59,489 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=309, PETRI_PLACES=77, PETRI_TRANSITIONS=51} [2022-11-25 18:06:59,491 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2022-11-25 18:06:59,491 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 51 transitions, 309 flow [2022-11-25 18:06:59,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 130.875) internal successors, (1047), 8 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:06:59,492 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:06:59,493 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:59,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 18:06:59,493 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:06:59,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:06:59,494 INFO L85 PathProgramCache]: Analyzing trace with hash -716186319, now seen corresponding path program 3 times [2022-11-25 18:06:59,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:06:59,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244024197] [2022-11-25 18:06:59,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:06:59,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:06:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:06:59,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:06:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:06:59,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:06:59,689 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:06:59,691 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-25 18:06:59,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-25 18:06:59,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-25 18:06:59,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-25 18:06:59,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-25 18:06:59,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-25 18:06:59,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-25 18:06:59,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-25 18:06:59,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-25 18:06:59,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-25 18:06:59,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-25 18:06:59,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-25 18:06:59,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-25 18:06:59,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-25 18:06:59,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-25 18:06:59,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-25 18:06:59,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 18:06:59,704 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:06:59,711 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 18:06:59,711 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:06:59,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:06:59 BasicIcfg [2022-11-25 18:06:59,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:06:59,853 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:06:59,853 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:06:59,853 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:06:59,854 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:06:09" (3/4) ... [2022-11-25 18:06:59,858 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 18:06:59,858 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:06:59,859 INFO L158 Benchmark]: Toolchain (without parser) took 52440.49ms. Allocated memory was 188.7MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 144.6MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 599.9MB. Max. memory is 16.1GB. [2022-11-25 18:06:59,859 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 134.2MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:06:59,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 719.28ms. Allocated memory is still 188.7MB. Free memory was 143.7MB in the beginning and 116.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 18:06:59,860 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.86ms. Allocated memory is still 188.7MB. Free memory was 116.4MB in the beginning and 113.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:06:59,861 INFO L158 Benchmark]: Boogie Preprocessor took 66.49ms. Allocated memory is still 188.7MB. Free memory was 113.4MB in the beginning and 112.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:06:59,861 INFO L158 Benchmark]: RCFGBuilder took 898.16ms. Allocated memory is still 188.7MB. Free memory was 111.3MB in the beginning and 75.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-25 18:06:59,862 INFO L158 Benchmark]: TraceAbstraction took 50654.89ms. Allocated memory was 188.7MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 74.5MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 526.5MB. Max. memory is 16.1GB. [2022-11-25 18:06:59,862 INFO L158 Benchmark]: Witness Printer took 5.29ms. Allocated memory is still 4.5GB. Free memory was 3.9GB in the beginning and 3.9GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:06:59,865 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 134.2MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 719.28ms. Allocated memory is still 188.7MB. Free memory was 143.7MB in the beginning and 116.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.86ms. Allocated memory is still 188.7MB. Free memory was 116.4MB in the beginning and 113.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.49ms. Allocated memory is still 188.7MB. Free memory was 113.4MB in the beginning and 112.2MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 898.16ms. Allocated memory is still 188.7MB. Free memory was 111.3MB in the beginning and 75.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 50654.89ms. Allocated memory was 188.7MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 74.5MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 526.5MB. Max. memory is 16.1GB. * Witness Printer took 5.29ms. Allocated memory is still 4.5GB. Free memory was 3.9GB in the beginning and 3.9GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 156 PlacesBefore, 52 PlacesAfterwards, 145 TransitionsBefore, 40 TransitionsAfterwards, 3570 CoEnabledTransitionPairs, 7 FixpointIterations, 59 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 142 TotalNumberOfCompositions, 9787 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4936, independent: 4709, independent conditional: 0, independent unconditional: 4709, dependent: 227, dependent conditional: 0, dependent unconditional: 227, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2635, independent: 2559, independent conditional: 0, independent unconditional: 2559, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2635, independent: 2534, independent conditional: 0, independent unconditional: 2534, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 101, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 636, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 580, dependent conditional: 0, dependent unconditional: 580, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4936, independent: 2150, independent conditional: 0, independent unconditional: 2150, dependent: 151, dependent conditional: 0, dependent unconditional: 151, unknown: 2635, unknown conditional: 0, unknown unconditional: 2635] , Statistics on independence cache: Total cache size (in pairs): 385, Positive cache size: 353, Positive conditional cache size: 0, Positive unconditional cache size: 353, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p3_EAX = 0; [L719] 0 int __unbuffered_p3_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff0_thd4; [L733] 0 _Bool x$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd1; [L735] 0 _Bool x$r_buff1_thd2; [L736] 0 _Bool x$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd4; [L738] 0 _Bool x$read_delayed; [L739] 0 int *x$read_delayed_var; [L740] 0 int x$w_buff0; [L741] 0 _Bool x$w_buff0_used; [L742] 0 int x$w_buff1; [L743] 0 _Bool x$w_buff1_used; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L862] 0 pthread_t t685; [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t685, ((void *)0), P0, ((void *)0))=-2, t685={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t686; [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t686, ((void *)0), P1, ((void *)0))=-1, t685={5:0}, t686={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L866] 0 pthread_t t687; [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t687, ((void *)0), P2, ((void *)0))=0, t685={5:0}, t686={6:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L868] 0 pthread_t t688; [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t688, ((void *)0), P3, ((void *)0))=1, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 50.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 34.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1369 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1171 mSDsluCounter, 505 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 379 mSDsCounter, 188 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2934 IncrementalHoareTripleChecker+Invalid, 3122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 188 mSolverCounterUnsat, 126 mSDtfsCounter, 2934 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1162occurred in iteration=13, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 2940 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 18:06:59,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R --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 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:07:03,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:07:03,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:07:03,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:07:03,197 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:07:03,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:07:03,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:07:03,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:07:03,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:07:03,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:07:03,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:07:03,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:07:03,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:07:03,226 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:07:03,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:07:03,236 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:07:03,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:07:03,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:07:03,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:07:03,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:07:03,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:07:03,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:07:03,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:07:03,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:07:03,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:07:03,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:07:03,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:07:03,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:07:03,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:07:03,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:07:03,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:07:03,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:07:03,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:07:03,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:07:03,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:07:03,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:07:03,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:07:03,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:07:03,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:07:03,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:07:03,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:07:03,313 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 18:07:03,366 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:07:03,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:07:03,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:07:03,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:07:03,370 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:07:03,370 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:07:03,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:07:03,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:07:03,372 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:07:03,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:07:03,373 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:07:03,374 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:07:03,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:07:03,374 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:07:03,374 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:07:03,375 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:07:03,375 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:07:03,375 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:07:03,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:07:03,376 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:07:03,376 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 18:07:03,376 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 18:07:03,377 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:07:03,377 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:07:03,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:07:03,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:07:03,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:07:03,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:07:03,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:07:03,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:07:03,379 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 18:07:03,379 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 18:07:03,380 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:07:03,380 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:07:03,380 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:07:03,380 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 18:07:03,381 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_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 [2022-11-25 18:07:03,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:07:03,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:07:03,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:07:03,897 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:07:03,897 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:07:03,899 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2022-11-25 18:07:07,411 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:07:07,770 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:07:07,779 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2022-11-25 18:07:07,800 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/data/f6180ff52/30569f3a145a4a41bbd1e615ce86298f/FLAGb4e89d558 [2022-11-25 18:07:07,823 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/data/f6180ff52/30569f3a145a4a41bbd1e615ce86298f [2022-11-25 18:07:07,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:07:07,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:07:07,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:07:07,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:07:07,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:07:07,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:07:07" (1/1) ... [2022-11-25 18:07:07,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79bf370e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:07:07, skipping insertion in model container [2022-11-25 18:07:07,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:07:07" (1/1) ... [2022-11-25 18:07:07,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:07:07,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:07:08,174 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_55a1f0a1-5850-4449-b0ea-9125f477a624/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014] [2022-11-25 18:07:08,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:07:08,566 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:07:08,581 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_55a1f0a1-5850-4449-b0ea-9125f477a624/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014] [2022-11-25 18:07:08,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,622 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,624 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,625 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,627 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,628 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,629 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,630 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,631 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,634 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:07:08,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:07:08,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:07:08,697 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:07:08,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:07:08 WrapperNode [2022-11-25 18:07:08,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:07:08,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:07:08,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:07:08,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:07:08,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:07:08" (1/1) ... [2022-11-25 18:07:08,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:07:08" (1/1) ... [2022-11-25 18:07:08,775 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-11-25 18:07:08,776 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:07:08,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:07:08,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:07:08,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:07:08,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:07:08" (1/1) ... [2022-11-25 18:07:08,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:07:08" (1/1) ... [2022-11-25 18:07:08,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:07:08" (1/1) ... [2022-11-25 18:07:08,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:07:08" (1/1) ... [2022-11-25 18:07:08,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:07:08" (1/1) ... [2022-11-25 18:07:08,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:07:08" (1/1) ... [2022-11-25 18:07:08,806 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:07:08" (1/1) ... [2022-11-25 18:07:08,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:07:08" (1/1) ... [2022-11-25 18:07:08,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:07:08,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:07:08,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:07:08,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:07:08,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:07:08" (1/1) ... [2022-11-25 18:07:08,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:07:08,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:07:08,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:07:08,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:07:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:07:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:07:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:07:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:07:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 18:07:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 18:07:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 18:07:08,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 18:07:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 18:07:08,905 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 18:07:08,905 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 18:07:08,905 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 18:07:08,906 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 18:07:08,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 18:07:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:07:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:07:08,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:07:08,909 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:07:09,148 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:07:09,150 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:07:09,614 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:07:09,831 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:07:09,832 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:07:09,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:07:09 BoogieIcfgContainer [2022-11-25 18:07:09,835 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:07:09,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:07:09,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:07:09,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:07:09,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:07:07" (1/3) ... [2022-11-25 18:07:09,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2705e1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:07:09, skipping insertion in model container [2022-11-25 18:07:09,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:07:08" (2/3) ... [2022-11-25 18:07:09,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2705e1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:07:09, skipping insertion in model container [2022-11-25 18:07:09,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:07:09" (3/3) ... [2022-11-25 18:07:09,845 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2022-11-25 18:07:09,866 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:07:09,866 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 18:07:09,866 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:07:09,965 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:07:10,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 320 flow [2022-11-25 18:07:10,143 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-11-25 18:07:10,143 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:07:10,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-25 18:07:10,157 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 150 transitions, 320 flow [2022-11-25 18:07:10,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 146 transitions, 304 flow [2022-11-25 18:07:10,174 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:07:10,201 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 146 transitions, 304 flow [2022-11-25 18:07:10,211 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 146 transitions, 304 flow [2022-11-25 18:07:10,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 304 flow [2022-11-25 18:07:10,279 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-11-25 18:07:10,282 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:07:10,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-25 18:07:10,288 INFO L119 LiptonReduction]: Number of co-enabled transitions 3570 [2022-11-25 18:07:21,384 INFO L134 LiptonReduction]: Checked pairs total: 9757 [2022-11-25 18:07:21,385 INFO L136 LiptonReduction]: Total number of compositions: 145 [2022-11-25 18:07:21,413 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:07:21,420 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;@2cb6ff29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:07:21,420 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 18:07:21,422 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 18:07:21,423 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:07:21,423 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:07:21,423 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 18:07:21,424 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:07:21,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:21,429 INFO L85 PathProgramCache]: Analyzing trace with hash 621, now seen corresponding path program 1 times [2022-11-25 18:07:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:21,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629054514] [2022-11-25 18:07:21,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:21,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:21,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:21,449 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:07:21,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 18:07:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:21,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 18:07:21,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:07:21,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:21,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:07:21,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629054514] [2022-11-25 18:07:21,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629054514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:21,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:21,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 18:07:21,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254433878] [2022-11-25 18:07:21,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:21,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:07:21,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:07:21,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:07:21,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:07:21,614 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 295 [2022-11-25 18:07:21,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:21,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:07:21,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 295 [2022-11-25 18:07:21,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:07:23,538 INFO L130 PetriNetUnfolder]: 6949/9676 cut-off events. [2022-11-25 18:07:23,539 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-11-25 18:07:23,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19290 conditions, 9676 events. 6949/9676 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 51360 event pairs, 6949 based on Foata normal form. 0/8347 useless extension candidates. Maximal degree in co-relation 19278. Up to 9399 conditions per place. [2022-11-25 18:07:23,636 INFO L137 encePairwiseOnDemand]: 286/295 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2022-11-25 18:07:23,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2022-11-25 18:07:23,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:07:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 18:07:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 308 transitions. [2022-11-25 18:07:23,694 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5220338983050847 [2022-11-25 18:07:23,695 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 308 transitions. [2022-11-25 18:07:23,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 308 transitions. [2022-11-25 18:07:23,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:07:23,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 308 transitions. [2022-11-25 18:07:23,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:23,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:23,715 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 295.0) internal successors, (885), 3 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:23,717 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 308 transitions. [2022-11-25 18:07:23,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2022-11-25 18:07:23,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 18:07:23,752 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2022-11-25 18:07:23,755 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-11-25 18:07:23,761 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2022-11-25 18:07:23,761 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2022-11-25 18:07:23,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:23,762 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:07:23,762 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:07:23,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:23,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:23,963 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:07:23,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:23,963 INFO L85 PathProgramCache]: Analyzing trace with hash 586254036, now seen corresponding path program 1 times [2022-11-25 18:07:23,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:23,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468040623] [2022-11-25 18:07:23,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:23,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:23,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:23,966 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:07:23,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 18:07:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:24,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:07:24,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:07:24,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:24,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:07:24,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468040623] [2022-11-25 18:07:24,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468040623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:24,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:24,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:07:24,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637985631] [2022-11-25 18:07:24,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:24,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:07:24,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:07:24,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:07:24,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:07:24,158 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 295 [2022-11-25 18:07:24,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:24,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:07:24,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 295 [2022-11-25 18:07:24,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:07:25,632 INFO L130 PetriNetUnfolder]: 5463/7968 cut-off events. [2022-11-25 18:07:25,632 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:07:25,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15565 conditions, 7968 events. 5463/7968 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 46918 event pairs, 1005 based on Foata normal form. 0/7396 useless extension candidates. Maximal degree in co-relation 15562. Up to 5923 conditions per place. [2022-11-25 18:07:25,709 INFO L137 encePairwiseOnDemand]: 292/295 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2022-11-25 18:07:25,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 200 flow [2022-11-25 18:07:25,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:07:25,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:07:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2022-11-25 18:07:25,714 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5096045197740113 [2022-11-25 18:07:25,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2022-11-25 18:07:25,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2022-11-25 18:07:25,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:07:25,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2022-11-25 18:07:25,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:25,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:25,730 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:25,730 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 451 transitions. [2022-11-25 18:07:25,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 200 flow [2022-11-25 18:07:25,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 18:07:25,736 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2022-11-25 18:07:25,736 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-11-25 18:07:25,737 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2022-11-25 18:07:25,737 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2022-11-25 18:07:25,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:25,738 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:07:25,739 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:25,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:25,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:25,952 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:07:25,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:25,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1154696594, now seen corresponding path program 1 times [2022-11-25 18:07:25,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:25,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625211907] [2022-11-25 18:07:25,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:25,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:25,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:25,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:07:25,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 18:07:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:26,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:07:26,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:07:26,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:26,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:07:26,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625211907] [2022-11-25 18:07:26,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625211907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:26,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:26,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:07:26,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757872302] [2022-11-25 18:07:26,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:26,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:07:26,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:07:26,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:07:26,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:07:26,235 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2022-11-25 18:07:26,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:26,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:07:26,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2022-11-25 18:07:26,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:07:27,056 INFO L130 PetriNetUnfolder]: 3075/4453 cut-off events. [2022-11-25 18:07:27,057 INFO L131 PetriNetUnfolder]: For 287/287 co-relation queries the response was YES. [2022-11-25 18:07:27,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9292 conditions, 4453 events. 3075/4453 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 22720 event pairs, 693 based on Foata normal form. 81/4312 useless extension candidates. Maximal degree in co-relation 9288. Up to 3944 conditions per place. [2022-11-25 18:07:27,098 INFO L137 encePairwiseOnDemand]: 289/295 looper letters, 38 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2022-11-25 18:07:27,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 200 flow [2022-11-25 18:07:27,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:07:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:07:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2022-11-25 18:07:27,101 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4937853107344633 [2022-11-25 18:07:27,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2022-11-25 18:07:27,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2022-11-25 18:07:27,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:07:27,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2022-11-25 18:07:27,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:27,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:27,107 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:27,107 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 437 transitions. [2022-11-25 18:07:27,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 200 flow [2022-11-25 18:07:27,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:07:27,110 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 99 flow [2022-11-25 18:07:27,110 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2022-11-25 18:07:27,112 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2022-11-25 18:07:27,113 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 99 flow [2022-11-25 18:07:27,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:27,114 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:07:27,114 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:27,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:27,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:27,327 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:07:27,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:27,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1533878113, now seen corresponding path program 1 times [2022-11-25 18:07:27,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:27,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934654928] [2022-11-25 18:07:27,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:27,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:27,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:27,333 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:07:27,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 18:07:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:27,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:07:27,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:27,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:07:27,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:27,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:07:27,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934654928] [2022-11-25 18:07:27,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934654928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:27,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:27,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:07:27,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715486199] [2022-11-25 18:07:27,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:27,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:07:27,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:07:27,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:07:27,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:07:27,548 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2022-11-25 18:07:27,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:27,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:07:27,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2022-11-25 18:07:27,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:07:28,073 INFO L130 PetriNetUnfolder]: 1455/2293 cut-off events. [2022-11-25 18:07:28,074 INFO L131 PetriNetUnfolder]: For 269/269 co-relation queries the response was YES. [2022-11-25 18:07:28,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5497 conditions, 2293 events. 1455/2293 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11394 event pairs, 343 based on Foata normal form. 108/2312 useless extension candidates. Maximal degree in co-relation 5492. Up to 1244 conditions per place. [2022-11-25 18:07:28,088 INFO L137 encePairwiseOnDemand]: 289/295 looper letters, 50 selfloop transitions, 9 changer transitions 0/63 dead transitions. [2022-11-25 18:07:28,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 295 flow [2022-11-25 18:07:28,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:07:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:07:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 584 transitions. [2022-11-25 18:07:28,092 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49491525423728816 [2022-11-25 18:07:28,092 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 584 transitions. [2022-11-25 18:07:28,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 584 transitions. [2022-11-25 18:07:28,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:07:28,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 584 transitions. [2022-11-25 18:07:28,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:28,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:28,099 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:28,100 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 99 flow. Second operand 4 states and 584 transitions. [2022-11-25 18:07:28,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 295 flow [2022-11-25 18:07:28,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:07:28,107 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 146 flow [2022-11-25 18:07:28,107 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2022-11-25 18:07:28,109 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2022-11-25 18:07:28,110 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 146 flow [2022-11-25 18:07:28,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:28,111 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:07:28,111 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:28,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:28,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:28,324 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:07:28,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:28,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1775268704, now seen corresponding path program 1 times [2022-11-25 18:07:28,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:28,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656254560] [2022-11-25 18:07:28,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:28,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:28,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:28,328 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:07:28,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 18:07:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:28,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 18:07:28,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:28,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:07:28,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:28,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:07:28,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656254560] [2022-11-25 18:07:28,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656254560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:28,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:28,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:07:28,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267429446] [2022-11-25 18:07:28,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:28,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:07:28,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:07:28,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:07:28,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:07:28,555 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2022-11-25 18:07:28,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:28,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:07:28,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2022-11-25 18:07:28,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:07:28,995 INFO L130 PetriNetUnfolder]: 915/1483 cut-off events. [2022-11-25 18:07:28,995 INFO L131 PetriNetUnfolder]: For 942/942 co-relation queries the response was YES. [2022-11-25 18:07:28,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4020 conditions, 1483 events. 915/1483 cut-off events. For 942/942 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6981 event pairs, 277 based on Foata normal form. 54/1502 useless extension candidates. Maximal degree in co-relation 4014. Up to 540 conditions per place. [2022-11-25 18:07:29,004 INFO L137 encePairwiseOnDemand]: 289/295 looper letters, 60 selfloop transitions, 13 changer transitions 0/77 dead transitions. [2022-11-25 18:07:29,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 400 flow [2022-11-25 18:07:29,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:07:29,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:07:29,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 729 transitions. [2022-11-25 18:07:29,007 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4942372881355932 [2022-11-25 18:07:29,008 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 729 transitions. [2022-11-25 18:07:29,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 729 transitions. [2022-11-25 18:07:29,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:07:29,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 729 transitions. [2022-11-25 18:07:29,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:29,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:29,015 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:29,015 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 146 flow. Second operand 5 states and 729 transitions. [2022-11-25 18:07:29,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 400 flow [2022-11-25 18:07:29,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 77 transitions, 382 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-11-25 18:07:29,020 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 196 flow [2022-11-25 18:07:29,020 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2022-11-25 18:07:29,021 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places. [2022-11-25 18:07:29,021 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 196 flow [2022-11-25 18:07:29,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:29,022 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:07:29,022 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:29,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:29,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:29,234 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:07:29,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:29,235 INFO L85 PathProgramCache]: Analyzing trace with hash 485164251, now seen corresponding path program 1 times [2022-11-25 18:07:29,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:29,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138975819] [2022-11-25 18:07:29,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:29,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:29,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:29,237 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:07:29,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 18:07:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:29,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 18:07:29,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:07:29,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:29,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:07:29,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138975819] [2022-11-25 18:07:29,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138975819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:29,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:29,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:07:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555245758] [2022-11-25 18:07:29,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:29,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:07:29,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:07:29,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:07:29,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:07:29,476 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2022-11-25 18:07:29,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:29,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:07:29,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2022-11-25 18:07:29,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:07:30,027 INFO L130 PetriNetUnfolder]: 855/1363 cut-off events. [2022-11-25 18:07:30,027 INFO L131 PetriNetUnfolder]: For 1084/1084 co-relation queries the response was YES. [2022-11-25 18:07:30,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3834 conditions, 1363 events. 855/1363 cut-off events. For 1084/1084 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6387 event pairs, 272 based on Foata normal form. 12/1352 useless extension candidates. Maximal degree in co-relation 3827. Up to 540 conditions per place. [2022-11-25 18:07:30,036 INFO L137 encePairwiseOnDemand]: 289/295 looper letters, 56 selfloop transitions, 17 changer transitions 0/77 dead transitions. [2022-11-25 18:07:30,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 77 transitions, 426 flow [2022-11-25 18:07:30,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:07:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:07:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 860 transitions. [2022-11-25 18:07:30,040 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4858757062146893 [2022-11-25 18:07:30,040 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 860 transitions. [2022-11-25 18:07:30,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 860 transitions. [2022-11-25 18:07:30,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:07:30,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 860 transitions. [2022-11-25 18:07:30,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.33333333333334) internal successors, (860), 6 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:30,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:30,048 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:30,048 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 196 flow. Second operand 6 states and 860 transitions. [2022-11-25 18:07:30,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 77 transitions, 426 flow [2022-11-25 18:07:30,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 392 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-11-25 18:07:30,063 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 206 flow [2022-11-25 18:07:30,063 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2022-11-25 18:07:30,064 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2022-11-25 18:07:30,064 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 206 flow [2022-11-25 18:07:30,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:30,065 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:07:30,065 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:30,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-11-25 18:07:30,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:30,279 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:07:30,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:30,279 INFO L85 PathProgramCache]: Analyzing trace with hash 430742462, now seen corresponding path program 1 times [2022-11-25 18:07:30,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:30,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761309288] [2022-11-25 18:07:30,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:30,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:30,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:30,282 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:07:30,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 18:07:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:30,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:07:30,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:30,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:07:30,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:30,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:07:30,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761309288] [2022-11-25 18:07:30,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761309288] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:30,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:30,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:07:30,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167720777] [2022-11-25 18:07:30,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:30,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:07:30,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:07:30,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:07:30,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:07:30,576 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 295 [2022-11-25 18:07:30,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:30,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:07:30,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 295 [2022-11-25 18:07:30,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:07:31,125 INFO L130 PetriNetUnfolder]: 1263/1925 cut-off events. [2022-11-25 18:07:31,126 INFO L131 PetriNetUnfolder]: For 2059/2059 co-relation queries the response was YES. [2022-11-25 18:07:31,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5717 conditions, 1925 events. 1263/1925 cut-off events. For 2059/2059 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8940 event pairs, 333 based on Foata normal form. 0/1920 useless extension candidates. Maximal degree in co-relation 5709. Up to 1163 conditions per place. [2022-11-25 18:07:31,140 INFO L137 encePairwiseOnDemand]: 291/295 looper letters, 83 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2022-11-25 18:07:31,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 643 flow [2022-11-25 18:07:31,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:07:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:07:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 707 transitions. [2022-11-25 18:07:31,143 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4793220338983051 [2022-11-25 18:07:31,144 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 707 transitions. [2022-11-25 18:07:31,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 707 transitions. [2022-11-25 18:07:31,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:07:31,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 707 transitions. [2022-11-25 18:07:31,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.4) internal successors, (707), 5 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:31,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:31,150 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:31,150 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 206 flow. Second operand 5 states and 707 transitions. [2022-11-25 18:07:31,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 643 flow [2022-11-25 18:07:31,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 89 transitions, 530 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-11-25 18:07:31,171 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 177 flow [2022-11-25 18:07:31,171 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-11-25 18:07:31,172 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2022-11-25 18:07:31,172 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 177 flow [2022-11-25 18:07:31,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:31,173 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:07:31,173 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:31,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:31,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:31,388 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:07:31,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:31,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1557039738, now seen corresponding path program 1 times [2022-11-25 18:07:31,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:31,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116896297] [2022-11-25 18:07:31,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:07:31,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:31,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:31,401 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:07:31,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 18:07:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:31,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-25 18:07:31,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:07:32,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:32,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:07:32,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116896297] [2022-11-25 18:07:32,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116896297] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:32,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:32,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:07:32,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038069036] [2022-11-25 18:07:32,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:32,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:07:32,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:07:32,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:07:32,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:07:33,148 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 295 [2022-11-25 18:07:33,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:33,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:07:33,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 295 [2022-11-25 18:07:33,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:07:34,045 INFO L130 PetriNetUnfolder]: 1135/1795 cut-off events. [2022-11-25 18:07:34,045 INFO L131 PetriNetUnfolder]: For 1317/1317 co-relation queries the response was YES. [2022-11-25 18:07:34,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4946 conditions, 1795 events. 1135/1795 cut-off events. For 1317/1317 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8690 event pairs, 244 based on Foata normal form. 2/1773 useless extension candidates. Maximal degree in co-relation 4935. Up to 1471 conditions per place. [2022-11-25 18:07:34,058 INFO L137 encePairwiseOnDemand]: 290/295 looper letters, 43 selfloop transitions, 4 changer transitions 17/68 dead transitions. [2022-11-25 18:07:34,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 418 flow [2022-11-25 18:07:34,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:07:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:07:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 739 transitions. [2022-11-25 18:07:34,062 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4175141242937853 [2022-11-25 18:07:34,062 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 739 transitions. [2022-11-25 18:07:34,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 739 transitions. [2022-11-25 18:07:34,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:07:34,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 739 transitions. [2022-11-25 18:07:34,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:34,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:34,070 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 295.0) internal successors, (2065), 7 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:34,071 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 177 flow. Second operand 6 states and 739 transitions. [2022-11-25 18:07:34,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 418 flow [2022-11-25 18:07:34,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 414 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:07:34,085 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 170 flow [2022-11-25 18:07:34,085 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2022-11-25 18:07:34,086 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2022-11-25 18:07:34,086 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 170 flow [2022-11-25 18:07:34,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:34,087 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:07:34,087 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:34,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-11-25 18:07:34,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:34,309 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:07:34,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:34,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1629250850, now seen corresponding path program 2 times [2022-11-25 18:07:34,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:34,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739624000] [2022-11-25 18:07:34,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:07:34,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:34,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:34,316 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:07:34,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 18:07:34,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 18:07:34,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:07:34,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 18:07:34,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:07:34,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:34,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:07:34,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739624000] [2022-11-25 18:07:34,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739624000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:34,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:34,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:07:34,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287124872] [2022-11-25 18:07:34,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:34,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:07:34,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:07:34,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:07:34,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:07:34,831 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 295 [2022-11-25 18:07:34,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 170 flow. Second operand has 7 states, 7 states have (on average 131.42857142857142) internal successors, (920), 7 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:34,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:07:34,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 295 [2022-11-25 18:07:34,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:07:35,778 INFO L130 PetriNetUnfolder]: 1558/2596 cut-off events. [2022-11-25 18:07:35,779 INFO L131 PetriNetUnfolder]: For 1973/1973 co-relation queries the response was YES. [2022-11-25 18:07:35,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7532 conditions, 2596 events. 1558/2596 cut-off events. For 1973/1973 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14415 event pairs, 388 based on Foata normal form. 1/2575 useless extension candidates. Maximal degree in co-relation 7521. Up to 984 conditions per place. [2022-11-25 18:07:35,797 INFO L137 encePairwiseOnDemand]: 286/295 looper letters, 75 selfloop transitions, 8 changer transitions 52/139 dead transitions. [2022-11-25 18:07:35,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 139 transitions, 900 flow [2022-11-25 18:07:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:07:35,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 18:07:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1106 transitions. [2022-11-25 18:07:35,803 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46864406779661016 [2022-11-25 18:07:35,803 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1106 transitions. [2022-11-25 18:07:35,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1106 transitions. [2022-11-25 18:07:35,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:07:35,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1106 transitions. [2022-11-25 18:07:35,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 138.25) internal successors, (1106), 8 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:35,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 295.0) internal successors, (2655), 9 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:35,814 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 295.0) internal successors, (2655), 9 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:35,815 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 170 flow. Second operand 8 states and 1106 transitions. [2022-11-25 18:07:35,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 139 transitions, 900 flow [2022-11-25 18:07:35,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 139 transitions, 877 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-11-25 18:07:35,853 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 211 flow [2022-11-25 18:07:35,853 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=211, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2022-11-25 18:07:35,854 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2022-11-25 18:07:35,854 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 211 flow [2022-11-25 18:07:35,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.42857142857142) internal successors, (920), 7 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:35,855 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:07:35,855 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:35,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:36,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:36,068 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:07:36,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:36,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1384085936, now seen corresponding path program 3 times [2022-11-25 18:07:36,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:36,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428087581] [2022-11-25 18:07:36,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:07:36,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:36,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:36,071 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:07:36,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 18:07:36,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 18:07:36,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:07:36,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:07:36,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:07:36,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:36,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:07:36,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428087581] [2022-11-25 18:07:36,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428087581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:36,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:36,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:07:36,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240927029] [2022-11-25 18:07:36,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:36,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:07:36,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:07:36,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:07:36,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:07:36,362 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 295 [2022-11-25 18:07:36,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:36,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:07:36,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 295 [2022-11-25 18:07:36,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:07:36,971 INFO L130 PetriNetUnfolder]: 2119/3454 cut-off events. [2022-11-25 18:07:36,971 INFO L131 PetriNetUnfolder]: For 3525/3525 co-relation queries the response was YES. [2022-11-25 18:07:36,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11140 conditions, 3454 events. 2119/3454 cut-off events. For 3525/3525 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 19562 event pairs, 258 based on Foata normal form. 1/3429 useless extension candidates. Maximal degree in co-relation 11126. Up to 1482 conditions per place. [2022-11-25 18:07:36,989 INFO L137 encePairwiseOnDemand]: 291/295 looper letters, 60 selfloop transitions, 1 changer transitions 35/99 dead transitions. [2022-11-25 18:07:36,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 99 transitions, 668 flow [2022-11-25 18:07:36,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:07:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:07:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 703 transitions. [2022-11-25 18:07:36,993 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4766101694915254 [2022-11-25 18:07:36,993 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 703 transitions. [2022-11-25 18:07:36,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 703 transitions. [2022-11-25 18:07:36,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:07:36,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 703 transitions. [2022-11-25 18:07:36,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:37,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:37,001 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:37,001 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 211 flow. Second operand 5 states and 703 transitions. [2022-11-25 18:07:37,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 99 transitions, 668 flow [2022-11-25 18:07:37,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 99 transitions, 657 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-11-25 18:07:37,043 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 208 flow [2022-11-25 18:07:37,044 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2022-11-25 18:07:37,044 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2022-11-25 18:07:37,045 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 208 flow [2022-11-25 18:07:37,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:37,045 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:07:37,045 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:37,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:37,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:37,259 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:07:37,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:37,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1536937110, now seen corresponding path program 4 times [2022-11-25 18:07:37,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:37,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972308352] [2022-11-25 18:07:37,260 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 18:07:37,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:37,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:37,262 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:07:37,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 18:07:37,431 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 18:07:37,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:07:37,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 18:07:37,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:07:37,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:37,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:07:37,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972308352] [2022-11-25 18:07:37,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972308352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:37,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:37,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:07:37,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985907726] [2022-11-25 18:07:37,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:37,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:07:37,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:07:37,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:07:37,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:07:37,884 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 295 [2022-11-25 18:07:37,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 208 flow. Second operand has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:37,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:07:37,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 295 [2022-11-25 18:07:37,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:07:38,648 INFO L130 PetriNetUnfolder]: 1235/2059 cut-off events. [2022-11-25 18:07:38,648 INFO L131 PetriNetUnfolder]: For 2809/2895 co-relation queries the response was YES. [2022-11-25 18:07:38,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6882 conditions, 2059 events. 1235/2059 cut-off events. For 2809/2895 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11009 event pairs, 422 based on Foata normal form. 77/2107 useless extension candidates. Maximal degree in co-relation 6868. Up to 963 conditions per place. [2022-11-25 18:07:38,660 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 62 selfloop transitions, 8 changer transitions 38/112 dead transitions. [2022-11-25 18:07:38,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 112 transitions, 769 flow [2022-11-25 18:07:38,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:07:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 18:07:38,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1088 transitions. [2022-11-25 18:07:38,665 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4610169491525424 [2022-11-25 18:07:38,666 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1088 transitions. [2022-11-25 18:07:38,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1088 transitions. [2022-11-25 18:07:38,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:07:38,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1088 transitions. [2022-11-25 18:07:38,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:38,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 295.0) internal successors, (2655), 9 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:38,678 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 295.0) internal successors, (2655), 9 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:38,679 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 208 flow. Second operand 8 states and 1088 transitions. [2022-11-25 18:07:38,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 112 transitions, 769 flow [2022-11-25 18:07:38,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 112 transitions, 755 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-11-25 18:07:38,704 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 242 flow [2022-11-25 18:07:38,705 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=242, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2022-11-25 18:07:38,705 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2022-11-25 18:07:38,706 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 242 flow [2022-11-25 18:07:38,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:38,707 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:07:38,707 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:38,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:38,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:38,922 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:07:38,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:38,922 INFO L85 PathProgramCache]: Analyzing trace with hash 231524778, now seen corresponding path program 5 times [2022-11-25 18:07:38,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:38,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261025112] [2022-11-25 18:07:38,923 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 18:07:38,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:38,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:38,925 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:07:38,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 18:07:39,118 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 18:07:39,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:07:39,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:07:39,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:07:39,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:39,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:07:39,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261025112] [2022-11-25 18:07:39,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261025112] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:39,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:39,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:07:39,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038803595] [2022-11-25 18:07:39,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:39,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:07:39,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:07:39,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:07:39,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:07:39,192 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2022-11-25 18:07:39,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:39,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:07:39,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2022-11-25 18:07:39,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:07:39,776 INFO L130 PetriNetUnfolder]: 1600/2646 cut-off events. [2022-11-25 18:07:39,777 INFO L131 PetriNetUnfolder]: For 5124/5136 co-relation queries the response was YES. [2022-11-25 18:07:39,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9731 conditions, 2646 events. 1600/2646 cut-off events. For 5124/5136 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14230 event pairs, 583 based on Foata normal form. 5/2608 useless extension candidates. Maximal degree in co-relation 9715. Up to 1408 conditions per place. [2022-11-25 18:07:39,795 INFO L137 encePairwiseOnDemand]: 291/295 looper letters, 52 selfloop transitions, 2 changer transitions 25/82 dead transitions. [2022-11-25 18:07:39,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 82 transitions, 599 flow [2022-11-25 18:07:39,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:07:39,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:07:39,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2022-11-25 18:07:39,798 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47966101694915253 [2022-11-25 18:07:39,798 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2022-11-25 18:07:39,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2022-11-25 18:07:39,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:07:39,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2022-11-25 18:07:39,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:39,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:39,804 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:39,804 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 242 flow. Second operand 4 states and 566 transitions. [2022-11-25 18:07:39,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 82 transitions, 599 flow [2022-11-25 18:07:39,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 82 transitions, 567 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-11-25 18:07:39,832 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 234 flow [2022-11-25 18:07:39,833 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=59, 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=4, PETRI_FLOW=234, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2022-11-25 18:07:39,833 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2022-11-25 18:07:39,833 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 234 flow [2022-11-25 18:07:39,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:39,834 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:07:39,834 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:39,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:40,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:40,048 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:07:40,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:40,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1696470716, now seen corresponding path program 6 times [2022-11-25 18:07:40,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:40,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72565803] [2022-11-25 18:07:40,049 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 18:07:40,049 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:40,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:40,051 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:07:40,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-25 18:07:40,212 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-11-25 18:07:40,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:07:40,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 18:07:40,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:07:40,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:40,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:07:40,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [72565803] [2022-11-25 18:07:40,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [72565803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:40,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:40,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:07:40,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244943473] [2022-11-25 18:07:40,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:40,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 18:07:40,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:07:40,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 18:07:40,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:07:40,634 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 295 [2022-11-25 18:07:40,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 234 flow. Second operand has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:40,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:07:40,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 295 [2022-11-25 18:07:40,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:07:41,217 INFO L130 PetriNetUnfolder]: 824/1406 cut-off events. [2022-11-25 18:07:41,218 INFO L131 PetriNetUnfolder]: For 2038/2116 co-relation queries the response was YES. [2022-11-25 18:07:41,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5142 conditions, 1406 events. 824/1406 cut-off events. For 2038/2116 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6589 event pairs, 108 based on Foata normal form. 57/1453 useless extension candidates. Maximal degree in co-relation 5127. Up to 438 conditions per place. [2022-11-25 18:07:41,222 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 63 selfloop transitions, 8 changer transitions 41/116 dead transitions. [2022-11-25 18:07:41,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 116 transitions, 812 flow [2022-11-25 18:07:41,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:07:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 18:07:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1090 transitions. [2022-11-25 18:07:41,227 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.461864406779661 [2022-11-25 18:07:41,228 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1090 transitions. [2022-11-25 18:07:41,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1090 transitions. [2022-11-25 18:07:41,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:07:41,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1090 transitions. [2022-11-25 18:07:41,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 136.25) internal successors, (1090), 8 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-11-25 18:07:41,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 295.0) internal successors, (2655), 9 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:41,235 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 295.0) internal successors, (2655), 9 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:41,236 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 234 flow. Second operand 8 states and 1090 transitions. [2022-11-25 18:07:41,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 116 transitions, 812 flow [2022-11-25 18:07:41,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 116 transitions, 796 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 18:07:41,249 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 267 flow [2022-11-25 18:07:41,249 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=267, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2022-11-25 18:07:41,249 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2022-11-25 18:07:41,250 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 267 flow [2022-11-25 18:07:41,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:41,250 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:07:41,251 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:41,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:41,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:41,464 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:07:41,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:41,464 INFO L85 PathProgramCache]: Analyzing trace with hash -442105490, now seen corresponding path program 7 times [2022-11-25 18:07:41,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:41,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429003495] [2022-11-25 18:07:41,465 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 18:07:41,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:41,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:41,466 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:07:41,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-25 18:07:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:07:41,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 18:07:41,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:07:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:07:42,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:07:42,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:07:42,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429003495] [2022-11-25 18:07:42,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429003495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:07:42,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:07:42,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:07:42,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786089613] [2022-11-25 18:07:42,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:07:42,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:07:42,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:07:42,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:07:42,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:07:42,177 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 295 [2022-11-25 18:07:42,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 267 flow. Second operand has 9 states, 9 states have (on average 130.66666666666666) internal successors, (1176), 9 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:42,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:07:42,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 295 [2022-11-25 18:07:42,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:07:42,781 INFO L130 PetriNetUnfolder]: 716/1226 cut-off events. [2022-11-25 18:07:42,782 INFO L131 PetriNetUnfolder]: For 2832/2915 co-relation queries the response was YES. [2022-11-25 18:07:42,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4741 conditions, 1226 events. 716/1226 cut-off events. For 2832/2915 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5503 event pairs, 108 based on Foata normal form. 60/1276 useless extension candidates. Maximal degree in co-relation 4724. Up to 591 conditions per place. [2022-11-25 18:07:42,788 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 51 selfloop transitions, 7 changer transitions 32/94 dead transitions. [2022-11-25 18:07:42,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 94 transitions, 671 flow [2022-11-25 18:07:42,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:07:42,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 18:07:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1078 transitions. [2022-11-25 18:07:42,792 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45677966101694917 [2022-11-25 18:07:42,793 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1078 transitions. [2022-11-25 18:07:42,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1078 transitions. [2022-11-25 18:07:42,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:07:42,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1078 transitions. [2022-11-25 18:07:42,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.75) internal successors, (1078), 8 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:42,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 295.0) internal successors, (2655), 9 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:42,802 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 295.0) internal successors, (2655), 9 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:42,802 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 267 flow. Second operand 8 states and 1078 transitions. [2022-11-25 18:07:42,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 94 transitions, 671 flow [2022-11-25 18:07:42,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 94 transitions, 658 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-25 18:07:42,814 INFO L231 Difference]: Finished difference. Result has 74 places, 49 transitions, 281 flow [2022-11-25 18:07:42,814 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=281, PETRI_PLACES=74, PETRI_TRANSITIONS=49} [2022-11-25 18:07:42,815 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2022-11-25 18:07:42,815 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 49 transitions, 281 flow [2022-11-25 18:07:42,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 130.66666666666666) internal successors, (1176), 9 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:07:42,816 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:07:42,816 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:42,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-11-25 18:07:43,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:43,031 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 18:07:43,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:07:43,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1851824998, now seen corresponding path program 8 times [2022-11-25 18:07:43,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:07:43,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198653134] [2022-11-25 18:07:43,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:07:43,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:43,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:07:43,033 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:07:43,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-25 18:07:43,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 18:07:43,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 18:07:43,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:07:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:07:43,473 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 18:07:43,473 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:07:43,474 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-25 18:07:43,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-25 18:07:43,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-25 18:07:43,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-25 18:07:43,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-25 18:07:43,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-25 18:07:43,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-25 18:07:43,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-25 18:07:43,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-25 18:07:43,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-25 18:07:43,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-25 18:07:43,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-25 18:07:43,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-25 18:07:43,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-25 18:07:43,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-25 18:07:43,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-25 18:07:43,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-25 18:07:43,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:07:43,706 INFO L445 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:07:43,712 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 18:07:43,712 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:07:43,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:07:43 BasicIcfg [2022-11-25 18:07:43,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:07:43,806 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:07:43,806 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:07:43,806 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:07:43,807 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:07:09" (3/4) ... [2022-11-25 18:07:43,810 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 18:07:43,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:07:43,811 INFO L158 Benchmark]: Toolchain (without parser) took 35983.00ms. Allocated memory was 65.0MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 34.0MB in the beginning and 441.4MB in the end (delta: -407.4MB). Peak memory consumption was 631.4MB. Max. memory is 16.1GB. [2022-11-25 18:07:43,811 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 65.0MB. Free memory was 43.6MB in the beginning and 43.5MB in the end (delta: 44.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:07:43,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 867.87ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 33.7MB in the beginning and 45.5MB in the end (delta: -11.7MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2022-11-25 18:07:43,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.68ms. Allocated memory is still 88.1MB. Free memory was 45.5MB in the beginning and 66.2MB in the end (delta: -20.7MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2022-11-25 18:07:43,812 INFO L158 Benchmark]: Boogie Preprocessor took 36.07ms. Allocated memory is still 88.1MB. Free memory was 66.2MB in the beginning and 64.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:07:43,812 INFO L158 Benchmark]: RCFGBuilder took 1021.76ms. Allocated memory is still 88.1MB. Free memory was 64.1MB in the beginning and 46.3MB in the end (delta: 17.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 18:07:43,813 INFO L158 Benchmark]: TraceAbstraction took 33968.05ms. Allocated memory was 88.1MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 45.4MB in the beginning and 441.4MB in the end (delta: -396.0MB). Peak memory consumption was 619.8MB. Max. memory is 16.1GB. [2022-11-25 18:07:43,813 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 1.1GB. Free memory is still 441.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:07:43,815 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 65.0MB. Free memory was 43.6MB in the beginning and 43.5MB in the end (delta: 44.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 867.87ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 33.7MB in the beginning and 45.5MB in the end (delta: -11.7MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.68ms. Allocated memory is still 88.1MB. Free memory was 45.5MB in the beginning and 66.2MB in the end (delta: -20.7MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.07ms. Allocated memory is still 88.1MB. Free memory was 66.2MB in the beginning and 64.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1021.76ms. Allocated memory is still 88.1MB. Free memory was 64.1MB in the beginning and 46.3MB in the end (delta: 17.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 33968.05ms. Allocated memory was 88.1MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 45.4MB in the beginning and 441.4MB in the end (delta: -396.0MB). Peak memory consumption was 619.8MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 1.1GB. Free memory is still 441.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.2s, 157 PlacesBefore, 52 PlacesAfterwards, 146 TransitionsBefore, 40 TransitionsAfterwards, 3570 CoEnabledTransitionPairs, 7 FixpointIterations, 60 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 145 TotalNumberOfCompositions, 9757 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5180, independent: 4961, independent conditional: 0, independent unconditional: 4961, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2538, independent: 2475, independent conditional: 0, independent unconditional: 2475, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2538, independent: 2451, independent conditional: 0, independent unconditional: 2451, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 502, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 450, dependent conditional: 0, dependent unconditional: 450, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5180, independent: 2486, independent conditional: 0, independent unconditional: 2486, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 2538, unknown conditional: 0, unknown unconditional: 2538] , Statistics on independence cache: Total cache size (in pairs): 331, Positive cache size: 303, Positive conditional cache size: 0, Positive unconditional cache size: 303, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p3_EAX = 0; [L719] 0 int __unbuffered_p3_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff0_thd4; [L733] 0 _Bool x$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd1; [L735] 0 _Bool x$r_buff1_thd2; [L736] 0 _Bool x$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd4; [L738] 0 _Bool x$read_delayed; [L739] 0 int *x$read_delayed_var; [L740] 0 int x$w_buff0; [L741] 0 _Bool x$w_buff0_used; [L742] 0 int x$w_buff1; [L743] 0 _Bool x$w_buff1_used; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L862] 0 pthread_t t685; [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t685, ((void *)0), P0, ((void *)0))=0, t685={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t686; [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t686, ((void *)0), P1, ((void *)0))=1, t685={11:0}, t686={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L866] 0 pthread_t t687; [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t687, ((void *)0), P2, ((void *)0))=2, t685={11:0}, t686={15:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L868] 0 pthread_t t688; [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t688, ((void *)0), P3, ((void *)0))=3, t685={11:0}, t686={15:0}, t687={7:0}, t688={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={11:0}, t686={15:0}, t687={7:0}, t688={-2147483637:0}, weak$$choice0=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 186 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 33.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 720 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 588 mSDsluCounter, 488 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 474 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2853 IncrementalHoareTripleChecker+Invalid, 2972 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 14 mSDtfsCounter, 2853 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=14, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 285 ConstructedInterpolants, 20 QuantifiedInterpolants, 2810 SizeOfPredicates, 25 NumberOfNonLiveVariables, 2310 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 18:07:43,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55a1f0a1-5850-4449-b0ea-9125f477a624/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample