./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 11:25:00,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:25:00,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:25:00,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:25:00,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:25:00,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:25:00,412 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:25:00,413 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:25:00,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:25:00,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:25:00,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:25:00,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:25:00,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:25:00,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:25:00,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:25:00,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:25:00,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:25:00,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:25:00,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:25:00,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:25:00,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:25:00,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:25:00,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:25:00,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:25:00,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:25:00,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:25:00,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:25:00,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:25:00,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:25:00,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:25:00,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:25:00,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:25:00,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:25:00,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:25:00,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:25:00,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:25:00,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:25:00,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:25:00,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:25:00,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:25:00,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:25:00,439 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 11:25:00,454 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:25:00,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:25:00,454 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 11:25:00,454 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 11:25:00,455 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 11:25:00,455 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 11:25:00,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:25:00,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:25:00,455 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:25:00,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:25:00,456 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:25:00,456 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 11:25:00,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:25:00,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:25:00,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:25:00,456 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 11:25:00,456 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 11:25:00,456 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 11:25:00,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:25:00,457 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 11:25:00,457 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:25:00,457 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:25:00,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:25:00,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:25:00,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:25:00,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:25:00,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:25:00,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:25:00,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:25:00,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:25:00,458 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 11:25:00,458 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 11:25:00,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 11:25:00,458 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 11:25:00,458 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_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 [2022-12-13 11:25:00,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:25:00,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:25:00,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:25:00,650 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:25:00,650 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:25:00,651 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2022-12-13 11:25:03,225 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:25:03,429 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:25:03,430 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2022-12-13 11:25:03,441 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/data/0524788d9/478d71ee276d430291602367d38911af/FLAG9a8245801 [2022-12-13 11:25:03,797 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/data/0524788d9/478d71ee276d430291602367d38911af [2022-12-13 11:25:03,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:25:03,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 11:25:03,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:25:03,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:25:03,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:25:03,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:25:03" (1/1) ... [2022-12-13 11:25:03,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29cdc738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:03, skipping insertion in model container [2022-12-13 11:25:03,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:25:03" (1/1) ... [2022-12-13 11:25:03,818 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:25:03,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:25:03,960 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_800329d3-1da8-41b2-bf23-04ab5ebd1b51/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i[949,962] [2022-12-13 11:25:04,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:25:04,135 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:25:04,146 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_800329d3-1da8-41b2-bf23-04ab5ebd1b51/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i[949,962] [2022-12-13 11:25:04,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:04,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:04,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:25:04,218 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:25:04,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:04 WrapperNode [2022-12-13 11:25:04,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:25:04,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:25:04,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:25:04,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:25:04,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:04" (1/1) ... [2022-12-13 11:25:04,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:04" (1/1) ... [2022-12-13 11:25:04,256 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2022-12-13 11:25:04,256 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:25:04,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:25:04,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:25:04,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:25:04,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:04" (1/1) ... [2022-12-13 11:25:04,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:04" (1/1) ... [2022-12-13 11:25:04,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:04" (1/1) ... [2022-12-13 11:25:04,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:04" (1/1) ... [2022-12-13 11:25:04,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:04" (1/1) ... [2022-12-13 11:25:04,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:04" (1/1) ... [2022-12-13 11:25:04,288 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:04" (1/1) ... [2022-12-13 11:25:04,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:04" (1/1) ... [2022-12-13 11:25:04,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:25:04,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:25:04,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:25:04,298 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:25:04,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:04" (1/1) ... [2022-12-13 11:25:04,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:25:04,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:25:04,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:25:04,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:25:04,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:25:04,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:25:04,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:25:04,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:25:04,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:25:04,356 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:25:04,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:25:04,356 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:25:04,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:25:04,357 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:25:04,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:25:04,357 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 11:25:04,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 11:25:04,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:25:04,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:25:04,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:25:04,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:25:04,358 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 11:25:04,457 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 11:25:04,458 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:25:04,723 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 11:25:04,796 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:25:04,796 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:25:04,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:25:04 BoogieIcfgContainer [2022-12-13 11:25:04,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:25:04,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:25:04,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:25:04,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:25:04,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:25:03" (1/3) ... [2022-12-13 11:25:04,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2aba89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:25:04, skipping insertion in model container [2022-12-13 11:25:04,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:04" (2/3) ... [2022-12-13 11:25:04,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2aba89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:25:04, skipping insertion in model container [2022-12-13 11:25:04,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:25:04" (3/3) ... [2022-12-13 11:25:04,804 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2022-12-13 11:25:04,817 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:25:04,817 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 11:25:04,817 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:25:04,860 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:25:04,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 151 transitions, 322 flow [2022-12-13 11:25:04,932 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-12-13 11:25:04,932 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:25:04,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 11:25:04,936 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 151 transitions, 322 flow [2022-12-13 11:25:04,940 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 147 transitions, 306 flow [2022-12-13 11:25:04,942 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 11:25:04,949 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 147 transitions, 306 flow [2022-12-13 11:25:04,951 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 147 transitions, 306 flow [2022-12-13 11:25:04,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 306 flow [2022-12-13 11:25:04,975 INFO L130 PetriNetUnfolder]: 2/147 cut-off events. [2022-12-13 11:25:04,975 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:25:04,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 2/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 11:25:04,977 INFO L119 LiptonReduction]: Number of co-enabled transitions 3866 [2022-12-13 11:25:10,516 INFO L134 LiptonReduction]: Checked pairs total: 10689 [2022-12-13 11:25:10,517 INFO L136 LiptonReduction]: Total number of compositions: 148 [2022-12-13 11:25:10,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:25:10,537 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;@1d4be9c7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:25:10,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 11:25:10,538 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 11:25:10,538 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:25:10,538 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:10,539 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 11:25:10,539 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 11:25:10,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash 638, now seen corresponding path program 1 times [2022-12-13 11:25:10,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:10,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848258730] [2022-12-13 11:25:10,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:10,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:10,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:10,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848258730] [2022-12-13 11:25:10,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848258730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:10,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:10,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 11:25:10,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189999107] [2022-12-13 11:25:10,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:10,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 11:25:10,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:10,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 11:25:10,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 11:25:10,662 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 299 [2022-12-13 11:25:10,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 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-12-13 11:25:10,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:10,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 299 [2022-12-13 11:25:10,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:11,806 INFO L130 PetriNetUnfolder]: 5973/8362 cut-off events. [2022-12-13 11:25:11,807 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-13 11:25:11,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16680 conditions, 8362 events. 5973/8362 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 44982 event pairs, 5973 based on Foata normal form. 0/6973 useless extension candidates. Maximal degree in co-relation 16668. Up to 8103 conditions per place. [2022-12-13 11:25:11,851 INFO L137 encePairwiseOnDemand]: 291/299 looper letters, 26 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2022-12-13 11:25:11,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 126 flow [2022-12-13 11:25:11,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 11:25:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 11:25:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 306 transitions. [2022-12-13 11:25:11,864 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5117056856187291 [2022-12-13 11:25:11,865 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 306 transitions. [2022-12-13 11:25:11,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 306 transitions. [2022-12-13 11:25:11,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:11,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 306 transitions. [2022-12-13 11:25:11,872 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-12-13 11:25:11,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:11,877 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:11,879 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 2 states and 306 transitions. [2022-12-13 11:25:11,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 126 flow [2022-12-13 11:25:11,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:25:11,887 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2022-12-13 11:25:11,889 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, 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-12-13 11:25:11,893 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2022-12-13 11:25:11,893 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2022-12-13 11:25:11,893 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-12-13 11:25:11,893 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:11,894 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 11:25:11,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:25:11,894 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 11:25:11,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:11,895 INFO L85 PathProgramCache]: Analyzing trace with hash 601542893, now seen corresponding path program 1 times [2022-12-13 11:25:11,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:11,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881148074] [2022-12-13 11:25:11,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:11,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:12,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:12,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881148074] [2022-12-13 11:25:12,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881148074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:12,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:12,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:25:12,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280847504] [2022-12-13 11:25:12,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:12,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:25:12,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:12,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:25:12,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:25:12,128 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 299 [2022-12-13 11:25:12,128 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-12-13 11:25:12,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:12,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 299 [2022-12-13 11:25:12,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:12,964 INFO L130 PetriNetUnfolder]: 4695/6877 cut-off events. [2022-12-13 11:25:12,964 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:25:12,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13450 conditions, 6877 events. 4695/6877 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 41007 event pairs, 861 based on Foata normal form. 0/6280 useless extension candidates. Maximal degree in co-relation 13447. Up to 5107 conditions per place. [2022-12-13 11:25:12,987 INFO L137 encePairwiseOnDemand]: 296/299 looper letters, 39 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2022-12-13 11:25:12,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 194 flow [2022-12-13 11:25:12,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:25:12,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:25:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2022-12-13 11:25:12,989 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5005574136008919 [2022-12-13 11:25:12,989 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2022-12-13 11:25:12,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2022-12-13 11:25:12,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:12,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2022-12-13 11:25:12,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:12,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:12,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:12,993 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 449 transitions. [2022-12-13 11:25:12,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 194 flow [2022-12-13 11:25:12,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:25:12,994 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2022-12-13 11:25:12,994 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, 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-12-13 11:25:12,994 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2022-12-13 11:25:12,994 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2022-12-13 11:25:12,995 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-12-13 11:25:12,995 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:12,995 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:25:12,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:25:12,995 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-12-13 11:25:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash -16526753, now seen corresponding path program 1 times [2022-12-13 11:25:12,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:12,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323819541] [2022-12-13 11:25:12,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:12,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:13,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:13,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323819541] [2022-12-13 11:25:13,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323819541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:13,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:13,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:25:13,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494202974] [2022-12-13 11:25:13,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:13,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:25:13,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:13,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:25:13,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:25:13,627 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 299 [2022-12-13 11:25:13,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:13,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:13,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 299 [2022-12-13 11:25:13,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:15,529 INFO L130 PetriNetUnfolder]: 15448/20802 cut-off events. [2022-12-13 11:25:15,529 INFO L131 PetriNetUnfolder]: For 981/981 co-relation queries the response was YES. [2022-12-13 11:25:15,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42952 conditions, 20802 events. 15448/20802 cut-off events. For 981/981 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 108831 event pairs, 2260 based on Foata normal form. 0/20112 useless extension candidates. Maximal degree in co-relation 42948. Up to 16413 conditions per place. [2022-12-13 11:25:15,612 INFO L137 encePairwiseOnDemand]: 284/299 looper letters, 61 selfloop transitions, 15 changer transitions 0/76 dead transitions. [2022-12-13 11:25:15,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 76 transitions, 332 flow [2022-12-13 11:25:15,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:25:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:25:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2022-12-13 11:25:15,615 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47324414715719065 [2022-12-13 11:25:15,616 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2022-12-13 11:25:15,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2022-12-13 11:25:15,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:15,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2022-12-13 11:25:15,618 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-12-13 11:25:15,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:15,623 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:15,623 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 4 states and 566 transitions. [2022-12-13 11:25:15,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 76 transitions, 332 flow [2022-12-13 11:25:15,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 76 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:25:15,626 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 184 flow [2022-12-13 11:25:15,627 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2022-12-13 11:25:15,627 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2022-12-13 11:25:15,627 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 184 flow [2022-12-13 11:25:15,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:15,628 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:15,628 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:25:15,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:25:15,628 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-12-13 11:25:15,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:15,629 INFO L85 PathProgramCache]: Analyzing trace with hash -16526737, now seen corresponding path program 1 times [2022-12-13 11:25:15,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:15,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854102323] [2022-12-13 11:25:15,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:15,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:16,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:16,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854102323] [2022-12-13 11:25:16,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854102323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:16,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:16,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:25:16,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613099321] [2022-12-13 11:25:16,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:16,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:25:16,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:16,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:25:16,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:25:16,254 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 299 [2022-12-13 11:25:16,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:16,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:16,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 299 [2022-12-13 11:25:16,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:17,727 INFO L130 PetriNetUnfolder]: 10652/14987 cut-off events. [2022-12-13 11:25:17,727 INFO L131 PetriNetUnfolder]: For 7633/8076 co-relation queries the response was YES. [2022-12-13 11:25:17,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42277 conditions, 14987 events. 10652/14987 cut-off events. For 7633/8076 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 81500 event pairs, 1452 based on Foata normal form. 679/15421 useless extension candidates. Maximal degree in co-relation 42271. Up to 9425 conditions per place. [2022-12-13 11:25:17,780 INFO L137 encePairwiseOnDemand]: 292/299 looper letters, 72 selfloop transitions, 6 changer transitions 0/86 dead transitions. [2022-12-13 11:25:17,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 86 transitions, 510 flow [2022-12-13 11:25:17,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:25:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:25:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2022-12-13 11:25:17,783 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42920847268673357 [2022-12-13 11:25:17,783 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 770 transitions. [2022-12-13 11:25:17,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 770 transitions. [2022-12-13 11:25:17,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:17,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 770 transitions. [2022-12-13 11:25:17,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:17,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:17,787 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:17,787 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 184 flow. Second operand 6 states and 770 transitions. [2022-12-13 11:25:17,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 86 transitions, 510 flow [2022-12-13 11:25:17,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 86 transitions, 510 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:25:17,790 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 205 flow [2022-12-13 11:25:17,790 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2022-12-13 11:25:17,790 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2022-12-13 11:25:17,790 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 205 flow [2022-12-13 11:25:17,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:17,791 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:17,791 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:25:17,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:25:17,791 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-12-13 11:25:17,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:17,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1295851925, now seen corresponding path program 1 times [2022-12-13 11:25:17,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:17,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964709998] [2022-12-13 11:25:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:17,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:18,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:18,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964709998] [2022-12-13 11:25:18,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964709998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:18,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:18,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:25:18,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150445199] [2022-12-13 11:25:18,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:18,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:25:18,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:18,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:25:18,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:25:18,294 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 299 [2022-12-13 11:25:18,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:18,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:18,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 299 [2022-12-13 11:25:18,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:19,666 INFO L130 PetriNetUnfolder]: 8093/11453 cut-off events. [2022-12-13 11:25:19,666 INFO L131 PetriNetUnfolder]: For 9897/10304 co-relation queries the response was YES. [2022-12-13 11:25:19,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33233 conditions, 11453 events. 8093/11453 cut-off events. For 9897/10304 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 61737 event pairs, 2444 based on Foata normal form. 734/11854 useless extension candidates. Maximal degree in co-relation 33225. Up to 9166 conditions per place. [2022-12-13 11:25:19,716 INFO L137 encePairwiseOnDemand]: 294/299 looper letters, 53 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2022-12-13 11:25:19,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 67 transitions, 407 flow [2022-12-13 11:25:19,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:25:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:25:19,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 744 transitions. [2022-12-13 11:25:19,719 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41471571906354515 [2022-12-13 11:25:19,719 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 744 transitions. [2022-12-13 11:25:19,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 744 transitions. [2022-12-13 11:25:19,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:19,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 744 transitions. [2022-12-13 11:25:19,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:19,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:19,723 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:19,723 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 205 flow. Second operand 6 states and 744 transitions. [2022-12-13 11:25:19,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 67 transitions, 407 flow [2022-12-13 11:25:19,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 67 transitions, 395 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-13 11:25:19,727 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 187 flow [2022-12-13 11:25:19,727 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2022-12-13 11:25:19,728 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2022-12-13 11:25:19,728 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 187 flow [2022-12-13 11:25:19,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:19,728 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:19,728 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:25:19,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:25:19,729 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-12-13 11:25:19,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2143489128, now seen corresponding path program 1 times [2022-12-13 11:25:19,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:19,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377877909] [2022-12-13 11:25:19,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:19,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:20,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:20,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377877909] [2022-12-13 11:25:20,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377877909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:20,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:20,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:25:20,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888513667] [2022-12-13 11:25:20,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:20,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:25:20,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:20,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:25:20,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:25:20,047 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 299 [2022-12-13 11:25:20,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:20,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:20,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 299 [2022-12-13 11:25:20,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:21,157 INFO L130 PetriNetUnfolder]: 8913/12491 cut-off events. [2022-12-13 11:25:21,157 INFO L131 PetriNetUnfolder]: For 7508/7646 co-relation queries the response was YES. [2022-12-13 11:25:21,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36082 conditions, 12491 events. 8913/12491 cut-off events. For 7508/7646 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 68751 event pairs, 1899 based on Foata normal form. 160/11756 useless extension candidates. Maximal degree in co-relation 36074. Up to 9616 conditions per place. [2022-12-13 11:25:21,199 INFO L137 encePairwiseOnDemand]: 292/299 looper letters, 58 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2022-12-13 11:25:21,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 76 transitions, 455 flow [2022-12-13 11:25:21,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:25:21,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:25:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 593 transitions. [2022-12-13 11:25:21,201 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49581939799331104 [2022-12-13 11:25:21,201 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 593 transitions. [2022-12-13 11:25:21,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 593 transitions. [2022-12-13 11:25:21,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:21,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 593 transitions. [2022-12-13 11:25:21,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:21,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:21,204 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:21,204 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 187 flow. Second operand 4 states and 593 transitions. [2022-12-13 11:25:21,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 76 transitions, 455 flow [2022-12-13 11:25:21,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 440 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:25:21,208 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 258 flow [2022-12-13 11:25:21,208 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2022-12-13 11:25:21,208 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2022-12-13 11:25:21,208 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 258 flow [2022-12-13 11:25:21,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:21,209 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:21,209 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:25:21,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:25:21,209 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-12-13 11:25:21,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:21,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1937562332, now seen corresponding path program 1 times [2022-12-13 11:25:21,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:21,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787365569] [2022-12-13 11:25:21,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:21,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:21,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-12-13 11:25:21,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:21,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787365569] [2022-12-13 11:25:21,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787365569] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:21,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:21,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:25:21,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265913882] [2022-12-13 11:25:21,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:21,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:25:21,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:21,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:25:21,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:25:21,348 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 299 [2022-12-13 11:25:21,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:21,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:21,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 299 [2022-12-13 11:25:21,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:22,487 INFO L130 PetriNetUnfolder]: 8798/12416 cut-off events. [2022-12-13 11:25:22,487 INFO L131 PetriNetUnfolder]: For 13662/13935 co-relation queries the response was YES. [2022-12-13 11:25:22,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40424 conditions, 12416 events. 8798/12416 cut-off events. For 13662/13935 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 69423 event pairs, 1444 based on Foata normal form. 162/11882 useless extension candidates. Maximal degree in co-relation 40415. Up to 8651 conditions per place. [2022-12-13 11:25:22,538 INFO L137 encePairwiseOnDemand]: 291/299 looper letters, 67 selfloop transitions, 15 changer transitions 0/90 dead transitions. [2022-12-13 11:25:22,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 90 transitions, 608 flow [2022-12-13 11:25:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:25:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:25:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 594 transitions. [2022-12-13 11:25:22,540 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49665551839464883 [2022-12-13 11:25:22,540 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 594 transitions. [2022-12-13 11:25:22,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 594 transitions. [2022-12-13 11:25:22,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:22,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 594 transitions. [2022-12-13 11:25:22,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:22,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:22,543 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:22,543 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 258 flow. Second operand 4 states and 594 transitions. [2022-12-13 11:25:22,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 90 transitions, 608 flow [2022-12-13 11:25:22,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 90 transitions, 594 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 11:25:22,547 INFO L231 Difference]: Finished difference. Result has 52 places, 58 transitions, 361 flow [2022-12-13 11:25:22,547 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=361, PETRI_PLACES=52, PETRI_TRANSITIONS=58} [2022-12-13 11:25:22,548 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2022-12-13 11:25:22,548 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 58 transitions, 361 flow [2022-12-13 11:25:22,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:22,548 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:22,548 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:25:22,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:25:22,549 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-12-13 11:25:22,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:22,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1846228892, now seen corresponding path program 2 times [2022-12-13 11:25:22,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:22,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534313188] [2022-12-13 11:25:22,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:22,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:22,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:22,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534313188] [2022-12-13 11:25:22,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534313188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:22,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:22,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:25:22,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248393271] [2022-12-13 11:25:22,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:22,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:25:22,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:22,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:25:22,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:25:22,801 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 299 [2022-12-13 11:25:22,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 58 transitions, 361 flow. Second operand has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:22,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:22,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 299 [2022-12-13 11:25:22,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:24,180 INFO L130 PetriNetUnfolder]: 8638/12188 cut-off events. [2022-12-13 11:25:24,180 INFO L131 PetriNetUnfolder]: For 22289/22574 co-relation queries the response was YES. [2022-12-13 11:25:24,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43865 conditions, 12188 events. 8638/12188 cut-off events. For 22289/22574 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 67475 event pairs, 1477 based on Foata normal form. 220/11718 useless extension candidates. Maximal degree in co-relation 43855. Up to 8625 conditions per place. [2022-12-13 11:25:24,237 INFO L137 encePairwiseOnDemand]: 291/299 looper letters, 66 selfloop transitions, 15 changer transitions 0/89 dead transitions. [2022-12-13 11:25:24,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 657 flow [2022-12-13 11:25:24,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:25:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:25:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 589 transitions. [2022-12-13 11:25:24,240 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49247491638795987 [2022-12-13 11:25:24,240 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 589 transitions. [2022-12-13 11:25:24,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 589 transitions. [2022-12-13 11:25:24,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:24,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 589 transitions. [2022-12-13 11:25:24,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.25) internal successors, (589), 4 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:24,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:24,243 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:24,243 INFO L175 Difference]: Start difference. First operand has 52 places, 58 transitions, 361 flow. Second operand 4 states and 589 transitions. [2022-12-13 11:25:24,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 657 flow [2022-12-13 11:25:24,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 89 transitions, 643 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 11:25:24,262 INFO L231 Difference]: Finished difference. Result has 55 places, 58 transitions, 392 flow [2022-12-13 11:25:24,262 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=392, PETRI_PLACES=55, PETRI_TRANSITIONS=58} [2022-12-13 11:25:24,263 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2022-12-13 11:25:24,263 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 58 transitions, 392 flow [2022-12-13 11:25:24,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:24,263 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:24,263 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:25:24,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:25:24,263 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-12-13 11:25:24,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:24,264 INFO L85 PathProgramCache]: Analyzing trace with hash 14377203, now seen corresponding path program 1 times [2022-12-13 11:25:24,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:24,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235186813] [2022-12-13 11:25:24,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:24,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:24,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:24,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235186813] [2022-12-13 11:25:24,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235186813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:24,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:24,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:25:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492048688] [2022-12-13 11:25:24,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:24,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:25:24,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:24,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:25:24,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:25:24,679 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 299 [2022-12-13 11:25:24,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 58 transitions, 392 flow. Second operand has 7 states, 7 states have (on average 134.28571428571428) internal successors, (940), 7 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:24,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:24,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 299 [2022-12-13 11:25:24,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:26,163 INFO L130 PetriNetUnfolder]: 10700/14961 cut-off events. [2022-12-13 11:25:26,163 INFO L131 PetriNetUnfolder]: For 32923/33545 co-relation queries the response was YES. [2022-12-13 11:25:26,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54816 conditions, 14961 events. 10700/14961 cut-off events. For 32923/33545 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 84597 event pairs, 1709 based on Foata normal form. 346/14366 useless extension candidates. Maximal degree in co-relation 54805. Up to 9784 conditions per place. [2022-12-13 11:25:26,233 INFO L137 encePairwiseOnDemand]: 290/299 looper letters, 83 selfloop transitions, 29 changer transitions 0/120 dead transitions. [2022-12-13 11:25:26,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 120 transitions, 936 flow [2022-12-13 11:25:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:25:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:25:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 733 transitions. [2022-12-13 11:25:26,235 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4903010033444816 [2022-12-13 11:25:26,235 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 733 transitions. [2022-12-13 11:25:26,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 733 transitions. [2022-12-13 11:25:26,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:26,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 733 transitions. [2022-12-13 11:25:26,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:26,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:26,240 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:26,240 INFO L175 Difference]: Start difference. First operand has 55 places, 58 transitions, 392 flow. Second operand 5 states and 733 transitions. [2022-12-13 11:25:26,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 120 transitions, 936 flow [2022-12-13 11:25:26,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 120 transitions, 902 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:25:26,256 INFO L231 Difference]: Finished difference. Result has 58 places, 74 transitions, 607 flow [2022-12-13 11:25:26,256 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=607, PETRI_PLACES=58, PETRI_TRANSITIONS=74} [2022-12-13 11:25:26,257 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2022-12-13 11:25:26,257 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 74 transitions, 607 flow [2022-12-13 11:25:26,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 134.28571428571428) internal successors, (940), 7 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:26,257 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:26,258 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:25:26,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:25:26,258 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-12-13 11:25:26,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:26,258 INFO L85 PathProgramCache]: Analyzing trace with hash -189032291, now seen corresponding path program 1 times [2022-12-13 11:25:26,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:26,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015006809] [2022-12-13 11:25:26,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:26,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:26,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:26,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:26,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015006809] [2022-12-13 11:25:26,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015006809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:26,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:26,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:25:26,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703203770] [2022-12-13 11:25:26,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:26,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:25:26,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:26,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:25:26,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:25:26,541 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 299 [2022-12-13 11:25:26,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 74 transitions, 607 flow. Second operand has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:26,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:26,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 299 [2022-12-13 11:25:26,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:28,212 INFO L130 PetriNetUnfolder]: 11890/16542 cut-off events. [2022-12-13 11:25:28,212 INFO L131 PetriNetUnfolder]: For 61713/63478 co-relation queries the response was YES. [2022-12-13 11:25:28,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70648 conditions, 16542 events. 11890/16542 cut-off events. For 61713/63478 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 94321 event pairs, 1750 based on Foata normal form. 850/16360 useless extension candidates. Maximal degree in co-relation 70635. Up to 10744 conditions per place. [2022-12-13 11:25:28,295 INFO L137 encePairwiseOnDemand]: 291/299 looper letters, 92 selfloop transitions, 41 changer transitions 0/141 dead transitions. [2022-12-13 11:25:28,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 141 transitions, 1331 flow [2022-12-13 11:25:28,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:25:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:25:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 870 transitions. [2022-12-13 11:25:28,298 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48494983277591974 [2022-12-13 11:25:28,298 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 870 transitions. [2022-12-13 11:25:28,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 870 transitions. [2022-12-13 11:25:28,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:28,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 870 transitions. [2022-12-13 11:25:28,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:28,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:28,301 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:28,301 INFO L175 Difference]: Start difference. First operand has 58 places, 74 transitions, 607 flow. Second operand 6 states and 870 transitions. [2022-12-13 11:25:28,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 141 transitions, 1331 flow [2022-12-13 11:25:28,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 141 transitions, 1279 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-13 11:25:28,383 INFO L231 Difference]: Finished difference. Result has 64 places, 96 transitions, 962 flow [2022-12-13 11:25:28,383 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=962, PETRI_PLACES=64, PETRI_TRANSITIONS=96} [2022-12-13 11:25:28,383 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2022-12-13 11:25:28,383 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 96 transitions, 962 flow [2022-12-13 11:25:28,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.5) internal successors, (813), 6 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:28,383 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:28,384 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:25:28,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:25:28,384 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-12-13 11:25:28,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:28,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1023030426, now seen corresponding path program 1 times [2022-12-13 11:25:28,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:28,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100221804] [2022-12-13 11:25:28,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:28,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:28,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:28,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100221804] [2022-12-13 11:25:28,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100221804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:28,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:28,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:25:28,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891802037] [2022-12-13 11:25:28,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:28,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:25:28,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:28,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:25:28,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:25:28,511 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 299 [2022-12-13 11:25:28,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 96 transitions, 962 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:28,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:28,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 299 [2022-12-13 11:25:28,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:29,451 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([424] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_139 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_139) v_~x$w_buff1_used~0_138) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_65 v_~x~0_104)) v_~x~0_103) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_138 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_139, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_104, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_138, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_103, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][83], [P3Thread1of1ForFork1InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 247#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 32#L813true, 137#L786true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 65#L829true, Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 15#L763true, 165#true, 7#L867-1true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-13 11:25:29,451 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 11:25:29,451 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 11:25:29,452 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 11:25:29,452 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 11:25:29,452 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_77 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54)) v_~x~0_53) (= v_~x$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_76 256) 0)))) 0 v_~x$r_buff1_thd2~0_16)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= v_~x$w_buff1_used~0_76 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_77)) (= (ite .cse4 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][84], [P3Thread1of1ForFork1InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 247#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 32#L813true, 53#L756true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 65#L829true, Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 38#L793true, Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 165#true, 7#L867-1true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-13 11:25:29,452 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-13 11:25:29,452 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 11:25:29,452 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 11:25:29,452 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-13 11:25:29,459 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([424] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_139 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_139) v_~x$w_buff1_used~0_138) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_65 v_~x~0_104)) v_~x~0_103) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_138 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_139, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_104, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_138, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_103, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][180], [P3Thread1of1ForFork1InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 73#P2EXITtrue, 137#L786true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 65#L829true, Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 15#L763true, 165#true, 7#L867-1true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), 245#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork3InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork2InUse]) [2022-12-13 11:25:29,460 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,460 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,460 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,460 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,460 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_77 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54)) v_~x~0_53) (= v_~x$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_76 256) 0)))) 0 v_~x$r_buff1_thd2~0_16)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= v_~x$w_buff1_used~0_76 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_77)) (= (ite .cse4 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][207], [P3Thread1of1ForFork1InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 73#P2EXITtrue, 53#L756true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 38#L793true, 65#L829true, Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 165#true, 7#L867-1true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), 245#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-13 11:25:29,460 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,460 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,461 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,461 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,526 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([583] L867-1-->L874: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd0~0_In_3 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_Out_6 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd0~0_In_1 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_In_1 256) 0)))) (.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_In_3 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_In_1) v_~x$w_buff1_used~0_Out_6) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|) (= (ite .cse2 v_~x$w_buff0~0_In_3 (ite .cse1 v_~x$w_buff1~0_In_1 v_~x~0_In_1)) v_~x~0_Out_2) (= v_~x$r_buff0_thd0~0_Out_2 (ite .cse0 0 v_~x$r_buff0_thd0~0_In_3)) (= (ite .cse2 0 v_~x$w_buff0_used~0_In_3) v_~x$w_buff0_used~0_Out_6) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2| 0)) (= v_~x$r_buff1_thd0~0_Out_6 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_Out_6 256) 0))) (and (not (= (mod v_~x$r_buff0_thd0~0_Out_2 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_In_1))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_In_3, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_In_3, ~x$w_buff1~0=v_~x$w_buff1~0_In_1, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_In_1, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_In_1, ~x~0=v_~x~0_In_1, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_In_3, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_In_3, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_Out_2, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_2|, ~x$w_buff1~0=v_~x$w_buff1~0_In_1, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_Out_6, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_Out_6, ~x~0=v_~x~0_Out_2, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_Out_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_In_1|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0][154], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 88#P0EXITtrue, 6#L806true, 86#L832true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 153#L783true, Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 165#true, 242#true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork3InUse, 92#L874true, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork2InUse]) [2022-12-13 11:25:29,526 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,526 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,526 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,526 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,526 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L806-->L813: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_125 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_126 256) 0)))) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_111 256) 0))))) (and (= v_~x$w_buff0_used~0_125 (ite .cse0 0 v_~x$w_buff0_used~0_126)) (= v_~x$r_buff0_thd3~0_21 (ite .cse1 0 v_~x$r_buff0_thd3~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_111) v_~x$w_buff1_used~0_110) (= v_~x~0_73 (ite .cse0 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_74))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_110 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_111, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_126} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_110, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_125} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][124], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 32#L813true, 88#P0EXITtrue, 86#L832true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 153#L783true, Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 165#true, 7#L867-1true, 242#true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-13 11:25:29,526 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,526 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,527 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,527 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,527 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_125 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse3 v_~x$w_buff0~0_60 (ite .cse4 v_~x$w_buff1~0_53 v_~x~0_86)) v_~x~0_85) (= (ite .cse3 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_86, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_85, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][168], [P3Thread1of1ForFork1InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 20#L839true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 88#P0EXITtrue, 6#L806true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 153#L783true, Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 165#true, 7#L867-1true, 242#true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork3InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork2InUse]) [2022-12-13 11:25:29,527 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,527 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,527 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,527 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,573 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_125 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse3 v_~x$w_buff0~0_60 (ite .cse4 v_~x$w_buff1~0_53 v_~x~0_86)) v_~x~0_85) (= (ite .cse3 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_86, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_85, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][195], [P3Thread1of1ForFork1InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, 20#L839true, Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 88#P0EXITtrue, 6#L806true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 153#L783true, Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 165#true, 7#L867-1true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 245#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-13 11:25:29,573 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,573 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,574 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,574 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,634 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_125 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse3 v_~x$w_buff0~0_60 (ite .cse4 v_~x$w_buff1~0_53 v_~x~0_86)) v_~x~0_85) (= (ite .cse3 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_86, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_85, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][151], [P3Thread1of1ForFork1InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, 20#L839true, Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 247#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 32#L813true, 137#L786true, 53#L756true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 165#true, 7#L867-1true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork3InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork2InUse]) [2022-12-13 11:25:29,635 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,635 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,635 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,635 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,635 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([424] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_139 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_139) v_~x$w_buff1_used~0_138) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_65 v_~x~0_104)) v_~x~0_103) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_138 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_139, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_104, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_138, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_103, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][83], [P3Thread1of1ForFork1InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 247#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 32#L813true, 137#L786true, 86#L832true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 15#L763true, 165#true, 7#L867-1true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork3InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork2InUse]) [2022-12-13 11:25:29,635 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,636 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,636 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,636 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,636 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_77 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54)) v_~x~0_53) (= v_~x$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_76 256) 0)))) 0 v_~x$r_buff1_thd2~0_16)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= v_~x$w_buff1_used~0_76 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_77)) (= (ite .cse4 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][84], [P3Thread1of1ForFork1InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 247#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 32#L813true, 86#L832true, 53#L756true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 38#L793true, Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 165#true, 7#L867-1true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork3InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork2InUse]) [2022-12-13 11:25:29,636 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,636 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,636 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,637 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:29,644 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_125 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse3 v_~x$w_buff0~0_60 (ite .cse4 v_~x$w_buff1~0_53 v_~x~0_86)) v_~x~0_85) (= (ite .cse3 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_86, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_85, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][206], [P3Thread1of1ForFork1InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, 20#L839true, Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 73#P2EXITtrue, 137#L786true, 53#L756true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 165#true, 7#L867-1true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), 245#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork3InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork2InUse]) [2022-12-13 11:25:29,644 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 11:25:29,644 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:25:29,644 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:25:29,644 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:25:29,644 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([424] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_139 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_139) v_~x$w_buff1_used~0_138) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_65 v_~x~0_104)) v_~x~0_103) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_138 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_139, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_104, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_138, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_103, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][180], [P3Thread1of1ForFork1InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 73#P2EXITtrue, 137#L786true, 86#L832true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 15#L763true, 165#true, 7#L867-1true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), 245#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork3InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork2InUse]) [2022-12-13 11:25:29,644 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 11:25:29,644 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:25:29,645 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:25:29,645 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:25:29,645 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_77 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54)) v_~x~0_53) (= v_~x$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_76 256) 0)))) 0 v_~x$r_buff1_thd2~0_16)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= v_~x$w_buff1_used~0_76 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_77)) (= (ite .cse4 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][207], [P3Thread1of1ForFork1InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 73#P2EXITtrue, 86#L832true, 53#L756true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 38#L793true, Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 165#true, 7#L867-1true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), 245#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-13 11:25:29,645 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-13 11:25:29,645 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:25:29,645 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:25:29,645 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-13 11:25:29,736 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L806-->L813: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_125 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_126 256) 0)))) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_111 256) 0))))) (and (= v_~x$w_buff0_used~0_125 (ite .cse0 0 v_~x$w_buff0_used~0_126)) (= v_~x$r_buff0_thd3~0_21 (ite .cse1 0 v_~x$r_buff0_thd3~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_111) v_~x$w_buff1_used~0_110) (= v_~x~0_73 (ite .cse0 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_74))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_110 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_111, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_126} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_110, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_125} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][223], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 32#L813true, 88#P0EXITtrue, 86#L832true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 153#L783true, Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 165#true, 7#L867-1true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 245#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-13 11:25:29,736 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-13 11:25:29,736 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 11:25:29,736 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 11:25:29,737 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 11:25:30,109 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([424] L756-->L763: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_139 256) 0)) .cse4)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_154 256) 0)))) (.cse0 (and .cse3 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_139) v_~x$w_buff1_used~0_138) (= (ite .cse2 v_~x$w_buff0~0_72 (ite .cse1 v_~x$w_buff1~0_65 v_~x~0_104)) v_~x~0_103) (= v_~x$w_buff0_used~0_153 (ite .cse2 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff0_thd1~0_23 (ite .cse0 0 v_~x$r_buff0_thd1~0_24)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_138 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_139, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_104, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_72, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_65, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_138, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_103, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][40], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 44#P3EXITtrue, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 73#P2EXITtrue, 137#L786true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 15#L763true, 165#true, 242#true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork3InUse, 92#L874true, P0Thread1of1ForFork2InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0))]) [2022-12-13 11:25:30,109 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 11:25:30,110 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 11:25:30,110 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 11:25:30,110 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 11:25:30,110 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([432] L786-->L793: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_87 256) 0))) (.cse3 (not (= 0 (mod v_~x$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_88 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_77 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 v_~x$w_buff0~0_32 (ite .cse1 v_~x$w_buff1~0_29 v_~x~0_54)) v_~x~0_53) (= v_~x$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse2) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_76 256) 0)))) 0 v_~x$r_buff1_thd2~0_16)) (= (ite .cse0 0 v_~x$w_buff0_used~0_88) v_~x$w_buff0_used~0_87) (= v_~x$w_buff1_used~0_76 (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_77)) (= (ite .cse4 0 v_~x$r_buff0_thd2~0_23) v_~x$r_buff0_thd2~0_22)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_54, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_88} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_87} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][115], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 44#P3EXITtrue, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 73#P2EXITtrue, 53#L756true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 38#L793true, Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), 165#true, 242#true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), P2Thread1of1ForFork3InUse, 92#L874true, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork2InUse]) [2022-12-13 11:25:30,110 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2022-12-13 11:25:30,110 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 11:25:30,110 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 11:25:30,111 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2022-12-13 11:25:30,178 INFO L130 PetriNetUnfolder]: 10148/13979 cut-off events. [2022-12-13 11:25:30,178 INFO L131 PetriNetUnfolder]: For 122147/126837 co-relation queries the response was YES. [2022-12-13 11:25:30,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70153 conditions, 13979 events. 10148/13979 cut-off events. For 122147/126837 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 78737 event pairs, 1544 based on Foata normal form. 3073/16055 useless extension candidates. Maximal degree in co-relation 70138. Up to 8862 conditions per place. [2022-12-13 11:25:30,246 INFO L137 encePairwiseOnDemand]: 292/299 looper letters, 207 selfloop transitions, 10 changer transitions 51/279 dead transitions. [2022-12-13 11:25:30,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 279 transitions, 3410 flow [2022-12-13 11:25:30,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:25:30,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:25:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2022-12-13 11:25:30,249 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4802675585284281 [2022-12-13 11:25:30,249 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2022-12-13 11:25:30,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2022-12-13 11:25:30,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:30,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2022-12-13 11:25:30,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:30,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:30,252 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:30,252 INFO L175 Difference]: Start difference. First operand has 64 places, 96 transitions, 962 flow. Second operand 5 states and 718 transitions. [2022-12-13 11:25:30,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 279 transitions, 3410 flow [2022-12-13 11:25:30,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 279 transitions, 3297 flow, removed 32 selfloop flow, removed 2 redundant places. [2022-12-13 11:25:30,306 INFO L231 Difference]: Finished difference. Result has 69 places, 104 transitions, 994 flow [2022-12-13 11:25:30,306 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=994, PETRI_PLACES=69, PETRI_TRANSITIONS=104} [2022-12-13 11:25:30,307 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2022-12-13 11:25:30,307 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 104 transitions, 994 flow [2022-12-13 11:25:30,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:30,307 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:30,307 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:25:30,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:25:30,307 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-12-13 11:25:30,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:30,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1886385403, now seen corresponding path program 1 times [2022-12-13 11:25:30,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:30,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305490315] [2022-12-13 11:25:30,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:30,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:30,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:30,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305490315] [2022-12-13 11:25:30,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305490315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:30,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:30,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:25:30,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767167010] [2022-12-13 11:25:30,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:30,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:25:30,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:30,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:25:30,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:25:30,860 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 299 [2022-12-13 11:25:30,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 104 transitions, 994 flow. Second operand has 7 states, 7 states have (on average 134.42857142857142) internal successors, (941), 7 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:30,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:30,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 299 [2022-12-13 11:25:30,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:32,636 INFO L130 PetriNetUnfolder]: 10708/15495 cut-off events. [2022-12-13 11:25:32,636 INFO L131 PetriNetUnfolder]: For 95670/97845 co-relation queries the response was YES. [2022-12-13 11:25:32,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79616 conditions, 15495 events. 10708/15495 cut-off events. For 95670/97845 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 93914 event pairs, 2220 based on Foata normal form. 624/15334 useless extension candidates. Maximal degree in co-relation 79598. Up to 10281 conditions per place. [2022-12-13 11:25:32,708 INFO L137 encePairwiseOnDemand]: 290/299 looper letters, 140 selfloop transitions, 54 changer transitions 12/214 dead transitions. [2022-12-13 11:25:32,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 214 transitions, 2243 flow [2022-12-13 11:25:32,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:25:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:25:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1021 transitions. [2022-12-13 11:25:32,711 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4878165312947922 [2022-12-13 11:25:32,711 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1021 transitions. [2022-12-13 11:25:32,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1021 transitions. [2022-12-13 11:25:32,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:32,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1021 transitions. [2022-12-13 11:25:32,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.85714285714286) internal successors, (1021), 7 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:32,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:32,715 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:32,715 INFO L175 Difference]: Start difference. First operand has 69 places, 104 transitions, 994 flow. Second operand 7 states and 1021 transitions. [2022-12-13 11:25:32,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 214 transitions, 2243 flow [2022-12-13 11:25:32,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 214 transitions, 2230 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:25:32,797 INFO L231 Difference]: Finished difference. Result has 76 places, 128 transitions, 1501 flow [2022-12-13 11:25:32,797 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1501, PETRI_PLACES=76, PETRI_TRANSITIONS=128} [2022-12-13 11:25:32,797 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2022-12-13 11:25:32,797 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 128 transitions, 1501 flow [2022-12-13 11:25:32,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 134.42857142857142) internal successors, (941), 7 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:32,798 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:32,798 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:25:32,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:25:32,798 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-12-13 11:25:32,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:32,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1828187712, now seen corresponding path program 2 times [2022-12-13 11:25:32,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:32,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960983357] [2022-12-13 11:25:32,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:32,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:32,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:32,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960983357] [2022-12-13 11:25:32,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960983357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:32,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:32,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:25:32,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238929795] [2022-12-13 11:25:32,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:32,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:25:32,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:32,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:25:32,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:25:32,914 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 299 [2022-12-13 11:25:32,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 128 transitions, 1501 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:32,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:32,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 299 [2022-12-13 11:25:32,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:33,816 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_125 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse3 v_~x$w_buff0~0_60 (ite .cse4 v_~x$w_buff1~0_53 v_~x~0_86)) v_~x~0_85) (= (ite .cse3 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_86, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_85, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][224], [20#L839true, 88#P0EXITtrue, Black: 260#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 256#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= 2 ~x$w_buff0~0) (not (= ~x~0 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 274#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 153#L783true, Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), 165#true, 7#L867-1true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork3InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 6#L806true, 252#true, Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), Black: 247#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 244#(= ~__unbuffered_cnt~0 0), Black: 245#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|)))]) [2022-12-13 11:25:33,816 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 11:25:33,816 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:33,816 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:33,816 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:33,941 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L806-->L813: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_125 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_126 256) 0)))) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_111 256) 0))))) (and (= v_~x$w_buff0_used~0_125 (ite .cse0 0 v_~x$w_buff0_used~0_126)) (= v_~x$r_buff0_thd3~0_21 (ite .cse1 0 v_~x$r_buff0_thd3~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_111) v_~x$w_buff1_used~0_110) (= v_~x~0_73 (ite .cse0 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_74))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_110 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_111, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_126} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_110, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_125} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][270], [32#L813true, 88#P0EXITtrue, Black: 260#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 256#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= 2 ~x$w_buff0~0) (not (= ~x~0 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 274#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 86#L832true, Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 153#L783true, Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), 165#true, 7#L867-1true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork1InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 252#true, Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), Black: 247#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 244#(= ~__unbuffered_cnt~0 0), Black: 245#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|)))]) [2022-12-13 11:25:33,941 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-13 11:25:33,942 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 11:25:33,942 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 11:25:33,942 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 11:25:34,204 INFO L130 PetriNetUnfolder]: 6699/9549 cut-off events. [2022-12-13 11:25:34,204 INFO L131 PetriNetUnfolder]: For 110880/113747 co-relation queries the response was YES. [2022-12-13 11:25:34,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54820 conditions, 9549 events. 6699/9549 cut-off events. For 110880/113747 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 54377 event pairs, 764 based on Foata normal form. 2134/11254 useless extension candidates. Maximal degree in co-relation 54800. Up to 5679 conditions per place. [2022-12-13 11:25:34,246 INFO L137 encePairwiseOnDemand]: 292/299 looper letters, 380 selfloop transitions, 15 changer transitions 24/431 dead transitions. [2022-12-13 11:25:34,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 431 transitions, 6110 flow [2022-12-13 11:25:34,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:25:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:25:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1003 transitions. [2022-12-13 11:25:34,248 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47921643573817485 [2022-12-13 11:25:34,249 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1003 transitions. [2022-12-13 11:25:34,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1003 transitions. [2022-12-13 11:25:34,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:34,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1003 transitions. [2022-12-13 11:25:34,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.28571428571428) internal successors, (1003), 7 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:34,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:34,252 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:34,252 INFO L175 Difference]: Start difference. First operand has 76 places, 128 transitions, 1501 flow. Second operand 7 states and 1003 transitions. [2022-12-13 11:25:34,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 431 transitions, 6110 flow [2022-12-13 11:25:34,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 431 transitions, 5843 flow, removed 51 selfloop flow, removed 3 redundant places. [2022-12-13 11:25:34,299 INFO L231 Difference]: Finished difference. Result has 81 places, 131 transitions, 1472 flow [2022-12-13 11:25:34,300 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1472, PETRI_PLACES=81, PETRI_TRANSITIONS=131} [2022-12-13 11:25:34,300 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2022-12-13 11:25:34,300 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 131 transitions, 1472 flow [2022-12-13 11:25:34,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:34,300 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:34,300 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-12-13 11:25:34,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:25:34,301 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-12-13 11:25:34,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:34,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1743668392, now seen corresponding path program 1 times [2022-12-13 11:25:34,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:34,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858451655] [2022-12-13 11:25:34,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:34,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:34,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:34,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858451655] [2022-12-13 11:25:34,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858451655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:34,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:34,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:25:34,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993467958] [2022-12-13 11:25:34,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:34,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:25:34,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:34,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:25:34,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:25:34,440 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 299 [2022-12-13 11:25:34,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 131 transitions, 1472 flow. Second operand has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:34,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:34,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 299 [2022-12-13 11:25:34,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:35,374 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_137 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_138 256) 0)))) (.cse0 (and .cse5 .cse1)) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_125 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse2 (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse3 v_~x$w_buff0~0_60 (ite .cse4 v_~x$w_buff1~0_53 v_~x~0_86)) v_~x~0_85) (= (ite .cse3 0 v_~x$w_buff0_used~0_138) v_~x$w_buff0_used~0_137) (= (ite (or .cse0 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_86, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_138} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_85, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_137} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][224], [20#L839true, 288#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 88#P0EXITtrue, Black: 260#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 256#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= 2 ~x$w_buff0~0) (not (= ~x~0 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 274#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 153#L783true, Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 269#(<= ~__unbuffered_cnt~0 1), Black: 270#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 165#true, 7#L867-1true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork1InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P1Thread1of1ForFork0InUse, Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), 6#L806true, Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), Black: 247#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 244#(= ~__unbuffered_cnt~0 0), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|)))]) [2022-12-13 11:25:35,374 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-13 11:25:35,374 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:35,374 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:35,374 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-13 11:25:35,505 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([439] L806-->L813: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_125 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_126 256) 0)))) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_111 256) 0))))) (and (= v_~x$w_buff0_used~0_125 (ite .cse0 0 v_~x$w_buff0_used~0_126)) (= v_~x$r_buff0_thd3~0_21 (ite .cse1 0 v_~x$r_buff0_thd3~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_111) v_~x$w_buff1_used~0_110) (= v_~x~0_73 (ite .cse0 v_~x$w_buff0~0_54 (ite .cse2 v_~x$w_buff1~0_47 v_~x~0_74))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_110 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_111, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_126} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_47, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_110, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_125} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][270], [288#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 32#L813true, 88#P0EXITtrue, Black: 260#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 256#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd1~0) (= 2 ~x$w_buff0~0) (not (= ~x~0 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 86#L832true, 274#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 198#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 153#L783true, Black: 207#(and (= 0 ~x$w_buff0~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= ~x~0 1)), Black: 269#(<= ~__unbuffered_cnt~0 1), Black: 270#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 165#true, 7#L867-1true, Black: 216#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork3InUse, 232#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork0InUse, Black: 224#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 222#(and (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0)), 172#true, 193#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|))), Black: 233#(and (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 238#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 175#(and (or (and (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))) (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0)))) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 174#(and (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= ~x~0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff1~0)), Black: 247#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 244#(= ~__unbuffered_cnt~0 0), Black: 185#(and (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1187~0#1.base| |ULTIMATE.start_main_~#t1186~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1188~0#1.base| 0) |ULTIMATE.start_main_~#t1186~0#1.base| 0) |ULTIMATE.start_main_~#t1187~0#1.base| 0) |ULTIMATE.start_main_~#t1185~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1186~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1185~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1188~0#1.base| |ULTIMATE.start_main_~#t1187~0#1.base|)))]) [2022-12-13 11:25:35,505 INFO L383 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-13 11:25:35,505 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 11:25:35,505 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 11:25:35,505 INFO L386 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-13 11:25:35,733 INFO L130 PetriNetUnfolder]: 6173/8778 cut-off events. [2022-12-13 11:25:35,733 INFO L131 PetriNetUnfolder]: For 97508/100289 co-relation queries the response was YES. [2022-12-13 11:25:35,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51604 conditions, 8778 events. 6173/8778 cut-off events. For 97508/100289 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 49640 event pairs, 617 based on Foata normal form. 1603/9986 useless extension candidates. Maximal degree in co-relation 51582. Up to 5102 conditions per place. [2022-12-13 11:25:35,770 INFO L137 encePairwiseOnDemand]: 292/299 looper letters, 389 selfloop transitions, 24 changer transitions 39/464 dead transitions. [2022-12-13 11:25:35,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 464 transitions, 6337 flow [2022-12-13 11:25:35,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:25:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 11:25:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1290 transitions. [2022-12-13 11:25:35,772 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4793756967670011 [2022-12-13 11:25:35,772 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1290 transitions. [2022-12-13 11:25:35,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1290 transitions. [2022-12-13 11:25:35,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:35,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1290 transitions. [2022-12-13 11:25:35,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 143.33333333333334) internal successors, (1290), 9 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:35,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 299.0) internal successors, (2990), 10 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:35,777 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 299.0) internal successors, (2990), 10 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:35,777 INFO L175 Difference]: Start difference. First operand has 81 places, 131 transitions, 1472 flow. Second operand 9 states and 1290 transitions. [2022-12-13 11:25:35,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 464 transitions, 6337 flow [2022-12-13 11:25:36,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 464 transitions, 6031 flow, removed 61 selfloop flow, removed 5 redundant places. [2022-12-13 11:25:36,026 INFO L231 Difference]: Finished difference. Result has 87 places, 136 transitions, 1483 flow [2022-12-13 11:25:36,026 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1483, PETRI_PLACES=87, PETRI_TRANSITIONS=136} [2022-12-13 11:25:36,026 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 35 predicate places. [2022-12-13 11:25:36,026 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 136 transitions, 1483 flow [2022-12-13 11:25:36,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:36,027 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:36,027 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-12-13 11:25:36,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 11:25:36,027 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-12-13 11:25:36,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:36,027 INFO L85 PathProgramCache]: Analyzing trace with hash 850470045, now seen corresponding path program 1 times [2022-12-13 11:25:36,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:36,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131184910] [2022-12-13 11:25:36,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:36,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:36,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:36,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131184910] [2022-12-13 11:25:36,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131184910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:36,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:36,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:25:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624588316] [2022-12-13 11:25:36,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:36,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:25:36,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:36,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:25:36,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:25:36,342 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 299 [2022-12-13 11:25:36,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 136 transitions, 1483 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:36,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:36,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 299 [2022-12-13 11:25:36,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:38,256 INFO L130 PetriNetUnfolder]: 10881/15771 cut-off events. [2022-12-13 11:25:38,256 INFO L131 PetriNetUnfolder]: For 99961/100623 co-relation queries the response was YES. [2022-12-13 11:25:38,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85831 conditions, 15771 events. 10881/15771 cut-off events. For 99961/100623 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 92812 event pairs, 1967 based on Foata normal form. 491/16222 useless extension candidates. Maximal degree in co-relation 85807. Up to 8559 conditions per place. [2022-12-13 11:25:38,326 INFO L137 encePairwiseOnDemand]: 285/299 looper letters, 166 selfloop transitions, 77 changer transitions 131/378 dead transitions. [2022-12-13 11:25:38,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 378 transitions, 4659 flow [2022-12-13 11:25:38,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:25:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:25:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 830 transitions. [2022-12-13 11:25:38,328 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46265328874024525 [2022-12-13 11:25:38,328 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 830 transitions. [2022-12-13 11:25:38,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 830 transitions. [2022-12-13 11:25:38,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:38,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 830 transitions. [2022-12-13 11:25:38,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.33333333333334) internal successors, (830), 6 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:38,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:38,333 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:38,333 INFO L175 Difference]: Start difference. First operand has 87 places, 136 transitions, 1483 flow. Second operand 6 states and 830 transitions. [2022-12-13 11:25:38,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 378 transitions, 4659 flow [2022-12-13 11:25:39,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 378 transitions, 4335 flow, removed 122 selfloop flow, removed 3 redundant places. [2022-12-13 11:25:39,133 INFO L231 Difference]: Finished difference. Result has 94 places, 168 transitions, 2074 flow [2022-12-13 11:25:39,133 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=1395, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2074, PETRI_PLACES=94, PETRI_TRANSITIONS=168} [2022-12-13 11:25:39,133 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 42 predicate places. [2022-12-13 11:25:39,133 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 168 transitions, 2074 flow [2022-12-13 11:25:39,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:39,133 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:39,133 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-12-13 11:25:39,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 11:25:39,134 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-12-13 11:25:39,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:39,134 INFO L85 PathProgramCache]: Analyzing trace with hash -967142847, now seen corresponding path program 2 times [2022-12-13 11:25:39,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:39,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193304094] [2022-12-13 11:25:39,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:39,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:39,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:39,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193304094] [2022-12-13 11:25:39,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193304094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:39,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:39,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:25:39,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351142118] [2022-12-13 11:25:39,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:39,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:25:39,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:39,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:25:39,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:25:39,285 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 299 [2022-12-13 11:25:39,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 168 transitions, 2074 flow. Second operand has 7 states, 7 states have (on average 132.85714285714286) internal successors, (930), 7 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:39,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:39,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 299 [2022-12-13 11:25:39,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:40,971 INFO L130 PetriNetUnfolder]: 7596/11086 cut-off events. [2022-12-13 11:25:40,971 INFO L131 PetriNetUnfolder]: For 125038/127944 co-relation queries the response was YES. [2022-12-13 11:25:41,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67239 conditions, 11086 events. 7596/11086 cut-off events. For 125038/127944 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 68898 event pairs, 574 based on Foata normal form. 1548/12166 useless extension candidates. Maximal degree in co-relation 67210. Up to 6294 conditions per place. [2022-12-13 11:25:41,022 INFO L137 encePairwiseOnDemand]: 292/299 looper letters, 410 selfloop transitions, 22 changer transitions 105/555 dead transitions. [2022-12-13 11:25:41,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 555 transitions, 8376 flow [2022-12-13 11:25:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:25:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 11:25:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1544 transitions. [2022-12-13 11:25:41,025 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46944359987838247 [2022-12-13 11:25:41,025 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1544 transitions. [2022-12-13 11:25:41,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1544 transitions. [2022-12-13 11:25:41,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:41,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1544 transitions. [2022-12-13 11:25:41,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 140.36363636363637) internal successors, (1544), 11 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:41,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 299.0) internal successors, (3588), 12 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:41,031 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 299.0) internal successors, (3588), 12 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:41,031 INFO L175 Difference]: Start difference. First operand has 94 places, 168 transitions, 2074 flow. Second operand 11 states and 1544 transitions. [2022-12-13 11:25:41,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 555 transitions, 8376 flow [2022-12-13 11:25:41,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 555 transitions, 7838 flow, removed 217 selfloop flow, removed 4 redundant places. [2022-12-13 11:25:41,379 INFO L231 Difference]: Finished difference. Result has 102 places, 154 transitions, 1830 flow [2022-12-13 11:25:41,379 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=1882, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1830, PETRI_PLACES=102, PETRI_TRANSITIONS=154} [2022-12-13 11:25:41,379 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 50 predicate places. [2022-12-13 11:25:41,380 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 154 transitions, 1830 flow [2022-12-13 11:25:41,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 132.85714285714286) internal successors, (930), 7 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:41,380 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:41,380 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-12-13 11:25:41,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 11:25:41,380 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-12-13 11:25:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash 640615375, now seen corresponding path program 1 times [2022-12-13 11:25:41,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:41,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501777384] [2022-12-13 11:25:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:41,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:41,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-12-13 11:25:41,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:41,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501777384] [2022-12-13 11:25:41,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501777384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:41,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:41,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:25:41,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973062327] [2022-12-13 11:25:41,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:41,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:25:41,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:41,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:25:41,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:25:41,696 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 299 [2022-12-13 11:25:41,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 154 transitions, 1830 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:41,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:41,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 299 [2022-12-13 11:25:41,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:43,367 INFO L130 PetriNetUnfolder]: 9399/13942 cut-off events. [2022-12-13 11:25:43,367 INFO L131 PetriNetUnfolder]: For 88704/89420 co-relation queries the response was YES. [2022-12-13 11:25:43,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80320 conditions, 13942 events. 9399/13942 cut-off events. For 88704/89420 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 85222 event pairs, 1683 based on Foata normal form. 541/14451 useless extension candidates. Maximal degree in co-relation 80291. Up to 7152 conditions per place. [2022-12-13 11:25:43,407 INFO L137 encePairwiseOnDemand]: 293/299 looper letters, 103 selfloop transitions, 7 changer transitions 127/241 dead transitions. [2022-12-13 11:25:43,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 241 transitions, 3181 flow [2022-12-13 11:25:43,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:25:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:25:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2022-12-13 11:25:43,410 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46070234113712377 [2022-12-13 11:25:43,410 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2022-12-13 11:25:43,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2022-12-13 11:25:43,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:43,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2022-12-13 11:25:43,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:43,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:43,412 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:43,412 INFO L175 Difference]: Start difference. First operand has 102 places, 154 transitions, 1830 flow. Second operand 4 states and 551 transitions. [2022-12-13 11:25:43,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 241 transitions, 3181 flow [2022-12-13 11:25:43,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 241 transitions, 2960 flow, removed 69 selfloop flow, removed 9 redundant places. [2022-12-13 11:25:43,759 INFO L231 Difference]: Finished difference. Result has 96 places, 95 transitions, 888 flow [2022-12-13 11:25:43,759 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=1711, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=888, PETRI_PLACES=96, PETRI_TRANSITIONS=95} [2022-12-13 11:25:43,759 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 44 predicate places. [2022-12-13 11:25:43,759 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 95 transitions, 888 flow [2022-12-13 11:25:43,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:43,759 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:43,760 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-12-13 11:25:43,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 11:25:43,760 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-12-13 11:25:43,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:43,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1923855371, now seen corresponding path program 2 times [2022-12-13 11:25:43,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:43,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959828981] [2022-12-13 11:25:43,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:43,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:44,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:44,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959828981] [2022-12-13 11:25:44,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959828981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:44,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:44,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:25:44,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802692997] [2022-12-13 11:25:44,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:44,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:25:44,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:44,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:25:44,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:25:44,097 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 299 [2022-12-13 11:25:44,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 95 transitions, 888 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:44,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:44,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 299 [2022-12-13 11:25:44,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:45,145 INFO L130 PetriNetUnfolder]: 4991/7657 cut-off events. [2022-12-13 11:25:45,146 INFO L131 PetriNetUnfolder]: For 43912/44313 co-relation queries the response was YES. [2022-12-13 11:25:45,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41248 conditions, 7657 events. 4991/7657 cut-off events. For 43912/44313 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 46142 event pairs, 882 based on Foata normal form. 267/7913 useless extension candidates. Maximal degree in co-relation 41221. Up to 3930 conditions per place. [2022-12-13 11:25:45,171 INFO L137 encePairwiseOnDemand]: 290/299 looper letters, 59 selfloop transitions, 8 changer transitions 111/180 dead transitions. [2022-12-13 11:25:45,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 180 transitions, 1925 flow [2022-12-13 11:25:45,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:25:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:25:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 797 transitions. [2022-12-13 11:25:45,174 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4442586399108138 [2022-12-13 11:25:45,174 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 797 transitions. [2022-12-13 11:25:45,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 797 transitions. [2022-12-13 11:25:45,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:45,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 797 transitions. [2022-12-13 11:25:45,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:45,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:45,177 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:45,177 INFO L175 Difference]: Start difference. First operand has 96 places, 95 transitions, 888 flow. Second operand 6 states and 797 transitions. [2022-12-13 11:25:45,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 180 transitions, 1925 flow [2022-12-13 11:25:45,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 180 transitions, 1878 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 11:25:45,288 INFO L231 Difference]: Finished difference. Result has 97 places, 58 transitions, 504 flow [2022-12-13 11:25:45,288 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=97, PETRI_TRANSITIONS=58} [2022-12-13 11:25:45,288 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 45 predicate places. [2022-12-13 11:25:45,288 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 58 transitions, 504 flow [2022-12-13 11:25:45,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:45,288 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:45,289 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-12-13 11:25:45,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 11:25:45,289 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 11:25:45,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:45,289 INFO L85 PathProgramCache]: Analyzing trace with hash -519471729, now seen corresponding path program 3 times [2022-12-13 11:25:45,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:45,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230960021] [2022-12-13 11:25:45,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:45,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:25:46,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:25:46,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:25:46,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230960021] [2022-12-13 11:25:46,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230960021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:25:46,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:25:46,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:25:46,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731012543] [2022-12-13 11:25:46,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:25:46,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:25:46,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:25:46,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:25:46,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:25:46,333 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 299 [2022-12-13 11:25:46,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 58 transitions, 504 flow. Second operand has 10 states, 10 states have (on average 131.4) internal successors, (1314), 10 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:46,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:25:46,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 299 [2022-12-13 11:25:46,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:25:46,853 INFO L130 PetriNetUnfolder]: 1352/2250 cut-off events. [2022-12-13 11:25:46,853 INFO L131 PetriNetUnfolder]: For 10871/10904 co-relation queries the response was YES. [2022-12-13 11:25:46,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11278 conditions, 2250 events. 1352/2250 cut-off events. For 10871/10904 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11516 event pairs, 191 based on Foata normal form. 12/2203 useless extension candidates. Maximal degree in co-relation 11252. Up to 840 conditions per place. [2022-12-13 11:25:46,860 INFO L137 encePairwiseOnDemand]: 292/299 looper letters, 61 selfloop transitions, 6 changer transitions 65/136 dead transitions. [2022-12-13 11:25:46,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 136 transitions, 1298 flow [2022-12-13 11:25:46,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:25:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:25:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 972 transitions. [2022-12-13 11:25:46,862 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46440516005733395 [2022-12-13 11:25:46,862 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 972 transitions. [2022-12-13 11:25:46,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 972 transitions. [2022-12-13 11:25:46,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:25:46,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 972 transitions. [2022-12-13 11:25:46,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.85714285714286) internal successors, (972), 7 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:46,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:46,865 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:46,865 INFO L175 Difference]: Start difference. First operand has 97 places, 58 transitions, 504 flow. Second operand 7 states and 972 transitions. [2022-12-13 11:25:46,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 136 transitions, 1298 flow [2022-12-13 11:25:46,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 136 transitions, 1102 flow, removed 56 selfloop flow, removed 21 redundant places. [2022-12-13 11:25:46,899 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 383 flow [2022-12-13 11:25:46,899 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=383, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2022-12-13 11:25:46,900 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2022-12-13 11:25:46,900 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 383 flow [2022-12-13 11:25:46,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 131.4) internal successors, (1314), 10 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:25:46,900 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:25:46,900 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-12-13 11:25:46,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 11:25:46,900 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 11:25:46,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:25:46,901 INFO L85 PathProgramCache]: Analyzing trace with hash -720393941, now seen corresponding path program 4 times [2022-12-13 11:25:46,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:25:46,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538769415] [2022-12-13 11:25:46,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:25:46,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:25:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:25:46,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:25:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:25:47,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:25:47,015 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:25:47,016 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 11:25:47,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 11:25:47,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 11:25:47,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 11:25:47,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 11:25:47,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 11:25:47,018 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 11:25:47,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 11:25:47,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 11:25:47,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-13 11:25:47,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 11:25:47,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 11:25:47,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 11:25:47,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 11:25:47,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-13 11:25:47,019 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 11:25:47,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 11:25:47,020 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:25:47,025 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:25:47,025 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:25:47,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:25:47 BasicIcfg [2022-12-13 11:25:47,085 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:25:47,085 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 11:25:47,085 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 11:25:47,085 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 11:25:47,085 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:25:04" (3/4) ... [2022-12-13 11:25:47,087 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 11:25:47,087 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 11:25:47,087 INFO L158 Benchmark]: Toolchain (without parser) took 43285.94ms. Allocated memory was 117.4MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 81.5MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 954.4MB. Max. memory is 16.1GB. [2022-12-13 11:25:47,088 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 93.2MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 11:25:47,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.53ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 53.1MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 11:25:47,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.87ms. Allocated memory is still 117.4MB. Free memory was 53.1MB in the beginning and 50.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:25:47,088 INFO L158 Benchmark]: Boogie Preprocessor took 36.71ms. Allocated memory was 117.4MB in the beginning and 146.8MB in the end (delta: 29.4MB). Free memory was 50.4MB in the beginning and 116.8MB in the end (delta: -66.5MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2022-12-13 11:25:47,088 INFO L158 Benchmark]: RCFGBuilder took 500.69ms. Allocated memory is still 146.8MB. Free memory was 117.5MB in the beginning and 78.9MB in the end (delta: 38.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-12-13 11:25:47,088 INFO L158 Benchmark]: TraceAbstraction took 42285.09ms. Allocated memory was 146.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 77.6MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 917.4MB. Max. memory is 16.1GB. [2022-12-13 11:25:47,089 INFO L158 Benchmark]: Witness Printer took 2.25ms. Allocated memory is still 2.1GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:25:47,090 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.17ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 93.2MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.53ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 53.1MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.87ms. Allocated memory is still 117.4MB. Free memory was 53.1MB in the beginning and 50.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.71ms. Allocated memory was 117.4MB in the beginning and 146.8MB in the end (delta: 29.4MB). Free memory was 50.4MB in the beginning and 116.8MB in the end (delta: -66.5MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * RCFGBuilder took 500.69ms. Allocated memory is still 146.8MB. Free memory was 117.5MB in the beginning and 78.9MB in the end (delta: 38.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 42285.09ms. Allocated memory was 146.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 77.6MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 917.4MB. Max. memory is 16.1GB. * Witness Printer took 2.25ms. Allocated memory is still 2.1GB. Free memory was 1.1GB in the beginning and 1.1GB 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: 5.6s, 158 PlacesBefore, 52 PlacesAfterwards, 147 TransitionsBefore, 39 TransitionsAfterwards, 3866 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 148 TotalNumberOfCompositions, 10689 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4705, independent: 4460, independent conditional: 0, independent unconditional: 4460, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2128, independent: 2061, independent conditional: 0, independent unconditional: 2061, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4705, independent: 2399, independent conditional: 0, independent unconditional: 2399, dependent: 178, dependent conditional: 0, dependent unconditional: 178, unknown: 2128, unknown conditional: 0, unknown unconditional: 2128] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1185, ((void *)0), P0, ((void *)0))=-2, t1185={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] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1186, ((void *)0), P1, ((void *)0))=-1, t1185={5:0}, t1186={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] [L860] 0 pthread_t t1187; [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1187, ((void *)0), P2, ((void *)0))=0, t1185={5:0}, t1186={6:0}, t1187={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] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1188, ((void *)0), P3, ((void *)0))=1, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={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] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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}, b=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=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}, b=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=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}, b=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=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}, b=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L822] 4 z = 2 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L788] 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) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 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 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 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_p1_EAX=0, __unbuffered_p3_EAX=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L808] 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) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 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 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 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 [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L834] 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) [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] 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 [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] 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_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] 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 [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] 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_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185={5:0}, t1186={6:0}, t1187={7:0}, t1188={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: 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: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 857]: 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: 859]: 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, 189 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: 42.1s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 30.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1394 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1115 mSDsluCounter, 485 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 330 mSDsCounter, 293 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3363 IncrementalHoareTripleChecker+Invalid, 3656 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 293 mSolverCounterUnsat, 155 mSDtfsCounter, 3363 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2074occurred in iteration=15, InterpolantAutomatonStates: 106, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 350 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 3508 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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-12-13 11:25:47,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 11:25:48,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:25:48,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:25:48,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:25:48,819 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:25:48,819 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:25:48,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:25:48,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:25:48,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:25:48,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:25:48,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:25:48,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:25:48,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:25:48,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:25:48,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:25:48,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:25:48,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:25:48,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:25:48,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:25:48,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:25:48,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:25:48,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:25:48,833 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:25:48,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:25:48,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:25:48,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:25:48,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:25:48,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:25:48,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:25:48,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:25:48,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:25:48,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:25:48,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:25:48,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:25:48,845 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:25:48,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:25:48,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:25:48,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:25:48,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:25:48,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:25:48,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:25:48,850 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 11:25:48,871 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:25:48,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:25:48,872 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 11:25:48,872 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 11:25:48,872 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 11:25:48,872 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 11:25:48,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:25:48,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:25:48,873 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:25:48,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:25:48,873 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:25:48,874 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 11:25:48,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:25:48,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:25:48,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:25:48,874 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 11:25:48,874 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 11:25:48,875 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 11:25:48,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:25:48,875 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 11:25:48,875 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 11:25:48,875 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 11:25:48,875 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:25:48,875 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:25:48,876 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:25:48,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:25:48,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:25:48,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:25:48,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:25:48,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:25:48,877 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 11:25:48,877 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 11:25:48,877 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 11:25:48,877 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 11:25:48,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 11:25:48,878 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 11:25:48,878 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 11:25:48,878 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_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b2ed0379679fef7868072cf33e9753c7c5c6d498ba6cea443eeb2e2c1bbc6d1 [2022-12-13 11:25:49,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:25:49,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:25:49,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:25:49,106 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:25:49,106 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:25:49,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2022-12-13 11:25:51,731 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:25:51,956 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:25:51,957 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i [2022-12-13 11:25:51,969 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/data/67aec5549/9abb9747a41f4311b70b2b64d46ca4c2/FLAGd52ef7453 [2022-12-13 11:25:51,983 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/data/67aec5549/9abb9747a41f4311b70b2b64d46ca4c2 [2022-12-13 11:25:51,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:25:51,987 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 11:25:51,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:25:51,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:25:51,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:25:51,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:25:51" (1/1) ... [2022-12-13 11:25:51,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13039f6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:51, skipping insertion in model container [2022-12-13 11:25:51,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:25:51" (1/1) ... [2022-12-13 11:25:51,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:25:52,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:25:52,157 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_800329d3-1da8-41b2-bf23-04ab5ebd1b51/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i[949,962] [2022-12-13 11:25:52,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:25:52,310 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:25:52,328 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_800329d3-1da8-41b2-bf23-04ab5ebd1b51/sv-benchmarks/c/pthread-wmm/mix044_tso.oepc.i[949,962] [2022-12-13 11:25:52,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,356 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:25:52,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:25:52,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:25:52,391 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:25:52,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:52 WrapperNode [2022-12-13 11:25:52,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:25:52,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:25:52,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:25:52,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:25:52,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:52" (1/1) ... [2022-12-13 11:25:52,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:52" (1/1) ... [2022-12-13 11:25:52,427 INFO L138 Inliner]: procedures = 180, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2022-12-13 11:25:52,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:25:52,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:25:52,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:25:52,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:25:52,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:52" (1/1) ... [2022-12-13 11:25:52,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:52" (1/1) ... [2022-12-13 11:25:52,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:52" (1/1) ... [2022-12-13 11:25:52,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:52" (1/1) ... [2022-12-13 11:25:52,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:52" (1/1) ... [2022-12-13 11:25:52,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:52" (1/1) ... [2022-12-13 11:25:52,449 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:52" (1/1) ... [2022-12-13 11:25:52,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:52" (1/1) ... [2022-12-13 11:25:52,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:25:52,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:25:52,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:25:52,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:25:52,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:52" (1/1) ... [2022-12-13 11:25:52,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:25:52,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:25:52,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:25:52,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:25:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:25:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:25:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:25:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:25:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 11:25:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 11:25:52,519 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:25:52,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:25:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:25:52,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:25:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:25:52,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:25:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 11:25:52,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 11:25:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:25:52,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:25:52,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:25:52,522 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 11:25:52,630 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 11:25:52,632 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:25:52,962 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 11:25:53,073 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:25:53,073 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:25:53,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:25:53 BoogieIcfgContainer [2022-12-13 11:25:53,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:25:53,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:25:53,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:25:53,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:25:53,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:25:51" (1/3) ... [2022-12-13 11:25:53,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a76575c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:25:53, skipping insertion in model container [2022-12-13 11:25:53,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:25:52" (2/3) ... [2022-12-13 11:25:53,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a76575c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:25:53, skipping insertion in model container [2022-12-13 11:25:53,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:25:53" (3/3) ... [2022-12-13 11:25:53,083 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2022-12-13 11:25:53,101 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:25:53,101 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-12-13 11:25:53,101 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:25:53,160 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:25:53,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 152 transitions, 324 flow [2022-12-13 11:25:53,232 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-12-13 11:25:53,233 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:25:53,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 11:25:53,238 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 152 transitions, 324 flow [2022-12-13 11:25:53,241 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 148 transitions, 308 flow [2022-12-13 11:25:53,244 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 11:25:53,251 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 148 transitions, 308 flow [2022-12-13 11:25:53,253 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 148 transitions, 308 flow [2022-12-13 11:25:53,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 308 flow [2022-12-13 11:25:53,276 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2022-12-13 11:25:53,276 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:25:53,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 11:25:53,279 INFO L119 LiptonReduction]: Number of co-enabled transitions 3866 [2022-12-13 11:26:01,715 INFO L134 LiptonReduction]: Checked pairs total: 10633 [2022-12-13 11:26:01,715 INFO L136 LiptonReduction]: Total number of compositions: 143 [2022-12-13 11:26:01,726 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:26:01,730 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;@7f74eb7f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:26:01,730 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-12-13 11:26:01,732 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 11:26:01,732 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:26:01,732 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:26:01,732 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 11:26:01,733 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 11:26:01,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:26:01,736 INFO L85 PathProgramCache]: Analyzing trace with hash 635, now seen corresponding path program 1 times [2022-12-13 11:26:01,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 11:26:01,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932868963] [2022-12-13 11:26:01,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:26:01,745 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-12-13 11:26:01,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 11:26:01,746 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:01,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:26:01,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 11:26:01,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:26:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:26:01,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:26:01,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 11:26:01,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932868963] [2022-12-13 11:26:01,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932868963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:26:01,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:26:01,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 11:26:01,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410214269] [2022-12-13 11:26:01,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:26:01,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 11:26:01,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 11:26:01,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 11:26:01,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 11:26:01,827 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 295 [2022-12-13 11:26:01,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:01,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:26:01,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 295 [2022-12-13 11:26:01,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:26:03,067 INFO L130 PetriNetUnfolder]: 5973/8362 cut-off events. [2022-12-13 11:26:03,067 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-13 11:26:03,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16680 conditions, 8362 events. 5973/8362 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 44962 event pairs, 5973 based on Foata normal form. 0/6973 useless extension candidates. Maximal degree in co-relation 16668. Up to 8103 conditions per place. [2022-12-13 11:26:03,112 INFO L137 encePairwiseOnDemand]: 287/295 looper letters, 26 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2022-12-13 11:26:03,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 126 flow [2022-12-13 11:26:03,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 11:26:03,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 11:26:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 308 transitions. [2022-12-13 11:26:03,123 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5220338983050847 [2022-12-13 11:26:03,124 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 308 transitions. [2022-12-13 11:26:03,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 308 transitions. [2022-12-13 11:26:03,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:26:03,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 308 transitions. [2022-12-13 11:26:03,130 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-12-13 11:26:03,134 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-12-13 11:26:03,135 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-12-13 11:26:03,136 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 90 flow. Second operand 2 states and 308 transitions. [2022-12-13 11:26:03,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 126 flow [2022-12-13 11:26:03,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:26:03,142 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2022-12-13 11:26:03,144 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-12-13 11:26:03,147 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2022-12-13 11:26:03,147 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2022-12-13 11:26:03,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:03,148 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:26:03,148 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 11:26:03,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:03,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:03,349 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 11:26:03,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:26:03,350 INFO L85 PathProgramCache]: Analyzing trace with hash 598820444, now seen corresponding path program 1 times [2022-12-13 11:26:03,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 11:26:03,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653653660] [2022-12-13 11:26:03,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:26:03,352 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-12-13 11:26:03,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 11:26:03,354 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:03,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:26:03,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 11:26:03,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:26:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:26:03,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:26:03,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 11:26:03,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653653660] [2022-12-13 11:26:03,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653653660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:26:03,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:26:03,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:26:03,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072536305] [2022-12-13 11:26:03,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:26:03,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:26:03,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 11:26:03,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:26:03,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:26:03,557 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 295 [2022-12-13 11:26:03,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:03,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:26:03,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 295 [2022-12-13 11:26:03,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:26:04,430 INFO L130 PetriNetUnfolder]: 4695/6573 cut-off events. [2022-12-13 11:26:04,430 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:26:04,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13146 conditions, 6573 events. 4695/6573 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 33859 event pairs, 1757 based on Foata normal form. 0/5988 useless extension candidates. Maximal degree in co-relation 13143. Up to 5107 conditions per place. [2022-12-13 11:26:04,460 INFO L137 encePairwiseOnDemand]: 292/295 looper letters, 39 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2022-12-13 11:26:04,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 194 flow [2022-12-13 11:26:04,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:26:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:26:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2022-12-13 11:26:04,463 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5107344632768361 [2022-12-13 11:26:04,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2022-12-13 11:26:04,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2022-12-13 11:26:04,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:26:04,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2022-12-13 11:26:04,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:04,467 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-12-13 11:26:04,467 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-12-13 11:26:04,467 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 452 transitions. [2022-12-13 11:26:04,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 194 flow [2022-12-13 11:26:04,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:26:04,469 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2022-12-13 11:26:04,469 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-12-13 11:26:04,469 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2022-12-13 11:26:04,470 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2022-12-13 11:26:04,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:04,470 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:26:04,470 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:26:04,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:04,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:04,671 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-12-13 11:26:04,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:26:04,672 INFO L85 PathProgramCache]: Analyzing trace with hash 166469147, now seen corresponding path program 1 times [2022-12-13 11:26:04,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 11:26:04,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034837840] [2022-12-13 11:26:04,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:26:04,674 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-12-13 11:26:04,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 11:26:04,675 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:04,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:26:04,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 11:26:04,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:26:04,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:26:04,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:26:04,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 11:26:04,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034837840] [2022-12-13 11:26:04,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034837840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:26:04,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:26:04,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:26:04,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17748409] [2022-12-13 11:26:04,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:26:04,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:26:04,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 11:26:04,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:26:04,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:26:04,855 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2022-12-13 11:26:04,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:04,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:26:04,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2022-12-13 11:26:04,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:26:05,419 INFO L130 PetriNetUnfolder]: 3224/4672 cut-off events. [2022-12-13 11:26:05,419 INFO L131 PetriNetUnfolder]: For 313/313 co-relation queries the response was YES. [2022-12-13 11:26:05,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9768 conditions, 4672 events. 3224/4672 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 25058 event pairs, 626 based on Foata normal form. 256/4687 useless extension candidates. Maximal degree in co-relation 9764. Up to 3325 conditions per place. [2022-12-13 11:26:05,434 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 37 selfloop transitions, 5 changer transitions 25/72 dead transitions. [2022-12-13 11:26:05,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 72 transitions, 302 flow [2022-12-13 11:26:05,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:26:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:26:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 724 transitions. [2022-12-13 11:26:05,436 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4908474576271186 [2022-12-13 11:26:05,436 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 724 transitions. [2022-12-13 11:26:05,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 724 transitions. [2022-12-13 11:26:05,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:26:05,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 724 transitions. [2022-12-13 11:26:05,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:05,441 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-12-13 11:26:05,441 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-12-13 11:26:05,441 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 5 states and 724 transitions. [2022-12-13 11:26:05,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 72 transitions, 302 flow [2022-12-13 11:26:05,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 72 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:26:05,443 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 111 flow [2022-12-13 11:26:05,443 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=5, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-12-13 11:26:05,444 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2022-12-13 11:26:05,444 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 111 flow [2022-12-13 11:26:05,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:05,444 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:26:05,444 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:26:05,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:05,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:05,646 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-12-13 11:26:05,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:26:05,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1492022909, now seen corresponding path program 1 times [2022-12-13 11:26:05,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 11:26:05,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603556833] [2022-12-13 11:26:05,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:26:05,650 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-12-13 11:26:05,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 11:26:05,653 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:05,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:26:05,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 11:26:05,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:26:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:26:05,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:26:05,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 11:26:05,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603556833] [2022-12-13 11:26:05,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603556833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:26:05,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:26:05,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:26:05,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7185866] [2022-12-13 11:26:05,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:26:05,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:26:05,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 11:26:05,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:26:05,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:26:05,836 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2022-12-13 11:26:05,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:05,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:26:05,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2022-12-13 11:26:05,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:26:06,256 INFO L130 PetriNetUnfolder]: 1712/2647 cut-off events. [2022-12-13 11:26:06,257 INFO L131 PetriNetUnfolder]: For 929/929 co-relation queries the response was YES. [2022-12-13 11:26:06,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7070 conditions, 2647 events. 1712/2647 cut-off events. For 929/929 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13938 event pairs, 330 based on Foata normal form. 175/2723 useless extension candidates. Maximal degree in co-relation 7063. Up to 1057 conditions per place. [2022-12-13 11:26:06,265 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 49 selfloop transitions, 9 changer transitions 25/88 dead transitions. [2022-12-13 11:26:06,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 447 flow [2022-12-13 11:26:06,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:26:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:26:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 871 transitions. [2022-12-13 11:26:06,267 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.492090395480226 [2022-12-13 11:26:06,267 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 871 transitions. [2022-12-13 11:26:06,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 871 transitions. [2022-12-13 11:26:06,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:26:06,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 871 transitions. [2022-12-13 11:26:06,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 145.16666666666666) internal successors, (871), 6 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:06,271 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-12-13 11:26:06,271 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-12-13 11:26:06,271 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 111 flow. Second operand 6 states and 871 transitions. [2022-12-13 11:26:06,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 447 flow [2022-12-13 11:26:06,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 88 transitions, 440 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 11:26:06,277 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 176 flow [2022-12-13 11:26:06,277 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=6, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2022-12-13 11:26:06,277 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2022-12-13 11:26:06,278 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 176 flow [2022-12-13 11:26:06,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:06,278 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:26:06,278 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-12-13 11:26:06,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 11:26:06,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:06,480 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-12-13 11:26:06,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:26:06,481 INFO L85 PathProgramCache]: Analyzing trace with hash 596817859, now seen corresponding path program 1 times [2022-12-13 11:26:06,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 11:26:06,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832070031] [2022-12-13 11:26:06,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:26:06,483 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-12-13 11:26:06,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 11:26:06,486 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:06,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:26:06,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 11:26:06,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:26:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:26:06,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:26:06,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 11:26:06,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832070031] [2022-12-13 11:26:06,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832070031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:26:06,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:26:06,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:26:06,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682429080] [2022-12-13 11:26:06,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:26:06,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:26:06,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 11:26:06,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:26:06,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:26:06,711 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2022-12-13 11:26:06,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:06,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:26:06,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2022-12-13 11:26:06,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:26:07,128 INFO L130 PetriNetUnfolder]: 1010/1621 cut-off events. [2022-12-13 11:26:07,128 INFO L131 PetriNetUnfolder]: For 1550/1550 co-relation queries the response was YES. [2022-12-13 11:26:07,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4881 conditions, 1621 events. 1010/1621 cut-off events. For 1550/1550 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8009 event pairs, 276 based on Foata normal form. 67/1651 useless extension candidates. Maximal degree in co-relation 4872. Up to 540 conditions per place. [2022-12-13 11:26:07,133 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 59 selfloop transitions, 13 changer transitions 25/102 dead transitions. [2022-12-13 11:26:07,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 102 transitions, 612 flow [2022-12-13 11:26:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:26:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:26:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1016 transitions. [2022-12-13 11:26:07,136 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4920096852300242 [2022-12-13 11:26:07,136 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1016 transitions. [2022-12-13 11:26:07,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1016 transitions. [2022-12-13 11:26:07,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:26:07,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1016 transitions. [2022-12-13 11:26:07,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.14285714285714) internal successors, (1016), 7 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:07,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:07,144 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 295.0) internal successors, (2360), 8 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:07,144 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 176 flow. Second operand 7 states and 1016 transitions. [2022-12-13 11:26:07,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 102 transitions, 612 flow [2022-12-13 11:26:07,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 102 transitions, 550 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-13 11:26:07,157 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 226 flow [2022-12-13 11:26:07,157 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=7, PETRI_FLOW=226, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2022-12-13 11:26:07,157 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2022-12-13 11:26:07,158 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 226 flow [2022-12-13 11:26:07,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:07,158 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:26:07,158 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-12-13 11:26:07,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 11:26:07,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:07,360 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 11:26:07,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:26:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash 126457355, now seen corresponding path program 1 times [2022-12-13 11:26:07,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 11:26:07,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680905524] [2022-12-13 11:26:07,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:26:07,365 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-12-13 11:26:07,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 11:26:07,366 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:07,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:26:07,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 11:26:07,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:26:07,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:26:07,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:26:07,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 11:26:07,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680905524] [2022-12-13 11:26:07,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680905524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:26:07,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:26:07,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:26:07,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556588221] [2022-12-13 11:26:07,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:26:07,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:26:07,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 11:26:07,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:26:07,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:26:07,633 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2022-12-13 11:26:07,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 133.85714285714286) internal successors, (937), 7 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:07,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:26:07,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2022-12-13 11:26:07,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:26:08,067 INFO L130 PetriNetUnfolder]: 866/1375 cut-off events. [2022-12-13 11:26:08,067 INFO L131 PetriNetUnfolder]: For 1266/1266 co-relation queries the response was YES. [2022-12-13 11:26:08,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3981 conditions, 1375 events. 866/1375 cut-off events. For 1266/1266 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6664 event pairs, 272 based on Foata normal form. 13/1363 useless extension candidates. Maximal degree in co-relation 3971. Up to 540 conditions per place. [2022-12-13 11:26:08,074 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 55 selfloop transitions, 17 changer transitions 13/90 dead transitions. [2022-12-13 11:26:08,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 552 flow [2022-12-13 11:26:08,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:26:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 11:26:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1135 transitions. [2022-12-13 11:26:08,077 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4809322033898305 [2022-12-13 11:26:08,077 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1135 transitions. [2022-12-13 11:26:08,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1135 transitions. [2022-12-13 11:26:08,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:26:08,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1135 transitions. [2022-12-13 11:26:08,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 141.875) internal successors, (1135), 8 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:08,081 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-12-13 11:26:08,081 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-12-13 11:26:08,081 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 226 flow. Second operand 8 states and 1135 transitions. [2022-12-13 11:26:08,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 552 flow [2022-12-13 11:26:08,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 90 transitions, 490 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-12-13 11:26:08,091 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 220 flow [2022-12-13 11:26:08,091 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=8, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2022-12-13 11:26:08,092 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2022-12-13 11:26:08,092 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 220 flow [2022-12-13 11:26:08,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 133.85714285714286) internal successors, (937), 7 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:08,092 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:26:08,092 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-12-13 11:26:08,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:08,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:08,294 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-12-13 11:26:08,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:26:08,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2105038149, now seen corresponding path program 1 times [2022-12-13 11:26:08,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 11:26:08,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125573947] [2022-12-13 11:26:08,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:26:08,296 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-12-13 11:26:08,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 11:26:08,297 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:08,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:26:08,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 11:26:08,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:26:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:26:08,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:26:08,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 11:26:08,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125573947] [2022-12-13 11:26:08,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2125573947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:26:08,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:26:08,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:26:08,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558793613] [2022-12-13 11:26:08,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:26:08,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:26:08,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 11:26:08,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:26:08,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:26:09,165 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 295 [2022-12-13 11:26:09,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:09,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:26:09,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 295 [2022-12-13 11:26:09,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:26:09,596 INFO L130 PetriNetUnfolder]: 855/1428 cut-off events. [2022-12-13 11:26:09,596 INFO L131 PetriNetUnfolder]: For 1653/1653 co-relation queries the response was YES. [2022-12-13 11:26:09,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3981 conditions, 1428 events. 855/1428 cut-off events. For 1653/1653 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7338 event pairs, 28 based on Foata normal form. 0/1428 useless extension candidates. Maximal degree in co-relation 3970. Up to 1043 conditions per place. [2022-12-13 11:26:09,601 INFO L137 encePairwiseOnDemand]: 290/295 looper letters, 57 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2022-12-13 11:26:09,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 473 flow [2022-12-13 11:26:09,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:26:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:26:09,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 744 transitions. [2022-12-13 11:26:09,603 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42033898305084744 [2022-12-13 11:26:09,604 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 744 transitions. [2022-12-13 11:26:09,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 744 transitions. [2022-12-13 11:26:09,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:26:09,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 744 transitions. [2022-12-13 11:26:09,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:09,606 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-12-13 11:26:09,606 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-12-13 11:26:09,607 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 220 flow. Second operand 6 states and 744 transitions. [2022-12-13 11:26:09,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 473 flow [2022-12-13 11:26:09,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 384 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-12-13 11:26:09,611 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 162 flow [2022-12-13 11:26:09,611 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2022-12-13 11:26:09,611 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2022-12-13 11:26:09,611 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 162 flow [2022-12-13 11:26:09,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:09,612 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:26:09,612 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-12-13 11:26:09,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 11:26:09,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:09,813 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-12-13 11:26:09,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:26:09,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1176818199, now seen corresponding path program 1 times [2022-12-13 11:26:09,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 11:26:09,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476157907] [2022-12-13 11:26:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:26:09,815 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-12-13 11:26:09,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 11:26:09,816 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:09,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:26:09,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 11:26:09,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:26:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:26:09,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:26:09,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 11:26:09,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476157907] [2022-12-13 11:26:09,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476157907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:26:09,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:26:09,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:26:09,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246404975] [2022-12-13 11:26:09,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:26:09,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:26:09,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 11:26:09,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:26:09,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:26:09,966 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 295 [2022-12-13 11:26:09,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:09,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:26:09,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 295 [2022-12-13 11:26:09,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:26:10,304 INFO L130 PetriNetUnfolder]: 1263/2026 cut-off events. [2022-12-13 11:26:10,304 INFO L131 PetriNetUnfolder]: For 1191/1191 co-relation queries the response was YES. [2022-12-13 11:26:10,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5363 conditions, 2026 events. 1263/2026 cut-off events. For 1191/1191 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10934 event pairs, 158 based on Foata normal form. 1/2019 useless extension candidates. Maximal degree in co-relation 5355. Up to 1161 conditions per place. [2022-12-13 11:26:10,310 INFO L137 encePairwiseOnDemand]: 292/295 looper letters, 49 selfloop transitions, 1 changer transitions 32/86 dead transitions. [2022-12-13 11:26:10,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 86 transitions, 530 flow [2022-12-13 11:26:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:26:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:26:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 585 transitions. [2022-12-13 11:26:10,312 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4957627118644068 [2022-12-13 11:26:10,312 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 585 transitions. [2022-12-13 11:26:10,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 585 transitions. [2022-12-13 11:26:10,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:26:10,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 585 transitions. [2022-12-13 11:26:10,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:10,314 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-12-13 11:26:10,315 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-12-13 11:26:10,315 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 162 flow. Second operand 4 states and 585 transitions. [2022-12-13 11:26:10,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 86 transitions, 530 flow [2022-12-13 11:26:10,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 86 transitions, 518 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 11:26:10,327 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 162 flow [2022-12-13 11:26:10,327 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2022-12-13 11:26:10,328 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2022-12-13 11:26:10,328 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 162 flow [2022-12-13 11:26:10,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:10,328 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:26:10,328 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-12-13 11:26:10,337 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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)] Forceful destruction successful, exit code 0 [2022-12-13 11:26:10,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:10,529 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-12-13 11:26:10,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:26:10,530 INFO L85 PathProgramCache]: Analyzing trace with hash -537802281, now seen corresponding path program 2 times [2022-12-13 11:26:10,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 11:26:10,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698543008] [2022-12-13 11:26:10,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:26:10,530 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-12-13 11:26:10,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 11:26:10,531 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:10,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:10,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 11:26:10,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:26:10,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 11:26:10,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:26:10,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:26:10,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:26:10,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 11:26:10,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698543008] [2022-12-13 11:26:10,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698543008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:26:10,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:26:10,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:26:10,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355856855] [2022-12-13 11:26:10,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:26:10,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:26:10,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 11:26:10,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:26:10,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:26:10,976 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 295 [2022-12-13 11:26:10,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 162 flow. Second operand has 10 states, 10 states have (on average 133.4) internal successors, (1334), 10 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:10,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:26:10,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 295 [2022-12-13 11:26:10,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:26:11,455 INFO L130 PetriNetUnfolder]: 1584/2617 cut-off events. [2022-12-13 11:26:11,455 INFO L131 PetriNetUnfolder]: For 1899/1899 co-relation queries the response was YES. [2022-12-13 11:26:11,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7074 conditions, 2617 events. 1584/2617 cut-off events. For 1899/1899 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 14412 event pairs, 515 based on Foata normal form. 1/2599 useless extension candidates. Maximal degree in co-relation 7064. Up to 1224 conditions per place. [2022-12-13 11:26:11,464 INFO L137 encePairwiseOnDemand]: 288/295 looper letters, 66 selfloop transitions, 7 changer transitions 13/90 dead transitions. [2022-12-13 11:26:11,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 90 transitions, 549 flow [2022-12-13 11:26:11,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:26:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:26:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2022-12-13 11:26:11,467 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48271186440677966 [2022-12-13 11:26:11,467 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2022-12-13 11:26:11,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2022-12-13 11:26:11,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:26:11,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2022-12-13 11:26:11,470 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-12-13 11:26:11,472 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-12-13 11:26:11,472 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-12-13 11:26:11,473 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 162 flow. Second operand 5 states and 712 transitions. [2022-12-13 11:26:11,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 90 transitions, 549 flow [2022-12-13 11:26:11,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 90 transitions, 545 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 11:26:11,496 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 199 flow [2022-12-13 11:26:11,496 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2022-12-13 11:26:11,497 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2022-12-13 11:26:11,497 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 199 flow [2022-12-13 11:26:11,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.4) internal successors, (1334), 10 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:11,498 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:26:11,498 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-12-13 11:26:11,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 11:26:11,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:11,699 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-12-13 11:26:11,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:26:11,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1604604213, now seen corresponding path program 3 times [2022-12-13 11:26:11,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 11:26:11,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196589800] [2022-12-13 11:26:11,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 11:26:11,700 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-12-13 11:26:11,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 11:26:11,701 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:11,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:11,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 11:26:11,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:26:11,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 11:26:11,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:26:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:26:12,218 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:26:12,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 11:26:12,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196589800] [2022-12-13 11:26:12,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196589800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:26:12,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:26:12,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:26:12,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65228327] [2022-12-13 11:26:12,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:26:12,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:26:12,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 11:26:12,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:26:12,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:26:12,289 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 295 [2022-12-13 11:26:12,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 199 flow. Second operand has 10 states, 10 states have (on average 134.4) internal successors, (1344), 10 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:12,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:26:12,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 295 [2022-12-13 11:26:12,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:26:12,702 INFO L130 PetriNetUnfolder]: 1672/2709 cut-off events. [2022-12-13 11:26:12,703 INFO L131 PetriNetUnfolder]: For 2924/2935 co-relation queries the response was YES. [2022-12-13 11:26:12,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8691 conditions, 2709 events. 1672/2709 cut-off events. For 2924/2935 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14571 event pairs, 458 based on Foata normal form. 6/2700 useless extension candidates. Maximal degree in co-relation 8680. Up to 1180 conditions per place. [2022-12-13 11:26:12,708 INFO L137 encePairwiseOnDemand]: 289/295 looper letters, 67 selfloop transitions, 8 changer transitions 13/92 dead transitions. [2022-12-13 11:26:12,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 92 transitions, 594 flow [2022-12-13 11:26:12,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:26:12,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:26:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2022-12-13 11:26:12,710 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48610169491525423 [2022-12-13 11:26:12,710 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 717 transitions. [2022-12-13 11:26:12,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 717 transitions. [2022-12-13 11:26:12,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:26:12,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 717 transitions. [2022-12-13 11:26:12,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:12,712 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-12-13 11:26:12,712 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-12-13 11:26:12,713 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 199 flow. Second operand 5 states and 717 transitions. [2022-12-13 11:26:12,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 92 transitions, 594 flow [2022-12-13 11:26:12,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:26:12,731 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 228 flow [2022-12-13 11:26:12,732 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2022-12-13 11:26:12,732 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2022-12-13 11:26:12,732 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 228 flow [2022-12-13 11:26:12,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 134.4) internal successors, (1344), 10 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:12,733 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:26:12,733 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-12-13 11:26:12,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 11:26:12,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:12,934 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-12-13 11:26:12,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:26:12,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1333818835, now seen corresponding path program 4 times [2022-12-13 11:26:12,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 11:26:12,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151212695] [2022-12-13 11:26:12,937 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 11:26:12,937 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-12-13 11:26:12,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 11:26:12,940 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:12,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:13,094 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 11:26:13,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:26:13,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 11:26:13,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:26:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:26:13,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:26:13,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 11:26:13,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151212695] [2022-12-13 11:26:13,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151212695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:26:13,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:26:13,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:26:13,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133066496] [2022-12-13 11:26:13,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:26:13,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:26:13,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 11:26:13,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:26:13,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:26:13,132 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 295 [2022-12-13 11:26:13,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:13,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:26:13,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 295 [2022-12-13 11:26:13,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:26:13,567 INFO L130 PetriNetUnfolder]: 2562/4238 cut-off events. [2022-12-13 11:26:13,567 INFO L131 PetriNetUnfolder]: For 5656/5705 co-relation queries the response was YES. [2022-12-13 11:26:13,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14185 conditions, 4238 events. 2562/4238 cut-off events. For 5656/5705 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 25434 event pairs, 442 based on Foata normal form. 49/4268 useless extension candidates. Maximal degree in co-relation 14173. Up to 2051 conditions per place. [2022-12-13 11:26:13,577 INFO L137 encePairwiseOnDemand]: 292/295 looper letters, 68 selfloop transitions, 2 changer transitions 21/96 dead transitions. [2022-12-13 11:26:13,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 96 transitions, 670 flow [2022-12-13 11:26:13,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:26:13,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:26:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2022-12-13 11:26:13,579 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4940677966101695 [2022-12-13 11:26:13,579 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2022-12-13 11:26:13,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2022-12-13 11:26:13,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:26:13,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2022-12-13 11:26:13,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:13,581 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-12-13 11:26:13,582 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-12-13 11:26:13,582 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 228 flow. Second operand 4 states and 583 transitions. [2022-12-13 11:26:13,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 96 transitions, 670 flow [2022-12-13 11:26:13,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 96 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:26:13,629 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 236 flow [2022-12-13 11:26:13,629 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2022-12-13 11:26:13,630 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2022-12-13 11:26:13,630 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 236 flow [2022-12-13 11:26:13,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:13,630 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:26:13,630 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-12-13 11:26:13,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 11:26:13,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:13,832 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-12-13 11:26:13,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:26:13,833 INFO L85 PathProgramCache]: Analyzing trace with hash 775913921, now seen corresponding path program 5 times [2022-12-13 11:26:13,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 11:26:13,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010517609] [2022-12-13 11:26:13,834 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 11:26:13,835 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-12-13 11:26:13,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 11:26:13,838 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:13,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:14,039 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 11:26:14,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:26:14,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 11:26:14,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:26:14,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:26:14,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:26:14,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 11:26:14,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010517609] [2022-12-13 11:26:14,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010517609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:26:14,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:26:14,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:26:14,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572841208] [2022-12-13 11:26:14,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:26:14,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:26:14,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 11:26:14,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:26:14,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:26:14,059 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 295 [2022-12-13 11:26:14,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:14,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:26:14,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 295 [2022-12-13 11:26:14,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:26:14,628 INFO L130 PetriNetUnfolder]: 3940/6375 cut-off events. [2022-12-13 11:26:14,628 INFO L131 PetriNetUnfolder]: For 8647/8751 co-relation queries the response was YES. [2022-12-13 11:26:14,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21919 conditions, 6375 events. 3940/6375 cut-off events. For 8647/8751 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 40266 event pairs, 1287 based on Foata normal form. 79/6379 useless extension candidates. Maximal degree in co-relation 21905. Up to 3092 conditions per place. [2022-12-13 11:26:14,640 INFO L137 encePairwiseOnDemand]: 292/295 looper letters, 43 selfloop transitions, 2 changer transitions 29/79 dead transitions. [2022-12-13 11:26:14,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 551 flow [2022-12-13 11:26:14,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:26:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:26:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-12-13 11:26:14,642 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4994350282485876 [2022-12-13 11:26:14,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-12-13 11:26:14,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-12-13 11:26:14,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:26:14,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-12-13 11:26:14,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:14,643 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-12-13 11:26:14,644 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-12-13 11:26:14,644 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 236 flow. Second operand 3 states and 442 transitions. [2022-12-13 11:26:14,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 551 flow [2022-12-13 11:26:14,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 550 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:26:14,758 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 225 flow [2022-12-13 11:26:14,758 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2022-12-13 11:26:14,758 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2022-12-13 11:26:14,759 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 225 flow [2022-12-13 11:26:14,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:14,759 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:26:14,759 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-12-13 11:26:14,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 11:26:14,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:14,960 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-12-13 11:26:14,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:26:14,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1848645009, now seen corresponding path program 6 times [2022-12-13 11:26:14,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 11:26:14,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448271078] [2022-12-13 11:26:14,964 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 11:26:14,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-12-13 11:26:14,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 11:26:14,968 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:14,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:15,067 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-12-13 11:26:15,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:26:15,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 11:26:15,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:26:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:26:15,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:26:15,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 11:26:15,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448271078] [2022-12-13 11:26:15,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448271078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:26:15,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:26:15,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:26:15,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562338050] [2022-12-13 11:26:15,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:26:15,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:26:15,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 11:26:15,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:26:15,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:26:15,517 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 295 [2022-12-13 11:26:15,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 225 flow. Second operand has 10 states, 10 states have (on average 134.4) internal successors, (1344), 10 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:15,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:26:15,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 295 [2022-12-13 11:26:15,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:26:15,918 INFO L130 PetriNetUnfolder]: 1572/2598 cut-off events. [2022-12-13 11:26:15,918 INFO L131 PetriNetUnfolder]: For 3919/3940 co-relation queries the response was YES. [2022-12-13 11:26:15,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9350 conditions, 2598 events. 1572/2598 cut-off events. For 3919/3940 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 13863 event pairs, 472 based on Foata normal form. 11/2578 useless extension candidates. Maximal degree in co-relation 9335. Up to 1050 conditions per place. [2022-12-13 11:26:15,924 INFO L137 encePairwiseOnDemand]: 290/295 looper letters, 49 selfloop transitions, 3 changer transitions 36/92 dead transitions. [2022-12-13 11:26:15,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 92 transitions, 632 flow [2022-12-13 11:26:15,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:26:15,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:26:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2022-12-13 11:26:15,925 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48610169491525423 [2022-12-13 11:26:15,926 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 717 transitions. [2022-12-13 11:26:15,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 717 transitions. [2022-12-13 11:26:15,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 11:26:15,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 717 transitions. [2022-12-13 11:26:15,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:15,928 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-12-13 11:26:15,928 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-12-13 11:26:15,928 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 225 flow. Second operand 5 states and 717 transitions. [2022-12-13 11:26:15,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 92 transitions, 632 flow [2022-12-13 11:26:15,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 613 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 11:26:15,956 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 191 flow [2022-12-13 11:26:15,956 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=63, PETRI_TRANSITIONS=40} [2022-12-13 11:26:15,956 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2022-12-13 11:26:15,956 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 191 flow [2022-12-13 11:26:15,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 134.4) internal successors, (1344), 10 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:26:15,957 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:26:15,957 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-12-13 11:26:15,969 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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)] Ended with exit code 0 [2022-12-13 11:26:16,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:16,157 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-12-13 11:26:16,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:26:16,158 INFO L85 PathProgramCache]: Analyzing trace with hash 737097733, now seen corresponding path program 7 times [2022-12-13 11:26:16,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 11:26:16,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201327566] [2022-12-13 11:26:16,158 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 11:26:16,158 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-12-13 11:26:16,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 11:26:16,159 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:16,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:26:16,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:26:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:26:16,371 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 11:26:16,371 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:26:16,372 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-12-13 11:26:16,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-12-13 11:26:16,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-12-13 11:26:16,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-12-13 11:26:16,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-12-13 11:26:16,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-12-13 11:26:16,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-12-13 11:26:16,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-12-13 11:26:16,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-12-13 11:26:16,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-12-13 11:26:16,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-12-13 11:26:16,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-12-13 11:26:16,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-12-13 11:26:16,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-12-13 11:26:16,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-12-13 11:26:16,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-12-13 11:26:16,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:16,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/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-12-13 11:26:16,575 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:26:16,580 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:26:16,580 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:26:16,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:26:16 BasicIcfg [2022-12-13 11:26:16,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:26:16,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 11:26:16,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 11:26:16,630 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 11:26:16,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:25:53" (3/4) ... [2022-12-13 11:26:16,632 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 11:26:16,632 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 11:26:16,632 INFO L158 Benchmark]: Toolchain (without parser) took 24645.39ms. Allocated memory was 79.7MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 57.1MB in the beginning and 484.0MB in the end (delta: -426.8MB). Peak memory consumption was 597.6MB. Max. memory is 16.1GB. [2022-12-13 11:26:16,633 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 11:26:16,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.27ms. Allocated memory is still 79.7MB. Free memory was 56.9MB in the beginning and 48.2MB in the end (delta: 8.7MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-12-13 11:26:16,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.71ms. Allocated memory is still 79.7MB. Free memory was 48.2MB in the beginning and 45.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:26:16,633 INFO L158 Benchmark]: Boogie Preprocessor took 24.60ms. Allocated memory is still 79.7MB. Free memory was 45.7MB in the beginning and 43.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:26:16,633 INFO L158 Benchmark]: RCFGBuilder took 622.12ms. Allocated memory is still 79.7MB. Free memory was 43.2MB in the beginning and 49.8MB in the end (delta: -6.6MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2022-12-13 11:26:16,633 INFO L158 Benchmark]: TraceAbstraction took 23551.55ms. Allocated memory was 79.7MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 48.8MB in the beginning and 484.0MB in the end (delta: -435.1MB). Peak memory consumption was 588.2MB. Max. memory is 16.1GB. [2022-12-13 11:26:16,634 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 1.1GB. Free memory is still 484.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 11:26:16,635 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.16ms. Allocated memory is still 58.7MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.27ms. Allocated memory is still 79.7MB. Free memory was 56.9MB in the beginning and 48.2MB in the end (delta: 8.7MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.71ms. Allocated memory is still 79.7MB. Free memory was 48.2MB in the beginning and 45.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.60ms. Allocated memory is still 79.7MB. Free memory was 45.7MB in the beginning and 43.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 622.12ms. Allocated memory is still 79.7MB. Free memory was 43.2MB in the beginning and 49.8MB in the end (delta: -6.6MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23551.55ms. Allocated memory was 79.7MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 48.8MB in the beginning and 484.0MB in the end (delta: -435.1MB). Peak memory consumption was 588.2MB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 1.1GB. Free memory is still 484.0MB. 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: 8.5s, 159 PlacesBefore, 52 PlacesAfterwards, 148 TransitionsBefore, 39 TransitionsAfterwards, 3866 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 143 TotalNumberOfCompositions, 10633 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4515, independent: 4273, independent conditional: 0, independent unconditional: 4273, dependent: 242, dependent conditional: 0, dependent unconditional: 242, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2125, independent: 2071, independent conditional: 0, independent unconditional: 2071, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4515, independent: 2202, independent conditional: 0, independent unconditional: 2202, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 2125, unknown conditional: 0, unknown unconditional: 2125] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 167, Positive conditional cache size: 0, Positive unconditional cache size: 167, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1185, ((void *)0), P0, ((void *)0))=-1, t1185={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] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1186, ((void *)0), P1, ((void *)0))=0, t1185={3:0}, t1186={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] [L860] 0 pthread_t t1187; [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1187, ((void *)0), P2, ((void *)0))=1, t1185={3:0}, t1186={7:0}, t1187={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] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1188, ((void *)0), P3, ((void *)0))=2, t1185={3:0}, t1186={7:0}, t1187={11:0}, t1188={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] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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}, b=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=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}, b=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=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}, b=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=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}, b=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 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) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 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 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 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 [__unbuffered_cnt=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}, b=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L822] 4 z = 2 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L834] 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) [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] 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 [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L788] 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) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 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 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 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_p1_EAX=0, __unbuffered_p3_EAX=1, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] 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 [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] 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_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1185={3:0}, t1186={7:0}, t1187={11:0}, t1188={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: 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: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 857]: 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: 859]: 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, 190 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: 23.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 747 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 631 mSDsluCounter, 282 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 272 mSDsCounter, 227 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2618 IncrementalHoareTripleChecker+Invalid, 2845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 227 mSolverCounterUnsat, 10 mSDtfsCounter, 2618 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=11, InterpolantAutomatonStates: 63, 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.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 257 ConstructedInterpolants, 12 QuantifiedInterpolants, 2988 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2205 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-12-13 11:26:16,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_800329d3-1da8-41b2-bf23-04ab5ebd1b51/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample