./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe027_power.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_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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_48877903-54d8-4de9-b3b4-7692a6266f58/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 a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 --- 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 12:36:02,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:36:02,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:36:02,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:36:02,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:36:02,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:36:02,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:36:02,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:36:02,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:36:02,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:36:02,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:36:02,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:36:02,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:36:02,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:36:02,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:36:02,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:36:02,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:36:02,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:36:02,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:36:02,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:36:02,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:36:02,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:36:02,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:36:02,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:36:02,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:36:02,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:36:02,365 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:36:02,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:36:02,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:36:02,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:36:02,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:36:02,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:36:02,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:36:02,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:36:02,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:36:02,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:36:02,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:36:02,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:36:02,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:36:02,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:36:02,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:36:02,374 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 12:36:02,389 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:36:02,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:36:02,390 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:36:02,390 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:36:02,390 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:36:02,390 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:36:02,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:36:02,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:36:02,391 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:36:02,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:36:02,391 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:36:02,391 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 12:36:02,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:36:02,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:36:02,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:36:02,392 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 12:36:02,392 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 12:36:02,392 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 12:36:02,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:36:02,392 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 12:36:02,392 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:36:02,392 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:36:02,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:36:02,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:36:02,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:36:02,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:36:02,393 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:36:02,393 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:36:02,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:36:02,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:36:02,394 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:36:02,394 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:36:02,394 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:36:02,394 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:36:02,394 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_48877903-54d8-4de9-b3b4-7692a6266f58/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_48877903-54d8-4de9-b3b4-7692a6266f58/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 -> a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 [2022-12-13 12:36:02,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:36:02,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:36:02,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:36:02,586 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:36:02,587 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:36:02,587 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2022-12-13 12:36:05,148 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:36:05,339 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:36:05,340 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2022-12-13 12:36:05,348 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/data/a0d035a0f/9181a8f8556b4c349a04601f9f74eaae/FLAGe97c6607f [2022-12-13 12:36:05,717 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/data/a0d035a0f/9181a8f8556b4c349a04601f9f74eaae [2022-12-13 12:36:05,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:36:05,720 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:36:05,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:36:05,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:36:05,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:36:05,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:36:05" (1/1) ... [2022-12-13 12:36:05,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f9edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:05, skipping insertion in model container [2022-12-13 12:36:05,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:36:05" (1/1) ... [2022-12-13 12:36:05,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:36:05,767 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:36:05,892 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_48877903-54d8-4de9-b3b4-7692a6266f58/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i[995,1008] [2022-12-13 12:36:05,998 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,014 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,015 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,016 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,018 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,019 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,020 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,027 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,032 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:36:06,054 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:36:06,062 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_48877903-54d8-4de9-b3b4-7692a6266f58/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i[995,1008] [2022-12-13 12:36:06,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,092 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:36:06,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:36:06,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:36:06,141 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:36:06,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:06 WrapperNode [2022-12-13 12:36:06,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:36:06,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:36:06,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:36:06,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:36:06,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:06" (1/1) ... [2022-12-13 12:36:06,162 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:06" (1/1) ... [2022-12-13 12:36:06,179 INFO L138 Inliner]: procedures = 177, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 152 [2022-12-13 12:36:06,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:36:06,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:36:06,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:36:06,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:36:06,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:06" (1/1) ... [2022-12-13 12:36:06,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:06" (1/1) ... [2022-12-13 12:36:06,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:06" (1/1) ... [2022-12-13 12:36:06,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:06" (1/1) ... [2022-12-13 12:36:06,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:06" (1/1) ... [2022-12-13 12:36:06,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:06" (1/1) ... [2022-12-13 12:36:06,206 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:06" (1/1) ... [2022-12-13 12:36:06,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:06" (1/1) ... [2022-12-13 12:36:06,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:36:06,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:36:06,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:36:06,213 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:36:06,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:06" (1/1) ... [2022-12-13 12:36:06,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:36:06,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:36:06,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:36:06,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:36:06,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:36:06,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:36:06,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:36:06,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:36:06,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:36:06,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:36:06,284 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:36:06,284 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:36:06,285 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:36:06,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:36:06,285 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:36:06,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:36:06,285 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 12:36:06,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 12:36:06,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:36:06,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:36:06,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:36:06,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:36:06,286 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 12:36:06,399 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:36:06,400 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:36:06,799 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:36:07,238 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:36:07,238 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:36:07,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:36:07 BoogieIcfgContainer [2022-12-13 12:36:07,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:36:07,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:36:07,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:36:07,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:36:07,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:36:05" (1/3) ... [2022-12-13 12:36:07,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f52009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:36:07, skipping insertion in model container [2022-12-13 12:36:07,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:36:06" (2/3) ... [2022-12-13 12:36:07,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f52009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:36:07, skipping insertion in model container [2022-12-13 12:36:07,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:36:07" (3/3) ... [2022-12-13 12:36:07,258 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.oepc.i [2022-12-13 12:36:07,272 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:36:07,273 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2022-12-13 12:36:07,273 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:36:07,373 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:36:07,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 202 transitions, 424 flow [2022-12-13 12:36:07,475 INFO L130 PetriNetUnfolder]: 2/198 cut-off events. [2022-12-13 12:36:07,475 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:36:07,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 198 events. 2/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 283 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-12-13 12:36:07,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 202 transitions, 424 flow [2022-12-13 12:36:07,487 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 198 transitions, 408 flow [2022-12-13 12:36:07,490 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 12:36:07,500 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 198 transitions, 408 flow [2022-12-13 12:36:07,502 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 198 transitions, 408 flow [2022-12-13 12:36:07,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 198 transitions, 408 flow [2022-12-13 12:36:07,545 INFO L130 PetriNetUnfolder]: 2/198 cut-off events. [2022-12-13 12:36:07,546 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:36:07,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 198 events. 2/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 286 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-12-13 12:36:07,552 INFO L119 LiptonReduction]: Number of co-enabled transitions 8980 [2022-12-13 12:36:22,568 INFO L134 LiptonReduction]: Checked pairs total: 37646 [2022-12-13 12:36:22,568 INFO L136 LiptonReduction]: Total number of compositions: 167 [2022-12-13 12:36:22,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:36:22,589 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;@b3a00fc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:36:22,589 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2022-12-13 12:36:22,590 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 12:36:22,591 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:36:22,591 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:22,591 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 12:36:22,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:36:22,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:22,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1178, now seen corresponding path program 1 times [2022-12-13 12:36:22,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:36:22,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846127868] [2022-12-13 12:36:22,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:22,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:36:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:22,681 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 12:36:22,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:36:22,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846127868] [2022-12-13 12:36:22,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846127868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:22,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:22,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 12:36:22,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019193112] [2022-12-13 12:36:22,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:22,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:36:22,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:36:22,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:36:22,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:36:22,706 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 369 [2022-12-13 12:36:22,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 174 flow. Second operand has 2 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:22,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:22,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 369 [2022-12-13 12:36:22,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:30,702 INFO L130 PetriNetUnfolder]: 45876/60608 cut-off events. [2022-12-13 12:36:30,702 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-13 12:36:30,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121438 conditions, 60608 events. 45876/60608 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 2828. Compared 348752 event pairs, 45876 based on Foata normal form. 0/33987 useless extension candidates. Maximal degree in co-relation 121426. Up to 60603 conditions per place. [2022-12-13 12:36:30,979 INFO L137 encePairwiseOnDemand]: 336/369 looper letters, 45 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2022-12-13 12:36:30,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 196 flow [2022-12-13 12:36:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:36:30,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:36:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 382 transitions. [2022-12-13 12:36:30,993 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5176151761517616 [2022-12-13 12:36:30,993 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 382 transitions. [2022-12-13 12:36:30,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 382 transitions. [2022-12-13 12:36:30,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:30,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 382 transitions. [2022-12-13 12:36:31,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 191.0) internal successors, (382), 2 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:31,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 369.0) internal successors, (1107), 3 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:31,008 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 369.0) internal successors, (1107), 3 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:31,009 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 174 flow. Second operand 2 states and 382 transitions. [2022-12-13 12:36:31,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 196 flow [2022-12-13 12:36:31,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:36:31,017 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 102 flow [2022-12-13 12:36:31,019 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2022-12-13 12:36:31,021 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -36 predicate places. [2022-12-13 12:36:31,021 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 102 flow [2022-12-13 12:36:31,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:31,022 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:31,022 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 12:36:31,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:36:31,022 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:36:31,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:31,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1162521, now seen corresponding path program 1 times [2022-12-13 12:36:31,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:36:31,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670735255] [2022-12-13 12:36:31,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:31,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:36:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:31,238 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 12:36:31,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:36:31,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670735255] [2022-12-13 12:36:31,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670735255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:31,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:31,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:36:31,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569116212] [2022-12-13 12:36:31,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:31,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:36:31,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:36:31,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:36:31,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:36:31,274 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 369 [2022-12-13 12:36:31,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:31,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:31,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 369 [2022-12-13 12:36:31,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:35,167 INFO L130 PetriNetUnfolder]: 18111/24221 cut-off events. [2022-12-13 12:36:35,168 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:36:35,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48594 conditions, 24221 events. 18111/24221 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1093. Compared 127624 event pairs, 18111 based on Foata normal form. 0/16442 useless extension candidates. Maximal degree in co-relation 48591. Up to 24216 conditions per place. [2022-12-13 12:36:35,263 INFO L137 encePairwiseOnDemand]: 361/369 looper letters, 37 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2022-12-13 12:36:35,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 40 transitions, 164 flow [2022-12-13 12:36:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:36:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:36:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2022-12-13 12:36:35,266 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2022-12-13 12:36:35,267 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2022-12-13 12:36:35,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2022-12-13 12:36:35,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:35,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2022-12-13 12:36:35,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:35,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:35,274 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:35,274 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 102 flow. Second operand 3 states and 495 transitions. [2022-12-13 12:36:35,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 40 transitions, 164 flow [2022-12-13 12:36:35,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:36:35,275 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 90 flow [2022-12-13 12:36:35,276 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=3, PETRI_FLOW=90, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2022-12-13 12:36:35,276 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -41 predicate places. [2022-12-13 12:36:35,276 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 90 flow [2022-12-13 12:36:35,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:35,277 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:35,277 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 12:36:35,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:36:35,277 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:36:35,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:35,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1162520, now seen corresponding path program 1 times [2022-12-13 12:36:35,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:36:35,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124537280] [2022-12-13 12:36:35,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:35,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:36:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:35,356 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 12:36:35,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:36:35,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124537280] [2022-12-13 12:36:35,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124537280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:35,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:35,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:36:35,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681276257] [2022-12-13 12:36:35,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:35,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:36:35,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:36:35,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:36:35,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:36:35,392 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 369 [2022-12-13 12:36:35,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:35,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:35,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 369 [2022-12-13 12:36:35,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:37,782 INFO L130 PetriNetUnfolder]: 12669/17843 cut-off events. [2022-12-13 12:36:37,782 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:36:37,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35605 conditions, 17843 events. 12669/17843 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 104060 event pairs, 7057 based on Foata normal form. 0/14797 useless extension candidates. Maximal degree in co-relation 35601. Up to 9533 conditions per place. [2022-12-13 12:36:37,841 INFO L137 encePairwiseOnDemand]: 352/369 looper letters, 40 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2022-12-13 12:36:37,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 214 flow [2022-12-13 12:36:37,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:36:37,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:36:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2022-12-13 12:36:37,843 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 12:36:37,843 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2022-12-13 12:36:37,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2022-12-13 12:36:37,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:37,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2022-12-13 12:36:37,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:37,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:37,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:37,847 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 90 flow. Second operand 3 states and 492 transitions. [2022-12-13 12:36:37,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 214 flow [2022-12-13 12:36:37,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:36:37,848 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 167 flow [2022-12-13 12:36:37,848 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2022-12-13 12:36:37,849 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -40 predicate places. [2022-12-13 12:36:37,849 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 167 flow [2022-12-13 12:36:37,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:37,849 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:37,849 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:36:37,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:36:37,849 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:36:37,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:37,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1798830085, now seen corresponding path program 1 times [2022-12-13 12:36:37,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:36:37,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395754686] [2022-12-13 12:36:37,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:37,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:36:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:37,944 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 12:36:37,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:36:37,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395754686] [2022-12-13 12:36:37,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395754686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:37,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:37,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:36:37,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815784807] [2022-12-13 12:36:37,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:37,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:36:37,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:36:37,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:36:37,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:36:37,948 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 369 [2022-12-13 12:36:37,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:37,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:37,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 369 [2022-12-13 12:36:37,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:40,455 INFO L130 PetriNetUnfolder]: 12365/18072 cut-off events. [2022-12-13 12:36:40,455 INFO L131 PetriNetUnfolder]: For 4429/4429 co-relation queries the response was YES. [2022-12-13 12:36:40,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47277 conditions, 18072 events. 12365/18072 cut-off events. For 4429/4429 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 113624 event pairs, 4720 based on Foata normal form. 0/16668 useless extension candidates. Maximal degree in co-relation 47272. Up to 10827 conditions per place. [2022-12-13 12:36:40,539 INFO L137 encePairwiseOnDemand]: 365/369 looper letters, 77 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2022-12-13 12:36:40,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 459 flow [2022-12-13 12:36:40,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:36:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:36:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2022-12-13 12:36:40,541 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46973803071364045 [2022-12-13 12:36:40,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2022-12-13 12:36:40,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2022-12-13 12:36:40,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:40,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2022-12-13 12:36:40,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:40,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:40,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:40,544 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 167 flow. Second operand 3 states and 520 transitions. [2022-12-13 12:36:40,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 459 flow [2022-12-13 12:36:40,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 423 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:36:40,571 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 160 flow [2022-12-13 12:36:40,571 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2022-12-13 12:36:40,571 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -39 predicate places. [2022-12-13 12:36:40,571 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 160 flow [2022-12-13 12:36:40,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:40,572 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:40,572 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:36:40,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:36:40,572 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:36:40,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:40,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1798829810, now seen corresponding path program 1 times [2022-12-13 12:36:40,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:36:40,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906112851] [2022-12-13 12:36:40,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:40,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:36:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:36:40,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:36:40,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906112851] [2022-12-13 12:36:40,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906112851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:40,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:40,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:36:40,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761268443] [2022-12-13 12:36:40,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:40,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:36:40,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:36:40,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:36:40,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:36:40,755 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 369 [2022-12-13 12:36:40,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:40,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:40,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 369 [2022-12-13 12:36:40,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:43,098 INFO L130 PetriNetUnfolder]: 12213/17824 cut-off events. [2022-12-13 12:36:43,098 INFO L131 PetriNetUnfolder]: For 3091/3091 co-relation queries the response was YES. [2022-12-13 12:36:43,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46075 conditions, 17824 events. 12213/17824 cut-off events. For 3091/3091 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 111738 event pairs, 4664 based on Foata normal form. 0/15544 useless extension candidates. Maximal degree in co-relation 46069. Up to 10779 conditions per place. [2022-12-13 12:36:43,176 INFO L137 encePairwiseOnDemand]: 366/369 looper letters, 76 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2022-12-13 12:36:43,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 81 transitions, 432 flow [2022-12-13 12:36:43,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:36:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:36:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2022-12-13 12:36:43,178 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4706413730803975 [2022-12-13 12:36:43,178 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2022-12-13 12:36:43,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2022-12-13 12:36:43,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:43,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2022-12-13 12:36:43,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:43,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:43,182 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:43,182 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 160 flow. Second operand 3 states and 521 transitions. [2022-12-13 12:36:43,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 81 transitions, 432 flow [2022-12-13 12:36:43,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:36:43,186 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 165 flow [2022-12-13 12:36:43,186 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2022-12-13 12:36:43,186 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -38 predicate places. [2022-12-13 12:36:43,187 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 165 flow [2022-12-13 12:36:43,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:43,187 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:43,187 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:36:43,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:36:43,187 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:36:43,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:43,188 INFO L85 PathProgramCache]: Analyzing trace with hash 70849812, now seen corresponding path program 1 times [2022-12-13 12:36:43,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:36:43,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456235851] [2022-12-13 12:36:43,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:43,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:36:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:43,658 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 12:36:43,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:36:43,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456235851] [2022-12-13 12:36:43,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456235851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:43,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:43,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:36:43,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729596804] [2022-12-13 12:36:43,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:43,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:36:43,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:36:43,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:36:43,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:36:43,741 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 369 [2022-12-13 12:36:43,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 165 flow. Second operand has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:43,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:43,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 369 [2022-12-13 12:36:43,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:46,123 INFO L130 PetriNetUnfolder]: 11957/16890 cut-off events. [2022-12-13 12:36:46,123 INFO L131 PetriNetUnfolder]: For 2953/2953 co-relation queries the response was YES. [2022-12-13 12:36:46,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45827 conditions, 16890 events. 11957/16890 cut-off events. For 2953/2953 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 98387 event pairs, 8466 based on Foata normal form. 0/14802 useless extension candidates. Maximal degree in co-relation 45820. Up to 10426 conditions per place. [2022-12-13 12:36:46,184 INFO L137 encePairwiseOnDemand]: 366/369 looper letters, 75 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2022-12-13 12:36:46,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 80 transitions, 431 flow [2022-12-13 12:36:46,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:36:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:36:46,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 656 transitions. [2022-12-13 12:36:46,188 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 12:36:46,188 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 656 transitions. [2022-12-13 12:36:46,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 656 transitions. [2022-12-13 12:36:46,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:46,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 656 transitions. [2022-12-13 12:36:46,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:46,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:46,192 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:46,192 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 165 flow. Second operand 4 states and 656 transitions. [2022-12-13 12:36:46,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 80 transitions, 431 flow [2022-12-13 12:36:46,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 80 transitions, 425 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:36:46,194 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 161 flow [2022-12-13 12:36:46,194 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-12-13 12:36:46,195 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -38 predicate places. [2022-12-13 12:36:46,195 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 161 flow [2022-12-13 12:36:46,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:46,195 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:46,196 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:36:46,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:36:46,196 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:36:46,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:46,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1253016401, now seen corresponding path program 1 times [2022-12-13 12:36:46,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:36:46,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723930839] [2022-12-13 12:36:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:46,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:36:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:46,435 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 12:36:46,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:36:46,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723930839] [2022-12-13 12:36:46,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723930839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:46,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:46,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:36:46,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004153916] [2022-12-13 12:36:46,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:46,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:36:46,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:36:46,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:36:46,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:36:46,507 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 369 [2022-12-13 12:36:46,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 161 flow. Second operand has 6 states, 6 states have (on average 142.33333333333334) internal successors, (854), 6 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:46,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:46,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 369 [2022-12-13 12:36:46,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:48,886 INFO L130 PetriNetUnfolder]: 11701/17120 cut-off events. [2022-12-13 12:36:48,886 INFO L131 PetriNetUnfolder]: For 2995/2995 co-relation queries the response was YES. [2022-12-13 12:36:48,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45537 conditions, 17120 events. 11701/17120 cut-off events. For 2995/2995 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 106987 event pairs, 4043 based on Foata normal form. 96/15128 useless extension candidates. Maximal degree in co-relation 45530. Up to 6281 conditions per place. [2022-12-13 12:36:48,953 INFO L137 encePairwiseOnDemand]: 358/369 looper letters, 72 selfloop transitions, 11 changer transitions 0/85 dead transitions. [2022-12-13 12:36:48,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 85 transitions, 449 flow [2022-12-13 12:36:48,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:36:48,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:36:48,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 776 transitions. [2022-12-13 12:36:48,956 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4205962059620596 [2022-12-13 12:36:48,956 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 776 transitions. [2022-12-13 12:36:48,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 776 transitions. [2022-12-13 12:36:48,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:48,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 776 transitions. [2022-12-13 12:36:48,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.2) internal successors, (776), 5 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:48,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 369.0) internal successors, (2214), 6 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:48,960 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 369.0) internal successors, (2214), 6 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:48,960 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 161 flow. Second operand 5 states and 776 transitions. [2022-12-13 12:36:48,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 85 transitions, 449 flow [2022-12-13 12:36:48,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 85 transitions, 442 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:36:48,962 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 238 flow [2022-12-13 12:36:48,962 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2022-12-13 12:36:48,962 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -36 predicate places. [2022-12-13 12:36:48,963 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 238 flow [2022-12-13 12:36:48,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.33333333333334) internal successors, (854), 6 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:48,963 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:48,963 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:36:48,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:36:48,963 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:36:48,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash 70850087, now seen corresponding path program 1 times [2022-12-13 12:36:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:36:48,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597368036] [2022-12-13 12:36:48,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:48,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:36:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:49,109 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 12:36:49,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:36:49,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597368036] [2022-12-13 12:36:49,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597368036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:49,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:49,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:36:49,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578626661] [2022-12-13 12:36:49,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:49,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:36:49,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:36:49,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:36:49,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:36:49,114 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 369 [2022-12-13 12:36:49,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:49,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:49,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 369 [2022-12-13 12:36:49,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:51,464 INFO L130 PetriNetUnfolder]: 11631/16415 cut-off events. [2022-12-13 12:36:51,464 INFO L131 PetriNetUnfolder]: For 11823/11823 co-relation queries the response was YES. [2022-12-13 12:36:51,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48705 conditions, 16415 events. 11631/16415 cut-off events. For 11823/11823 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 99021 event pairs, 2195 based on Foata normal form. 24/15370 useless extension candidates. Maximal degree in co-relation 48697. Up to 13649 conditions per place. [2022-12-13 12:36:51,536 INFO L137 encePairwiseOnDemand]: 366/369 looper letters, 84 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2022-12-13 12:36:51,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 88 transitions, 588 flow [2022-12-13 12:36:51,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:36:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:36:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2022-12-13 12:36:51,538 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45799457994579945 [2022-12-13 12:36:51,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 507 transitions. [2022-12-13 12:36:51,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions. [2022-12-13 12:36:51,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:51,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions. [2022-12-13 12:36:51,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:51,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:51,541 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:51,541 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 238 flow. Second operand 3 states and 507 transitions. [2022-12-13 12:36:51,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 88 transitions, 588 flow [2022-12-13 12:36:51,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 88 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:36:51,631 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 242 flow [2022-12-13 12:36:51,631 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2022-12-13 12:36:51,632 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -35 predicate places. [2022-12-13 12:36:51,632 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 242 flow [2022-12-13 12:36:51,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:51,632 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:51,632 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:36:51,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:36:51,632 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:36:51,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:51,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1451844051, now seen corresponding path program 1 times [2022-12-13 12:36:51,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:36:51,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285338823] [2022-12-13 12:36:51,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:51,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:36:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:51,798 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 12:36:51,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:36:51,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285338823] [2022-12-13 12:36:51,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285338823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:51,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:51,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:36:51,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80535132] [2022-12-13 12:36:51,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:51,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:36:51,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:36:51,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:36:51,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:36:51,806 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 369 [2022-12-13 12:36:51,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:51,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:51,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 369 [2022-12-13 12:36:51,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:55,378 INFO L130 PetriNetUnfolder]: 17068/24270 cut-off events. [2022-12-13 12:36:55,378 INFO L131 PetriNetUnfolder]: For 20853/20853 co-relation queries the response was YES. [2022-12-13 12:36:55,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74944 conditions, 24270 events. 17068/24270 cut-off events. For 20853/20853 co-relation queries the response was YES. Maximal size of possible extension queue 1444. Compared 161272 event pairs, 2446 based on Foata normal form. 72/22697 useless extension candidates. Maximal degree in co-relation 74935. Up to 11078 conditions per place. [2022-12-13 12:36:55,492 INFO L137 encePairwiseOnDemand]: 365/369 looper letters, 130 selfloop transitions, 3 changer transitions 0/135 dead transitions. [2022-12-13 12:36:55,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 135 transitions, 915 flow [2022-12-13 12:36:55,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:36:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:36:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 679 transitions. [2022-12-13 12:36:55,495 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4600271002710027 [2022-12-13 12:36:55,495 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 679 transitions. [2022-12-13 12:36:55,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 679 transitions. [2022-12-13 12:36:55,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:55,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 679 transitions. [2022-12-13 12:36:55,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.75) internal successors, (679), 4 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 12:36:55,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:55,498 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:55,498 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 242 flow. Second operand 4 states and 679 transitions. [2022-12-13 12:36:55,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 135 transitions, 915 flow [2022-12-13 12:36:55,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 135 transitions, 909 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:36:55,610 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 257 flow [2022-12-13 12:36:55,610 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=257, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2022-12-13 12:36:55,610 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -32 predicate places. [2022-12-13 12:36:55,611 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 257 flow [2022-12-13 12:36:55,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:55,611 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:55,611 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:36:55,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:36:55,611 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:36:55,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:55,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2098590635, now seen corresponding path program 1 times [2022-12-13 12:36:55,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:36:55,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943356833] [2022-12-13 12:36:55,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:55,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:36:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:36:55,706 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 12:36:55,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:36:55,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943356833] [2022-12-13 12:36:55,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943356833] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:36:55,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:36:55,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:36:55,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587558919] [2022-12-13 12:36:55,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:36:55,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:36:55,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:36:55,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:36:55,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:36:55,764 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 369 [2022-12-13 12:36:55,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 257 flow. Second operand has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:55,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:36:55,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 369 [2022-12-13 12:36:55,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:36:59,074 INFO L130 PetriNetUnfolder]: 15148/21677 cut-off events. [2022-12-13 12:36:59,074 INFO L131 PetriNetUnfolder]: For 15077/15077 co-relation queries the response was YES. [2022-12-13 12:36:59,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70025 conditions, 21677 events. 15148/21677 cut-off events. For 15077/15077 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 134669 event pairs, 5171 based on Foata normal form. 240/20364 useless extension candidates. Maximal degree in co-relation 70014. Up to 9761 conditions per place. [2022-12-13 12:36:59,174 INFO L137 encePairwiseOnDemand]: 355/369 looper letters, 59 selfloop transitions, 17 changer transitions 0/78 dead transitions. [2022-12-13 12:36:59,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 529 flow [2022-12-13 12:36:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:36:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:36:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 626 transitions. [2022-12-13 12:36:59,176 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4241192411924119 [2022-12-13 12:36:59,176 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 626 transitions. [2022-12-13 12:36:59,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 626 transitions. [2022-12-13 12:36:59,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:36:59,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 626 transitions. [2022-12-13 12:36:59,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.5) internal successors, (626), 4 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:59,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:59,179 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:59,179 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 257 flow. Second operand 4 states and 626 transitions. [2022-12-13 12:36:59,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 529 flow [2022-12-13 12:36:59,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:36:59,311 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 382 flow [2022-12-13 12:36:59,312 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=382, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2022-12-13 12:36:59,312 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -29 predicate places. [2022-12-13 12:36:59,312 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 382 flow [2022-12-13 12:36:59,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:36:59,312 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:36:59,312 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 12:36:59,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:36:59,313 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:36:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:36:59,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1772403474, now seen corresponding path program 1 times [2022-12-13 12:36:59,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:36:59,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037006450] [2022-12-13 12:36:59,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:36:59,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:36:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:00,997 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 12:37:00,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:37:00,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037006450] [2022-12-13 12:37:00,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037006450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:37:00,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:37:00,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 12:37:00,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618701587] [2022-12-13 12:37:00,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:37:00,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 12:37:00,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:37:00,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 12:37:00,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:37:01,393 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 369 [2022-12-13 12:37:01,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 60 transitions, 382 flow. Second operand has 10 states, 10 states have (on average 126.7) internal successors, (1267), 10 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:01,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:01,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 369 [2022-12-13 12:37:01,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:05,798 INFO L130 PetriNetUnfolder]: 17332/24776 cut-off events. [2022-12-13 12:37:05,798 INFO L131 PetriNetUnfolder]: For 25480/25480 co-relation queries the response was YES. [2022-12-13 12:37:05,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89039 conditions, 24776 events. 17332/24776 cut-off events. For 25480/25480 co-relation queries the response was YES. Maximal size of possible extension queue 1521. Compared 156809 event pairs, 7565 based on Foata normal form. 72/23164 useless extension candidates. Maximal degree in co-relation 89027. Up to 21896 conditions per place. [2022-12-13 12:37:05,908 INFO L137 encePairwiseOnDemand]: 355/369 looper letters, 123 selfloop transitions, 31 changer transitions 0/155 dead transitions. [2022-12-13 12:37:05,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 155 transitions, 1139 flow [2022-12-13 12:37:05,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 12:37:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 12:37:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1873 transitions. [2022-12-13 12:37:05,912 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.36256291134339913 [2022-12-13 12:37:05,912 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1873 transitions. [2022-12-13 12:37:05,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1873 transitions. [2022-12-13 12:37:05,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:05,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1873 transitions. [2022-12-13 12:37:05,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 133.78571428571428) internal successors, (1873), 14 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:05,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 369.0) internal successors, (5535), 15 states have internal predecessors, (5535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:05,921 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 369.0) internal successors, (5535), 15 states have internal predecessors, (5535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:05,921 INFO L175 Difference]: Start difference. First operand has 64 places, 60 transitions, 382 flow. Second operand 14 states and 1873 transitions. [2022-12-13 12:37:05,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 155 transitions, 1139 flow [2022-12-13 12:37:06,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 155 transitions, 1133 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:37:06,098 INFO L231 Difference]: Finished difference. Result has 84 places, 89 transitions, 722 flow [2022-12-13 12:37:06,098 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=722, PETRI_PLACES=84, PETRI_TRANSITIONS=89} [2022-12-13 12:37:06,098 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -9 predicate places. [2022-12-13 12:37:06,098 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 89 transitions, 722 flow [2022-12-13 12:37:06,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 126.7) internal successors, (1267), 10 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:06,099 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:06,099 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 12:37:06,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:37:06,099 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:37:06,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:06,100 INFO L85 PathProgramCache]: Analyzing trace with hash -611044048, now seen corresponding path program 2 times [2022-12-13 12:37:06,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:37:06,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625859349] [2022-12-13 12:37:06,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:06,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:37:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:07,492 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 12:37:07,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:37:07,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625859349] [2022-12-13 12:37:07,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625859349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:37:07,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:37:07,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 12:37:07,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573153675] [2022-12-13 12:37:07,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:37:07,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 12:37:07,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:37:07,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 12:37:07,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:37:07,773 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 369 [2022-12-13 12:37:07,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 89 transitions, 722 flow. Second operand has 11 states, 11 states have (on average 130.54545454545453) internal successors, (1436), 11 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:07,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:07,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 369 [2022-12-13 12:37:07,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:12,263 INFO L130 PetriNetUnfolder]: 19630/28047 cut-off events. [2022-12-13 12:37:12,263 INFO L131 PetriNetUnfolder]: For 43874/43874 co-relation queries the response was YES. [2022-12-13 12:37:12,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110350 conditions, 28047 events. 19630/28047 cut-off events. For 43874/43874 co-relation queries the response was YES. Maximal size of possible extension queue 1776. Compared 181513 event pairs, 2956 based on Foata normal form. 132/26283 useless extension candidates. Maximal degree in co-relation 110329. Up to 22348 conditions per place. [2022-12-13 12:37:12,442 INFO L137 encePairwiseOnDemand]: 355/369 looper letters, 122 selfloop transitions, 53 changer transitions 0/176 dead transitions. [2022-12-13 12:37:12,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 176 transitions, 1560 flow [2022-12-13 12:37:12,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:37:12,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 12:37:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1792 transitions. [2022-12-13 12:37:12,446 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37356681259120283 [2022-12-13 12:37:12,446 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1792 transitions. [2022-12-13 12:37:12,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1792 transitions. [2022-12-13 12:37:12,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:12,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1792 transitions. [2022-12-13 12:37:12,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 137.84615384615384) internal successors, (1792), 13 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:12,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 369.0) internal successors, (5166), 14 states have internal predecessors, (5166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:12,454 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 369.0) internal successors, (5166), 14 states have internal predecessors, (5166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:12,454 INFO L175 Difference]: Start difference. First operand has 84 places, 89 transitions, 722 flow. Second operand 13 states and 1792 transitions. [2022-12-13 12:37:12,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 176 transitions, 1560 flow [2022-12-13 12:37:13,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 176 transitions, 1552 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-13 12:37:13,565 INFO L231 Difference]: Finished difference. Result has 102 places, 116 transitions, 1173 flow [2022-12-13 12:37:13,565 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1173, PETRI_PLACES=102, PETRI_TRANSITIONS=116} [2022-12-13 12:37:13,565 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, 9 predicate places. [2022-12-13 12:37:13,566 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 116 transitions, 1173 flow [2022-12-13 12:37:13,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 130.54545454545453) internal successors, (1436), 11 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:13,566 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:13,566 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 12:37:13,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:37:13,566 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:37:13,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:13,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1409442728, now seen corresponding path program 3 times [2022-12-13 12:37:13,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:37:13,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174881553] [2022-12-13 12:37:13,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:13,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:37:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:14,513 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 12:37:14,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:37:14,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174881553] [2022-12-13 12:37:14,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174881553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:37:14,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:37:14,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 12:37:14,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160371455] [2022-12-13 12:37:14,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:37:14,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 12:37:14,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:37:14,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 12:37:14,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-12-13 12:37:14,747 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 369 [2022-12-13 12:37:14,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 116 transitions, 1173 flow. Second operand has 10 states, 10 states have (on average 129.7) internal successors, (1297), 10 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:14,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:14,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 369 [2022-12-13 12:37:14,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:19,570 INFO L130 PetriNetUnfolder]: 19598/28074 cut-off events. [2022-12-13 12:37:19,570 INFO L131 PetriNetUnfolder]: For 62645/62645 co-relation queries the response was YES. [2022-12-13 12:37:19,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120020 conditions, 28074 events. 19598/28074 cut-off events. For 62645/62645 co-relation queries the response was YES. Maximal size of possible extension queue 1776. Compared 182775 event pairs, 2274 based on Foata normal form. 12/26190 useless extension candidates. Maximal degree in co-relation 119992. Up to 18653 conditions per place. [2022-12-13 12:37:19,761 INFO L137 encePairwiseOnDemand]: 358/369 looper letters, 145 selfloop transitions, 71 changer transitions 0/217 dead transitions. [2022-12-13 12:37:19,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 217 transitions, 2220 flow [2022-12-13 12:37:19,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 12:37:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 12:37:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1787 transitions. [2022-12-13 12:37:19,765 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.372524494475714 [2022-12-13 12:37:19,765 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1787 transitions. [2022-12-13 12:37:19,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1787 transitions. [2022-12-13 12:37:19,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:19,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1787 transitions. [2022-12-13 12:37:19,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 137.46153846153845) internal successors, (1787), 13 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:19,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 369.0) internal successors, (5166), 14 states have internal predecessors, (5166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:19,773 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 369.0) internal successors, (5166), 14 states have internal predecessors, (5166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:19,773 INFO L175 Difference]: Start difference. First operand has 102 places, 116 transitions, 1173 flow. Second operand 13 states and 1787 transitions. [2022-12-13 12:37:19,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 217 transitions, 2220 flow [2022-12-13 12:37:21,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 217 transitions, 2174 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-13 12:37:21,330 INFO L231 Difference]: Finished difference. Result has 116 places, 138 transitions, 1616 flow [2022-12-13 12:37:21,331 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1616, PETRI_PLACES=116, PETRI_TRANSITIONS=138} [2022-12-13 12:37:21,331 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, 23 predicate places. [2022-12-13 12:37:21,331 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 138 transitions, 1616 flow [2022-12-13 12:37:21,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 129.7) internal successors, (1297), 10 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:21,332 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:21,332 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 12:37:21,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:37:21,332 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:37:21,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:21,333 INFO L85 PathProgramCache]: Analyzing trace with hash -631797869, now seen corresponding path program 1 times [2022-12-13 12:37:21,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:37:21,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957269119] [2022-12-13 12:37:21,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:21,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:37:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:21,460 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 12:37:21,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:37:21,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957269119] [2022-12-13 12:37:21,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957269119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:37:21,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:37:21,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:37:21,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460883641] [2022-12-13 12:37:21,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:37:21,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:37:21,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:37:21,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:37:21,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:37:21,573 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 369 [2022-12-13 12:37:21,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 138 transitions, 1616 flow. Second operand has 7 states, 7 states have (on average 141.28571428571428) internal successors, (989), 7 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:21,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:21,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 369 [2022-12-13 12:37:21,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:25,767 INFO L130 PetriNetUnfolder]: 17156/24520 cut-off events. [2022-12-13 12:37:25,767 INFO L131 PetriNetUnfolder]: For 74852/74852 co-relation queries the response was YES. [2022-12-13 12:37:25,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113405 conditions, 24520 events. 17156/24520 cut-off events. For 74852/74852 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 155130 event pairs, 5506 based on Foata normal form. 332/23088 useless extension candidates. Maximal degree in co-relation 113372. Up to 9455 conditions per place. [2022-12-13 12:37:25,951 INFO L137 encePairwiseOnDemand]: 354/369 looper letters, 132 selfloop transitions, 49 changer transitions 2/185 dead transitions. [2022-12-13 12:37:25,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 185 transitions, 2350 flow [2022-12-13 12:37:25,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:37:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:37:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 907 transitions. [2022-12-13 12:37:25,953 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40966576332429994 [2022-12-13 12:37:25,953 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 907 transitions. [2022-12-13 12:37:25,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 907 transitions. [2022-12-13 12:37:25,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:25,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 907 transitions. [2022-12-13 12:37:25,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 151.16666666666666) internal successors, (907), 6 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:25,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:25,957 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:25,958 INFO L175 Difference]: Start difference. First operand has 116 places, 138 transitions, 1616 flow. Second operand 6 states and 907 transitions. [2022-12-13 12:37:25,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 185 transitions, 2350 flow [2022-12-13 12:37:27,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 185 transitions, 2296 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-12-13 12:37:27,147 INFO L231 Difference]: Finished difference. Result has 118 places, 146 transitions, 1866 flow [2022-12-13 12:37:27,148 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=1574, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1866, PETRI_PLACES=118, PETRI_TRANSITIONS=146} [2022-12-13 12:37:27,148 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, 25 predicate places. [2022-12-13 12:37:27,148 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 146 transitions, 1866 flow [2022-12-13 12:37:27,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 141.28571428571428) internal successors, (989), 7 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:27,148 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:27,148 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 12:37:27,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:37:27,149 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:37:27,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:27,149 INFO L85 PathProgramCache]: Analyzing trace with hash -889874582, now seen corresponding path program 1 times [2022-12-13 12:37:27,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:37:27,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329856609] [2022-12-13 12:37:27,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:27,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:37:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:27,293 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 12:37:27,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:37:27,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329856609] [2022-12-13 12:37:27,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329856609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:37:27,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:37:27,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:37:27,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106306145] [2022-12-13 12:37:27,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:37:27,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:37:27,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:37:27,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:37:27,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:37:27,302 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 369 [2022-12-13 12:37:27,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 146 transitions, 1866 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:27,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:27,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 369 [2022-12-13 12:37:27,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:30,102 INFO L130 PetriNetUnfolder]: 10773/16189 cut-off events. [2022-12-13 12:37:30,102 INFO L131 PetriNetUnfolder]: For 60655/60655 co-relation queries the response was YES. [2022-12-13 12:37:30,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81335 conditions, 16189 events. 10773/16189 cut-off events. For 60655/60655 co-relation queries the response was YES. Maximal size of possible extension queue 1118. Compared 105384 event pairs, 3185 based on Foata normal form. 64/15099 useless extension candidates. Maximal degree in co-relation 81301. Up to 15628 conditions per place. [2022-12-13 12:37:30,206 INFO L137 encePairwiseOnDemand]: 363/369 looper letters, 173 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2022-12-13 12:37:30,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 180 transitions, 2462 flow [2022-12-13 12:37:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:37:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:37:30,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2022-12-13 12:37:30,208 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44625112917795845 [2022-12-13 12:37:30,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2022-12-13 12:37:30,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2022-12-13 12:37:30,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:30,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2022-12-13 12:37:30,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:30,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:30,211 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:30,211 INFO L175 Difference]: Start difference. First operand has 118 places, 146 transitions, 1866 flow. Second operand 3 states and 494 transitions. [2022-12-13 12:37:30,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 180 transitions, 2462 flow [2022-12-13 12:37:30,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 180 transitions, 2439 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-13 12:37:30,895 INFO L231 Difference]: Finished difference. Result has 118 places, 150 transitions, 1878 flow [2022-12-13 12:37:30,895 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1878, PETRI_PLACES=118, PETRI_TRANSITIONS=150} [2022-12-13 12:37:30,895 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, 25 predicate places. [2022-12-13 12:37:30,896 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 150 transitions, 1878 flow [2022-12-13 12:37:30,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:30,896 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:30,896 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 12:37:30,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 12:37:30,896 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:37:30,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:30,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1940241337, now seen corresponding path program 1 times [2022-12-13 12:37:30,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:37:30,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613488791] [2022-12-13 12:37:30,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:30,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:37:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:31,119 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 12:37:31,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:37:31,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613488791] [2022-12-13 12:37:31,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613488791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:37:31,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:37:31,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:37:31,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733835168] [2022-12-13 12:37:31,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:37:31,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:37:31,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:37:31,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:37:31,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:37:31,127 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 369 [2022-12-13 12:37:31,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 150 transitions, 1878 flow. Second operand has 4 states, 4 states have (on average 151.5) internal successors, (606), 4 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:31,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:31,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 369 [2022-12-13 12:37:31,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:32,332 INFO L130 PetriNetUnfolder]: 3813/6294 cut-off events. [2022-12-13 12:37:32,332 INFO L131 PetriNetUnfolder]: For 23343/23343 co-relation queries the response was YES. [2022-12-13 12:37:32,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32903 conditions, 6294 events. 3813/6294 cut-off events. For 23343/23343 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 39585 event pairs, 754 based on Foata normal form. 120/6025 useless extension candidates. Maximal degree in co-relation 32867. Up to 5024 conditions per place. [2022-12-13 12:37:32,363 INFO L137 encePairwiseOnDemand]: 363/369 looper letters, 193 selfloop transitions, 9 changer transitions 0/204 dead transitions. [2022-12-13 12:37:32,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 204 transitions, 2663 flow [2022-12-13 12:37:32,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:37:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:37:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 657 transitions. [2022-12-13 12:37:32,364 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2022-12-13 12:37:32,365 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 657 transitions. [2022-12-13 12:37:32,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 657 transitions. [2022-12-13 12:37:32,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:32,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 657 transitions. [2022-12-13 12:37:32,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.25) internal successors, (657), 4 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:32,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:32,368 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:32,368 INFO L175 Difference]: Start difference. First operand has 118 places, 150 transitions, 1878 flow. Second operand 4 states and 657 transitions. [2022-12-13 12:37:32,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 204 transitions, 2663 flow [2022-12-13 12:37:32,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 204 transitions, 2648 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 12:37:32,493 INFO L231 Difference]: Finished difference. Result has 121 places, 150 transitions, 1862 flow [2022-12-13 12:37:32,493 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1862, PETRI_PLACES=121, PETRI_TRANSITIONS=150} [2022-12-13 12:37:32,493 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, 28 predicate places. [2022-12-13 12:37:32,493 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 150 transitions, 1862 flow [2022-12-13 12:37:32,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.5) internal successors, (606), 4 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:32,494 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:32,494 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] [2022-12-13 12:37:32,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 12:37:32,494 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:37:32,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash -704382994, now seen corresponding path program 1 times [2022-12-13 12:37:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:37:32,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340567260] [2022-12-13 12:37:32,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:32,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:37:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:32,756 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 12:37:32,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:37:32,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340567260] [2022-12-13 12:37:32,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340567260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:37:32,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:37:32,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:37:32,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786477799] [2022-12-13 12:37:32,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:37:32,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:37:32,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:37:32,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:37:32,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:37:32,802 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 369 [2022-12-13 12:37:32,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 150 transitions, 1862 flow. Second operand has 6 states, 6 states have (on average 144.33333333333334) internal successors, (866), 6 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:32,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:32,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 369 [2022-12-13 12:37:32,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:34,811 INFO L130 PetriNetUnfolder]: 7407/12023 cut-off events. [2022-12-13 12:37:34,811 INFO L131 PetriNetUnfolder]: For 51944/51944 co-relation queries the response was YES. [2022-12-13 12:37:34,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65176 conditions, 12023 events. 7407/12023 cut-off events. For 51944/51944 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 79829 event pairs, 1159 based on Foata normal form. 20/11318 useless extension candidates. Maximal degree in co-relation 65139. Up to 4187 conditions per place. [2022-12-13 12:37:34,874 INFO L137 encePairwiseOnDemand]: 356/369 looper letters, 198 selfloop transitions, 155 changer transitions 0/354 dead transitions. [2022-12-13 12:37:34,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 354 transitions, 5004 flow [2022-12-13 12:37:34,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:37:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:37:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1117 transitions. [2022-12-13 12:37:34,876 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43244289585753 [2022-12-13 12:37:34,876 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1117 transitions. [2022-12-13 12:37:34,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1117 transitions. [2022-12-13 12:37:34,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:34,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1117 transitions. [2022-12-13 12:37:34,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 159.57142857142858) internal successors, (1117), 7 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:34,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 369.0) internal successors, (2952), 8 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:34,881 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 369.0) internal successors, (2952), 8 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:34,881 INFO L175 Difference]: Start difference. First operand has 121 places, 150 transitions, 1862 flow. Second operand 7 states and 1117 transitions. [2022-12-13 12:37:34,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 354 transitions, 5004 flow [2022-12-13 12:37:35,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 354 transitions, 4958 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 12:37:35,169 INFO L231 Difference]: Finished difference. Result has 128 places, 232 transitions, 3812 flow [2022-12-13 12:37:35,169 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3812, PETRI_PLACES=128, PETRI_TRANSITIONS=232} [2022-12-13 12:37:35,169 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, 35 predicate places. [2022-12-13 12:37:35,169 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 232 transitions, 3812 flow [2022-12-13 12:37:35,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 144.33333333333334) internal successors, (866), 6 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:35,169 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:35,170 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] [2022-12-13 12:37:35,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 12:37:35,170 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:37:35,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:35,170 INFO L85 PathProgramCache]: Analyzing trace with hash -603589436, now seen corresponding path program 2 times [2022-12-13 12:37:35,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:37:35,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615913547] [2022-12-13 12:37:35,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:35,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:37:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:35,311 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 12:37:35,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:37:35,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615913547] [2022-12-13 12:37:35,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615913547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:37:35,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:37:35,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:37:35,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917676525] [2022-12-13 12:37:35,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:37:35,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:37:35,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:37:35,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:37:35,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:37:35,318 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 369 [2022-12-13 12:37:35,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 232 transitions, 3812 flow. Second operand has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:35,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:35,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 369 [2022-12-13 12:37:35,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:36,205 INFO L130 PetriNetUnfolder]: 2392/4070 cut-off events. [2022-12-13 12:37:36,206 INFO L131 PetriNetUnfolder]: For 15607/15685 co-relation queries the response was YES. [2022-12-13 12:37:36,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19303 conditions, 4070 events. 2392/4070 cut-off events. For 15607/15685 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 24645 event pairs, 296 based on Foata normal form. 213/4125 useless extension candidates. Maximal degree in co-relation 19263. Up to 1286 conditions per place. [2022-12-13 12:37:36,225 INFO L137 encePairwiseOnDemand]: 363/369 looper letters, 182 selfloop transitions, 13 changer transitions 0/199 dead transitions. [2022-12-13 12:37:36,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 199 transitions, 2666 flow [2022-12-13 12:37:36,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:37:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:37:36,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 817 transitions. [2022-12-13 12:37:36,229 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44281842818428185 [2022-12-13 12:37:36,229 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 817 transitions. [2022-12-13 12:37:36,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 817 transitions. [2022-12-13 12:37:36,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:36,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 817 transitions. [2022-12-13 12:37:36,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 163.4) internal successors, (817), 5 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:36,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 369.0) internal successors, (2214), 6 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:36,231 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 369.0) internal successors, (2214), 6 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:36,231 INFO L175 Difference]: Start difference. First operand has 128 places, 232 transitions, 3812 flow. Second operand 5 states and 817 transitions. [2022-12-13 12:37:36,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 199 transitions, 2666 flow [2022-12-13 12:37:36,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 199 transitions, 2511 flow, removed 24 selfloop flow, removed 9 redundant places. [2022-12-13 12:37:36,264 INFO L231 Difference]: Finished difference. Result has 118 places, 132 transitions, 1646 flow [2022-12-13 12:37:36,264 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1646, PETRI_PLACES=118, PETRI_TRANSITIONS=132} [2022-12-13 12:37:36,264 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, 25 predicate places. [2022-12-13 12:37:36,264 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 132 transitions, 1646 flow [2022-12-13 12:37:36,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:36,265 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:36,265 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 12:37:36,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 12:37:36,265 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:37:36,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:36,265 INFO L85 PathProgramCache]: Analyzing trace with hash -586703009, now seen corresponding path program 1 times [2022-12-13 12:37:36,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:37:36,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143446967] [2022-12-13 12:37:36,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:36,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:37:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:37:36,445 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 12:37:36,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:37:36,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143446967] [2022-12-13 12:37:36,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143446967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:37:36,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:37:36,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:37:36,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581873773] [2022-12-13 12:37:36,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:37:36,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:37:36,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:37:36,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:37:36,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:37:36,456 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 369 [2022-12-13 12:37:36,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 132 transitions, 1646 flow. Second operand has 6 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:36,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:37:36,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 369 [2022-12-13 12:37:36,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:37:37,105 INFO L130 PetriNetUnfolder]: 1944/3097 cut-off events. [2022-12-13 12:37:37,105 INFO L131 PetriNetUnfolder]: For 11236/11314 co-relation queries the response was YES. [2022-12-13 12:37:37,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14541 conditions, 3097 events. 1944/3097 cut-off events. For 11236/11314 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 17891 event pairs, 211 based on Foata normal form. 117/3157 useless extension candidates. Maximal degree in co-relation 14508. Up to 1226 conditions per place. [2022-12-13 12:37:37,118 INFO L137 encePairwiseOnDemand]: 363/369 looper letters, 109 selfloop transitions, 17 changer transitions 1/130 dead transitions. [2022-12-13 12:37:37,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 130 transitions, 1268 flow [2022-12-13 12:37:37,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:37:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:37:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 959 transitions. [2022-12-13 12:37:37,121 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43315266485998194 [2022-12-13 12:37:37,121 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 959 transitions. [2022-12-13 12:37:37,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 959 transitions. [2022-12-13 12:37:37,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:37:37,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 959 transitions. [2022-12-13 12:37:37,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 159.83333333333334) internal successors, (959), 6 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:37,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:37,124 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:37,124 INFO L175 Difference]: Start difference. First operand has 118 places, 132 transitions, 1646 flow. Second operand 6 states and 959 transitions. [2022-12-13 12:37:37,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 130 transitions, 1268 flow [2022-12-13 12:37:37,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 130 transitions, 1058 flow, removed 24 selfloop flow, removed 21 redundant places. [2022-12-13 12:37:37,183 INFO L231 Difference]: Finished difference. Result has 89 places, 62 transitions, 408 flow [2022-12-13 12:37:37,183 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=89, PETRI_TRANSITIONS=62} [2022-12-13 12:37:37,183 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -4 predicate places. [2022-12-13 12:37:37,184 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 62 transitions, 408 flow [2022-12-13 12:37:37,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:37:37,184 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:37:37,184 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] [2022-12-13 12:37:37,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 12:37:37,184 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:37:37,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:37:37,185 INFO L85 PathProgramCache]: Analyzing trace with hash -966062758, now seen corresponding path program 1 times [2022-12-13 12:37:37,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:37:37,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570931999] [2022-12-13 12:37:37,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:37:37,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:37:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:37:37,273 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:37:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:37:37,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:37:37,351 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:37:37,351 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (87 of 88 remaining) [2022-12-13 12:37:37,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2022-12-13 12:37:37,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2022-12-13 12:37:37,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2022-12-13 12:37:37,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2022-12-13 12:37:37,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2022-12-13 12:37:37,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2022-12-13 12:37:37,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2022-12-13 12:37:37,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2022-12-13 12:37:37,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2022-12-13 12:37:37,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2022-12-13 12:37:37,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2022-12-13 12:37:37,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2022-12-13 12:37:37,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 88 remaining) [2022-12-13 12:37:37,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2022-12-13 12:37:37,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2022-12-13 12:37:37,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2022-12-13 12:37:37,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2022-12-13 12:37:37,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2022-12-13 12:37:37,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2022-12-13 12:37:37,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2022-12-13 12:37:37,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2022-12-13 12:37:37,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 88 remaining) [2022-12-13 12:37:37,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2022-12-13 12:37:37,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2022-12-13 12:37:37,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2022-12-13 12:37:37,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2022-12-13 12:37:37,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2022-12-13 12:37:37,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2022-12-13 12:37:37,356 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2022-12-13 12:37:37,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2022-12-13 12:37:37,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2022-12-13 12:37:37,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2022-12-13 12:37:37,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2022-12-13 12:37:37,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2022-12-13 12:37:37,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2022-12-13 12:37:37,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2022-12-13 12:37:37,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2022-12-13 12:37:37,357 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2022-12-13 12:37:37,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2022-12-13 12:37:37,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2022-12-13 12:37:37,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2022-12-13 12:37:37,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2022-12-13 12:37:37,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2022-12-13 12:37:37,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2022-12-13 12:37:37,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2022-12-13 12:37:37,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2022-12-13 12:37:37,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2022-12-13 12:37:37,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2022-12-13 12:37:37,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (38 of 88 remaining) [2022-12-13 12:37:37,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 88 remaining) [2022-12-13 12:37:37,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 88 remaining) [2022-12-13 12:37:37,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 88 remaining) [2022-12-13 12:37:37,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 88 remaining) [2022-12-13 12:37:37,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2022-12-13 12:37:37,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 88 remaining) [2022-12-13 12:37:37,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 88 remaining) [2022-12-13 12:37:37,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 88 remaining) [2022-12-13 12:37:37,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 88 remaining) [2022-12-13 12:37:37,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 88 remaining) [2022-12-13 12:37:37,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2022-12-13 12:37:37,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2022-12-13 12:37:37,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2022-12-13 12:37:37,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 88 remaining) [2022-12-13 12:37:37,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 88 remaining) [2022-12-13 12:37:37,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2022-12-13 12:37:37,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2022-12-13 12:37:37,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2022-12-13 12:37:37,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2022-12-13 12:37:37,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2022-12-13 12:37:37,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2022-12-13 12:37:37,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2022-12-13 12:37:37,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2022-12-13 12:37:37,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2022-12-13 12:37:37,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2022-12-13 12:37:37,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2022-12-13 12:37:37,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2022-12-13 12:37:37,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2022-12-13 12:37:37,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2022-12-13 12:37:37,362 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2022-12-13 12:37:37,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2022-12-13 12:37:37,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2022-12-13 12:37:37,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2022-12-13 12:37:37,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2022-12-13 12:37:37,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2022-12-13 12:37:37,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2022-12-13 12:37:37,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2022-12-13 12:37:37,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2022-12-13 12:37:37,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 12:37:37,364 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:37:37,369 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:37:37,369 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:37:37,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:37:37 BasicIcfg [2022-12-13 12:37:37,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:37:37,424 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:37:37,424 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:37:37,425 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:37:37,425 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:36:07" (3/4) ... [2022-12-13 12:37:37,427 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 12:37:37,427 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:37:37,427 INFO L158 Benchmark]: Toolchain (without parser) took 91707.30ms. Allocated memory was 119.5MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 82.6MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 906.4MB. Max. memory is 16.1GB. [2022-12-13 12:37:37,428 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 119.5MB. Free memory was 83.8MB in the beginning and 83.7MB in the end (delta: 24.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:37:37,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.84ms. Allocated memory is still 119.5MB. Free memory was 82.6MB in the beginning and 53.8MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-13 12:37:37,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.03ms. Allocated memory is still 119.5MB. Free memory was 53.8MB in the beginning and 51.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:37:37,428 INFO L158 Benchmark]: Boogie Preprocessor took 32.76ms. Allocated memory is still 119.5MB. Free memory was 51.4MB in the beginning and 49.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:37:37,428 INFO L158 Benchmark]: RCFGBuilder took 1027.19ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 49.0MB in the beginning and 59.7MB in the end (delta: -10.7MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2022-12-13 12:37:37,429 INFO L158 Benchmark]: TraceAbstraction took 90171.46ms. Allocated memory was 174.1MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 136.3MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 902.6MB. Max. memory is 16.1GB. [2022-12-13 12:37:37,429 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 3.3GB. Free memory is still 2.3GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:37:37,431 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.13ms. Allocated memory is still 119.5MB. Free memory was 83.8MB in the beginning and 83.7MB in the end (delta: 24.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.84ms. Allocated memory is still 119.5MB. Free memory was 82.6MB in the beginning and 53.8MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.03ms. Allocated memory is still 119.5MB. Free memory was 53.8MB in the beginning and 51.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.76ms. Allocated memory is still 119.5MB. Free memory was 51.4MB in the beginning and 49.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1027.19ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 49.0MB in the beginning and 59.7MB in the end (delta: -10.7MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * TraceAbstraction took 90171.46ms. Allocated memory was 174.1MB in the beginning and 3.3GB in the end (delta: 3.1GB). Free memory was 136.3MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 902.6MB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 3.3GB. Free memory is still 2.3GB. 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: 15.1s, 209 PlacesBefore, 93 PlacesAfterwards, 198 TransitionsBefore, 81 TransitionsAfterwards, 8980 CoEnabledTransitionPairs, 7 FixpointIterations, 76 TrivialSequentialCompositions, 86 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 167 TotalNumberOfCompositions, 37646 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12509, independent: 11904, independent conditional: 0, independent unconditional: 11904, dependent: 605, dependent conditional: 0, dependent unconditional: 605, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3748, independent: 3656, independent conditional: 0, independent unconditional: 3656, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12509, independent: 8248, independent conditional: 0, independent unconditional: 8248, dependent: 513, dependent conditional: 0, dependent unconditional: 513, unknown: 3748, unknown conditional: 0, unknown unconditional: 3748] , Statistics on independence cache: Total cache size (in pairs): 442, Positive cache size: 394, Positive conditional cache size: 0, Positive unconditional cache size: 394, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L744] 0 _Bool y$flush_delayed; [L745] 0 int y$mem_tmp; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L751] 0 _Bool y$r_buff1_thd0; [L752] 0 _Bool y$r_buff1_thd1; [L753] 0 _Bool y$r_buff1_thd2; [L754] 0 _Bool y$r_buff1_thd3; [L755] 0 _Bool y$r_buff1_thd4; [L756] 0 _Bool y$read_delayed; [L757] 0 int *y$read_delayed_var; [L758] 0 int y$w_buff0; [L759] 0 _Bool y$w_buff0_used; [L760] 0 int y$w_buff1; [L761] 0 _Bool y$w_buff1_used; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L864] 0 pthread_t t2417; [L865] FCALL, FORK 0 pthread_create(&t2417, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2417, ((void *)0), P0, ((void *)0))=1, t2417={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] EXPR 1 \read(y) [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L774] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L775] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L776] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L777] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L779] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L780] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L781] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L782] EXPR 1 \read(y) [L782] 1 __unbuffered_p0_EAX = y [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] 1 y = y$flush_delayed ? y$mem_tmp : y [L784] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L866] 0 pthread_t t2418; [L867] FCALL, FORK 0 pthread_create(&t2418, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2418, ((void *)0), P1, ((void *)0))=2, t2417={5:0}, t2418={6:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L868] 0 pthread_t t2419; [L869] FCALL, FORK 0 pthread_create(&t2419, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2419, ((void *)0), P2, ((void *)0))=3, t2417={5:0}, t2418={6:0}, t2419={7:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L870] 0 pthread_t t2420; [L811] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 3 y$flush_delayed = weak$$choice2 [L817] EXPR 3 \read(y) [L817] 3 y$mem_tmp = y [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] EXPR 3 \read(y) [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L819] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L820] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L821] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L822] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L824] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 \read(y) [L825] 3 __unbuffered_p2_EBX = y [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] 3 y = y$flush_delayed ? y$mem_tmp : y [L827] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L871] FCALL, FORK 0 pthread_create(&t2420, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2420, ((void *)0), P3, ((void *)0))=4, t2417={5:0}, t2418={6:0}, t2419={7:0}, t2420={8:0}, weak$$choice0=2, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 4 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 \read(y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L843] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L844] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L845] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L846] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 \read(y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L878] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L879] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L880] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L881] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2417={5:0}, t2418={6:0}, t2419={7:0}, t2420={8:0}, weak$$choice0=2, weak$$choice1=255, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L884] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: -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: -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: -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: -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: -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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 266 locations, 88 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: 90.0s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 67.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2572 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2072 mSDsluCounter, 850 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 767 mSDsCounter, 502 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5000 IncrementalHoareTripleChecker+Invalid, 5502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 502 mSolverCounterUnsat, 83 mSDtfsCounter, 5000 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3812occurred in iteration=17, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 2835 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 12:37:37,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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_48877903-54d8-4de9-b3b4-7692a6266f58/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 a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 --- 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 12:37:39,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:37:39,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:37:39,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:37:39,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:37:39,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:37:39,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:37:39,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:37:39,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:37:39,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:37:39,245 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:37:39,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:37:39,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:37:39,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:37:39,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:37:39,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:37:39,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:37:39,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:37:39,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:37:39,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:37:39,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:37:39,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:37:39,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:37:39,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:37:39,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:37:39,257 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:37:39,257 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:37:39,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:37:39,258 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:37:39,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:37:39,259 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:37:39,259 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:37:39,260 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:37:39,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:37:39,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:37:39,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:37:39,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:37:39,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:37:39,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:37:39,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:37:39,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:37:39,271 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 12:37:39,289 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:37:39,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:37:39,289 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:37:39,289 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:37:39,290 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:37:39,290 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:37:39,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:37:39,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:37:39,291 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:37:39,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:37:39,291 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:37:39,291 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 12:37:39,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:37:39,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:37:39,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:37:39,292 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 12:37:39,292 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 12:37:39,292 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 12:37:39,292 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:37:39,292 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 12:37:39,292 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 12:37:39,292 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 12:37:39,292 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:37:39,293 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:37:39,293 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:37:39,293 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:37:39,293 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:37:39,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:37:39,293 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:37:39,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:37:39,294 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 12:37:39,294 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 12:37:39,294 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:37:39,294 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:37:39,294 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:37:39,294 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 12:37:39,294 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:37:39,294 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_48877903-54d8-4de9-b3b4-7692a6266f58/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_48877903-54d8-4de9-b3b4-7692a6266f58/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 -> a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 [2022-12-13 12:37:39,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:37:39,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:37:39,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:37:39,519 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:37:39,519 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:37:39,521 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2022-12-13 12:37:42,151 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:37:42,368 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:37:42,369 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2022-12-13 12:37:42,381 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/data/07b0a1179/3f8fecee9c6f433192a3b29752f0b5b4/FLAG8cd99a747 [2022-12-13 12:37:42,392 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/data/07b0a1179/3f8fecee9c6f433192a3b29752f0b5b4 [2022-12-13 12:37:42,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:37:42,394 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:37:42,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:37:42,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:37:42,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:37:42,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:37:42" (1/1) ... [2022-12-13 12:37:42,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@676b4169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:42, skipping insertion in model container [2022-12-13 12:37:42,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:37:42" (1/1) ... [2022-12-13 12:37:42,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:37:42,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:37:42,567 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_48877903-54d8-4de9-b3b4-7692a6266f58/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i[995,1008] [2022-12-13 12:37:42,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:37:42,714 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:37:42,733 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_48877903-54d8-4de9-b3b4-7692a6266f58/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i[995,1008] [2022-12-13 12:37:42,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:37:42,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:37:42,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:37:42,829 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:37:42,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:42 WrapperNode [2022-12-13 12:37:42,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:37:42,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:37:42,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:37:42,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:37:42,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:42" (1/1) ... [2022-12-13 12:37:42,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:42" (1/1) ... [2022-12-13 12:37:42,877 INFO L138 Inliner]: procedures = 181, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 153 [2022-12-13 12:37:42,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:37:42,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:37:42,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:37:42,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:37:42,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:42" (1/1) ... [2022-12-13 12:37:42,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:42" (1/1) ... [2022-12-13 12:37:42,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:42" (1/1) ... [2022-12-13 12:37:42,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:42" (1/1) ... [2022-12-13 12:37:42,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:42" (1/1) ... [2022-12-13 12:37:42,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:42" (1/1) ... [2022-12-13 12:37:42,909 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:42" (1/1) ... [2022-12-13 12:37:42,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:42" (1/1) ... [2022-12-13 12:37:42,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:37:42,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:37:42,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:37:42,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:37:42,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:42" (1/1) ... [2022-12-13 12:37:42,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:37:42,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:37:42,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:37:42,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:37:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 12:37:42,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:37:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:37:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:37:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:37:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 12:37:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 12:37:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-13 12:37:42,980 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:37:42,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:37:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:37:42,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:37:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:37:42,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:37:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 12:37:42,981 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 12:37:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:37:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:37:42,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:37:42,983 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 12:37:43,119 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:37:43,121 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:37:43,688 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:37:44,115 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:37:44,115 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:37:44,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:37:44 BoogieIcfgContainer [2022-12-13 12:37:44,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:37:44,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:37:44,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:37:44,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:37:44,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:37:42" (1/3) ... [2022-12-13 12:37:44,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5906bfa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:37:44, skipping insertion in model container [2022-12-13 12:37:44,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:42" (2/3) ... [2022-12-13 12:37:44,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5906bfa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:37:44, skipping insertion in model container [2022-12-13 12:37:44,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:37:44" (3/3) ... [2022-12-13 12:37:44,123 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.oepc.i [2022-12-13 12:37:44,137 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:37:44,138 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2022-12-13 12:37:44,138 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:37:44,269 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:37:44,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 203 transitions, 426 flow [2022-12-13 12:37:44,361 INFO L130 PetriNetUnfolder]: 2/199 cut-off events. [2022-12-13 12:37:44,362 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:37:44,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 199 events. 2/199 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 283 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-12-13 12:37:44,367 INFO L82 GeneralOperation]: Start removeDead. Operand has 214 places, 203 transitions, 426 flow [2022-12-13 12:37:44,372 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 199 transitions, 410 flow [2022-12-13 12:37:44,374 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 12:37:44,382 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 199 transitions, 410 flow [2022-12-13 12:37:44,384 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 199 transitions, 410 flow [2022-12-13 12:37:44,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 199 transitions, 410 flow [2022-12-13 12:37:44,428 INFO L130 PetriNetUnfolder]: 2/199 cut-off events. [2022-12-13 12:37:44,428 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:37:44,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 199 events. 2/199 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 284 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 134. Up to 2 conditions per place. [2022-12-13 12:37:44,431 INFO L119 LiptonReduction]: Number of co-enabled transitions 8980 [2022-12-13 12:37:56,112 WARN L233 SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 224 DAG size of output: 221 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 12:38:06,018 WARN L233 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 266 DAG size of output: 264 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 12:38:16,332 INFO L134 LiptonReduction]: Checked pairs total: 41980 [2022-12-13 12:38:16,332 INFO L136 LiptonReduction]: Total number of compositions: 166 [2022-12-13 12:38:16,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:38:16,345 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;@39d930da, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:38:16,345 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2022-12-13 12:38:16,346 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 12:38:16,346 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:38:16,346 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:38:16,346 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 12:38:16,347 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:38:16,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:38:16,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1178, now seen corresponding path program 1 times [2022-12-13 12:38:16,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:38:16,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429264398] [2022-12-13 12:38:16,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:38:16,359 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 12:38:16,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:38:16,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:16,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:38:16,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 12:38:16,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:38:16,443 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 12:38:16,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:38:16,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:38:16,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429264398] [2022-12-13 12:38:16,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429264398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:38:16,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:38:16,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 12:38:16,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686141390] [2022-12-13 12:38:16,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:38:16,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:38:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:38:16,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:38:16,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:38:16,480 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 369 [2022-12-13 12:38:16,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 174 flow. Second operand has 2 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:16,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:38:16,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 369 [2022-12-13 12:38:16,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:38:24,817 INFO L130 PetriNetUnfolder]: 45876/60606 cut-off events. [2022-12-13 12:38:24,818 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-12-13 12:38:24,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121436 conditions, 60606 events. 45876/60606 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 2828. Compared 348741 event pairs, 45876 based on Foata normal form. 0/33983 useless extension candidates. Maximal degree in co-relation 121424. Up to 60603 conditions per place. [2022-12-13 12:38:25,148 INFO L137 encePairwiseOnDemand]: 336/369 looper letters, 45 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2022-12-13 12:38:25,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 196 flow [2022-12-13 12:38:25,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:38:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:38:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 384 transitions. [2022-12-13 12:38:25,161 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5203252032520326 [2022-12-13 12:38:25,161 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 384 transitions. [2022-12-13 12:38:25,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 384 transitions. [2022-12-13 12:38:25,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:38:25,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 384 transitions. [2022-12-13 12:38:25,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 192.0) internal successors, (384), 2 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:25,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 369.0) internal successors, (1107), 3 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:25,174 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 369.0) internal successors, (1107), 3 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:25,176 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 174 flow. Second operand 2 states and 384 transitions. [2022-12-13 12:38:25,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 196 flow [2022-12-13 12:38:25,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:38:25,185 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 102 flow [2022-12-13 12:38:25,187 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2022-12-13 12:38:25,190 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -36 predicate places. [2022-12-13 12:38:25,190 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 102 flow [2022-12-13 12:38:25,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:25,191 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:38:25,191 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 12:38:25,199 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:25,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:25,393 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:38:25,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:38:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1164506, now seen corresponding path program 1 times [2022-12-13 12:38:25,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:38:25,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581239731] [2022-12-13 12:38:25,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:38:25,396 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 12:38:25,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:38:25,399 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:25,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:38:25,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 12:38:25,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:38:25,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:38:25,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 12:38:25,667 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 12:38:25,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:38:25,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:38:25,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581239731] [2022-12-13 12:38:25,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581239731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:38:25,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:38:25,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:38:25,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497159860] [2022-12-13 12:38:25,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:38:25,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:38:25,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:38:25,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:38:25,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:38:25,741 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 369 [2022-12-13 12:38:25,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:25,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:38:25,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 369 [2022-12-13 12:38:25,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:38:29,689 INFO L130 PetriNetUnfolder]: 18111/24220 cut-off events. [2022-12-13 12:38:29,690 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:38:29,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48593 conditions, 24220 events. 18111/24220 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1093. Compared 127569 event pairs, 18111 based on Foata normal form. 0/16440 useless extension candidates. Maximal degree in co-relation 48590. Up to 24216 conditions per place. [2022-12-13 12:38:29,786 INFO L137 encePairwiseOnDemand]: 361/369 looper letters, 37 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2022-12-13 12:38:29,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 40 transitions, 164 flow [2022-12-13 12:38:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:38:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:38:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2022-12-13 12:38:29,789 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45257452574525747 [2022-12-13 12:38:29,789 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2022-12-13 12:38:29,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2022-12-13 12:38:29,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:38:29,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2022-12-13 12:38:29,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:29,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:29,793 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:29,793 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 102 flow. Second operand 3 states and 501 transitions. [2022-12-13 12:38:29,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 40 transitions, 164 flow [2022-12-13 12:38:29,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:38:29,794 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 90 flow [2022-12-13 12:38:29,794 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=3, PETRI_FLOW=90, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2022-12-13 12:38:29,795 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -41 predicate places. [2022-12-13 12:38:29,795 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 90 flow [2022-12-13 12:38:29,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:29,795 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:38:29,795 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 12:38:29,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:29,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:29,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:38:29,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:38:29,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1164505, now seen corresponding path program 1 times [2022-12-13 12:38:29,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:38:29,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588918562] [2022-12-13 12:38:29,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:38:29,998 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 12:38:29,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:38:29,999 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:30,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:38:30,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 12:38:30,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:38:30,114 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 12:38:30,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 12:38:30,130 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 12:38:30,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:38:30,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:38:30,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588918562] [2022-12-13 12:38:30,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588918562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:38:30,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:38:30,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:38:30,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079604642] [2022-12-13 12:38:30,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:38:30,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:38:30,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:38:30,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:38:30,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:38:30,195 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 369 [2022-12-13 12:38:30,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:30,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:38:30,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 369 [2022-12-13 12:38:30,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:38:32,062 INFO L130 PetriNetUnfolder]: 9157/12411 cut-off events. [2022-12-13 12:38:32,063 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:38:32,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24921 conditions, 12411 events. 9157/12411 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 61511 event pairs, 4547 based on Foata normal form. 0/9713 useless extension candidates. Maximal degree in co-relation 24917. Up to 8280 conditions per place. [2022-12-13 12:38:32,101 INFO L137 encePairwiseOnDemand]: 360/369 looper letters, 44 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2022-12-13 12:38:32,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 198 flow [2022-12-13 12:38:32,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:38:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:38:32,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2022-12-13 12:38:32,103 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44896115627822947 [2022-12-13 12:38:32,103 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2022-12-13 12:38:32,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2022-12-13 12:38:32,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:38:32,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2022-12-13 12:38:32,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:32,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:32,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:32,106 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 90 flow. Second operand 3 states and 497 transitions. [2022-12-13 12:38:32,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 198 flow [2022-12-13 12:38:32,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:38:32,107 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 101 flow [2022-12-13 12:38:32,108 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2022-12-13 12:38:32,108 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -41 predicate places. [2022-12-13 12:38:32,108 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 101 flow [2022-12-13 12:38:32,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:32,108 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:38:32,109 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:38:32,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:32,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:32,310 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:38:32,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:38:32,311 INFO L85 PathProgramCache]: Analyzing trace with hash -740635153, now seen corresponding path program 1 times [2022-12-13 12:38:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:38:32,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271252810] [2022-12-13 12:38:32,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:38:32,314 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 12:38:32,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:38:32,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:32,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:38:32,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 12:38:32,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:38:32,488 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 12:38:32,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:38:32,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:38:32,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271252810] [2022-12-13 12:38:32,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271252810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:38:32,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:38:32,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:38:32,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617282832] [2022-12-13 12:38:32,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:38:32,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:38:32,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:38:32,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:38:32,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:38:32,502 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 369 [2022-12-13 12:38:32,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:32,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:38:32,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 369 [2022-12-13 12:38:32,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:38:33,860 INFO L130 PetriNetUnfolder]: 5521/7839 cut-off events. [2022-12-13 12:38:33,861 INFO L131 PetriNetUnfolder]: For 644/644 co-relation queries the response was YES. [2022-12-13 12:38:33,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17060 conditions, 7839 events. 5521/7839 cut-off events. For 644/644 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 39754 event pairs, 1960 based on Foata normal form. 36/7094 useless extension candidates. Maximal degree in co-relation 17055. Up to 7624 conditions per place. [2022-12-13 12:38:33,891 INFO L137 encePairwiseOnDemand]: 363/369 looper letters, 49 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2022-12-13 12:38:33,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 251 flow [2022-12-13 12:38:33,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:38:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:38:33,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2022-12-13 12:38:33,893 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45076784101174344 [2022-12-13 12:38:33,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2022-12-13 12:38:33,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2022-12-13 12:38:33,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:38:33,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2022-12-13 12:38:33,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:33,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:33,896 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 369.0) internal successors, (1476), 4 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:33,896 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 101 flow. Second operand 3 states and 499 transitions. [2022-12-13 12:38:33,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 251 flow [2022-12-13 12:38:33,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:38:33,900 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 130 flow [2022-12-13 12:38:33,900 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2022-12-13 12:38:33,900 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -40 predicate places. [2022-12-13 12:38:33,901 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 130 flow [2022-12-13 12:38:33,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:33,901 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:38:33,901 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:38:33,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:34,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:34,102 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:38:34,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:38:34,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1780003917, now seen corresponding path program 1 times [2022-12-13 12:38:34,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:38:34,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74084913] [2022-12-13 12:38:34,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:38:34,103 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 12:38:34,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:38:34,104 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:34,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:38:34,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 12:38:34,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:38:34,247 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 12:38:34,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:38:34,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:38:34,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74084913] [2022-12-13 12:38:34,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74084913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:38:34,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:38:34,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:38:34,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116102909] [2022-12-13 12:38:34,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:38:34,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:38:34,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:38:34,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:38:34,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:38:34,260 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 369 [2022-12-13 12:38:34,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:34,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:38:34,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 369 [2022-12-13 12:38:34,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:38:34,913 INFO L130 PetriNetUnfolder]: 1861/2919 cut-off events. [2022-12-13 12:38:34,913 INFO L131 PetriNetUnfolder]: For 678/678 co-relation queries the response was YES. [2022-12-13 12:38:34,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7169 conditions, 2919 events. 1861/2919 cut-off events. For 678/678 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 14237 event pairs, 508 based on Foata normal form. 60/2688 useless extension candidates. Maximal degree in co-relation 7163. Up to 2354 conditions per place. [2022-12-13 12:38:34,921 INFO L137 encePairwiseOnDemand]: 363/369 looper letters, 61 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2022-12-13 12:38:34,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 348 flow [2022-12-13 12:38:34,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:38:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:38:34,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 663 transitions. [2022-12-13 12:38:34,923 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4491869918699187 [2022-12-13 12:38:34,923 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 663 transitions. [2022-12-13 12:38:34,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 663 transitions. [2022-12-13 12:38:34,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:38:34,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 663 transitions. [2022-12-13 12:38:34,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:34,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:34,926 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:34,926 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 130 flow. Second operand 4 states and 663 transitions. [2022-12-13 12:38:34,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 348 flow [2022-12-13 12:38:34,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 343 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:38:34,927 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 177 flow [2022-12-13 12:38:34,927 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2022-12-13 12:38:34,928 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -37 predicate places. [2022-12-13 12:38:34,928 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 177 flow [2022-12-13 12:38:34,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.75) internal successors, (607), 4 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:34,928 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:38:34,928 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 12:38:34,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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)] Forceful destruction successful, exit code 0 [2022-12-13 12:38:35,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:35,129 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:38:35,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:38:35,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1607461888, now seen corresponding path program 1 times [2022-12-13 12:38:35,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:38:35,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296930628] [2022-12-13 12:38:35,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:38:35,131 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 12:38:35,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:38:35,133 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:35,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:38:35,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 12:38:35,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:38:35,303 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 12:38:35,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:38:35,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:38:35,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296930628] [2022-12-13 12:38:35,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296930628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:38:35,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:38:35,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:38:35,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916715620] [2022-12-13 12:38:35,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:38:35,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:38:35,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:38:35,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:38:35,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:38:35,324 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 369 [2022-12-13 12:38:35,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:35,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:38:35,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 369 [2022-12-13 12:38:35,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:38:35,809 INFO L130 PetriNetUnfolder]: 660/1096 cut-off events. [2022-12-13 12:38:35,809 INFO L131 PetriNetUnfolder]: For 790/790 co-relation queries the response was YES. [2022-12-13 12:38:35,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3138 conditions, 1096 events. 660/1096 cut-off events. For 790/790 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4466 event pairs, 154 based on Foata normal form. 37/1078 useless extension candidates. Maximal degree in co-relation 3131. Up to 350 conditions per place. [2022-12-13 12:38:35,812 INFO L137 encePairwiseOnDemand]: 363/369 looper letters, 70 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2022-12-13 12:38:35,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 85 transitions, 449 flow [2022-12-13 12:38:35,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:38:35,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:38:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 824 transitions. [2022-12-13 12:38:35,814 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44661246612466127 [2022-12-13 12:38:35,814 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 824 transitions. [2022-12-13 12:38:35,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 824 transitions. [2022-12-13 12:38:35,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:38:35,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 824 transitions. [2022-12-13 12:38:35,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:35,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 369.0) internal successors, (2214), 6 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:35,818 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 369.0) internal successors, (2214), 6 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:35,818 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 177 flow. Second operand 5 states and 824 transitions. [2022-12-13 12:38:35,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 85 transitions, 449 flow [2022-12-13 12:38:35,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 85 transitions, 431 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 12:38:35,820 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 227 flow [2022-12-13 12:38:35,820 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2022-12-13 12:38:35,821 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -34 predicate places. [2022-12-13 12:38:35,821 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 227 flow [2022-12-13 12:38:35,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.4) internal successors, (757), 5 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:35,821 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:38:35,821 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] [2022-12-13 12:38:35,831 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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)] Forceful destruction successful, exit code 0 [2022-12-13 12:38:36,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:36,022 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:38:36,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:38:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1752893458, now seen corresponding path program 1 times [2022-12-13 12:38:36,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:38:36,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114544247] [2022-12-13 12:38:36,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:38:36,024 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 12:38:36,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:38:36,025 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:36,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:38:36,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 12:38:36,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:38:36,205 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 12:38:36,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:38:36,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:38:36,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114544247] [2022-12-13 12:38:36,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114544247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:38:36,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:38:36,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:38:36,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474531137] [2022-12-13 12:38:36,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:38:36,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:38:36,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:38:36,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:38:36,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:38:36,217 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 369 [2022-12-13 12:38:36,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 227 flow. Second operand has 6 states, 6 states have (on average 151.33333333333334) internal successors, (908), 6 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:36,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:38:36,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 369 [2022-12-13 12:38:36,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:38:36,859 INFO L130 PetriNetUnfolder]: 530/831 cut-off events. [2022-12-13 12:38:36,859 INFO L131 PetriNetUnfolder]: For 815/815 co-relation queries the response was YES. [2022-12-13 12:38:36,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 831 events. 530/831 cut-off events. For 815/815 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3217 event pairs, 123 based on Foata normal form. 10/836 useless extension candidates. Maximal degree in co-relation 2541. Up to 350 conditions per place. [2022-12-13 12:38:36,862 INFO L137 encePairwiseOnDemand]: 363/369 looper letters, 60 selfloop transitions, 17 changer transitions 1/80 dead transitions. [2022-12-13 12:38:36,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 80 transitions, 445 flow [2022-12-13 12:38:36,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:38:36,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:38:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 967 transitions. [2022-12-13 12:38:36,864 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43676603432700994 [2022-12-13 12:38:36,864 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 967 transitions. [2022-12-13 12:38:36,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 967 transitions. [2022-12-13 12:38:36,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:38:36,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 967 transitions. [2022-12-13 12:38:36,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.16666666666666) internal successors, (967), 6 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:36,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:36,868 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:36,868 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 227 flow. Second operand 6 states and 967 transitions. [2022-12-13 12:38:36,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 80 transitions, 445 flow [2022-12-13 12:38:36,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 80 transitions, 409 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-13 12:38:36,873 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 213 flow [2022-12-13 12:38:36,873 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2022-12-13 12:38:36,873 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -37 predicate places. [2022-12-13 12:38:36,874 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 213 flow [2022-12-13 12:38:36,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 151.33333333333334) internal successors, (908), 6 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:38:36,874 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:38:36,874 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] [2022-12-13 12:38:36,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:37,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:37,076 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:38:37,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:38:37,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1588283173, now seen corresponding path program 1 times [2022-12-13 12:38:37,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:38:37,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402405578] [2022-12-13 12:38:37,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:38:37,080 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 12:38:37,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:38:37,082 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:37,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:38:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:38:37,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 12:38:37,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:42:07,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 12:42:07,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 12:42:07,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 12:42:07,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 904 treesize of output 900 [2022-12-13 12:42:07,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 894 treesize of output 890 [2022-12-13 12:42:07,289 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 12:42:07,322 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 12:42:07,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:42:07,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:42:07,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402405578] [2022-12-13 12:42:07,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402405578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:42:07,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:42:07,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:42:07,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912171879] [2022-12-13 12:42:07,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:42:07,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:42:07,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:42:07,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:42:07,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:42:07,438 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 369 [2022-12-13 12:42:07,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 213 flow. Second operand has 5 states, 5 states have (on average 149.6) internal successors, (748), 5 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:07,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:42:07,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 369 [2022-12-13 12:42:07,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:42:07,749 INFO L130 PetriNetUnfolder]: 530/828 cut-off events. [2022-12-13 12:42:07,749 INFO L131 PetriNetUnfolder]: For 1225/1225 co-relation queries the response was YES. [2022-12-13 12:42:07,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2596 conditions, 828 events. 530/828 cut-off events. For 1225/1225 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3153 event pairs, 345 based on Foata normal form. 0/826 useless extension candidates. Maximal degree in co-relation 2588. Up to 611 conditions per place. [2022-12-13 12:42:07,752 INFO L137 encePairwiseOnDemand]: 365/369 looper letters, 60 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2022-12-13 12:42:07,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 65 transitions, 438 flow [2022-12-13 12:42:07,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:42:07,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:42:07,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 771 transitions. [2022-12-13 12:42:07,753 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41788617886178864 [2022-12-13 12:42:07,753 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 771 transitions. [2022-12-13 12:42:07,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 771 transitions. [2022-12-13 12:42:07,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:42:07,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 771 transitions. [2022-12-13 12:42:07,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.2) internal successors, (771), 5 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:07,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 369.0) internal successors, (2214), 6 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:07,756 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 369.0) internal successors, (2214), 6 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:07,756 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 213 flow. Second operand 5 states and 771 transitions. [2022-12-13 12:42:07,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 65 transitions, 438 flow [2022-12-13 12:42:07,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 373 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-13 12:42:07,759 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 167 flow [2022-12-13 12:42:07,760 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-12-13 12:42:07,760 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -39 predicate places. [2022-12-13 12:42:07,760 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 167 flow [2022-12-13 12:42:07,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.6) internal successors, (748), 5 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:07,760 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:42:07,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] [2022-12-13 12:42:07,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:07,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:07,962 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:42:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:42:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash 576302948, now seen corresponding path program 1 times [2022-12-13 12:42:07,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:42:07,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108522219] [2022-12-13 12:42:07,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:42:07,966 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 12:42:07,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:42:07,968 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:07,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:42:08,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 12:42:08,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:42:19,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 12:42:19,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 12:42:19,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 12:42:19,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1015 treesize of output 1011 [2022-12-13 12:42:20,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1005 treesize of output 1001 [2022-12-13 12:42:20,138 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 12:42:20,142 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 12:42:20,144 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 12:42:20,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 12:42:20,313 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 12:42:20,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:42:20,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:42:20,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108522219] [2022-12-13 12:42:20,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108522219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:42:20,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:42:20,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:42:20,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899072223] [2022-12-13 12:42:20,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:42:20,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:42:20,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:42:20,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:42:20,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:42:20,424 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 369 [2022-12-13 12:42:20,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 154.6) internal successors, (773), 5 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:20,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:42:20,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 369 [2022-12-13 12:42:20,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:42:20,780 INFO L130 PetriNetUnfolder]: 530/919 cut-off events. [2022-12-13 12:42:20,780 INFO L131 PetriNetUnfolder]: For 761/761 co-relation queries the response was YES. [2022-12-13 12:42:20,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2522 conditions, 919 events. 530/919 cut-off events. For 761/761 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4050 event pairs, 101 based on Foata normal form. 0/918 useless extension candidates. Maximal degree in co-relation 2514. Up to 614 conditions per place. [2022-12-13 12:42:20,783 INFO L137 encePairwiseOnDemand]: 366/369 looper letters, 60 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2022-12-13 12:42:20,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 375 flow [2022-12-13 12:42:20,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:42:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:42:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 645 transitions. [2022-12-13 12:42:20,785 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4369918699186992 [2022-12-13 12:42:20,785 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 645 transitions. [2022-12-13 12:42:20,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 645 transitions. [2022-12-13 12:42:20,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:42:20,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 645 transitions. [2022-12-13 12:42:20,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:20,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:20,787 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:20,787 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 167 flow. Second operand 4 states and 645 transitions. [2022-12-13 12:42:20,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 375 flow [2022-12-13 12:42:20,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 370 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:42:20,790 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 164 flow [2022-12-13 12:42:20,791 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2022-12-13 12:42:20,791 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -40 predicate places. [2022-12-13 12:42:20,791 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 164 flow [2022-12-13 12:42:20,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 154.6) internal successors, (773), 5 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:20,791 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:42:20,791 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] [2022-12-13 12:42:20,800 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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)] Forceful destruction successful, exit code 0 [2022-12-13 12:42:20,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:20,993 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:42:20,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:42:20,994 INFO L85 PathProgramCache]: Analyzing trace with hash -778755470, now seen corresponding path program 1 times [2022-12-13 12:42:20,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:42:20,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461462592] [2022-12-13 12:42:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:42:20,997 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 12:42:20,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:42:20,999 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:21,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:42:21,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 12:42:21,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:42:21,213 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 12:42:21,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:42:21,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:42:21,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461462592] [2022-12-13 12:42:21,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461462592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:42:21,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:42:21,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:42:21,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063173087] [2022-12-13 12:42:21,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:42:21,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:42:21,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:42:21,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:42:21,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:42:21,224 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 369 [2022-12-13 12:42:21,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:21,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:42:21,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 369 [2022-12-13 12:42:21,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:42:21,737 INFO L130 PetriNetUnfolder]: 930/1451 cut-off events. [2022-12-13 12:42:21,737 INFO L131 PetriNetUnfolder]: For 935/935 co-relation queries the response was YES. [2022-12-13 12:42:21,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4217 conditions, 1451 events. 930/1451 cut-off events. For 935/935 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6306 event pairs, 154 based on Foata normal form. 0/1449 useless extension candidates. Maximal degree in co-relation 4209. Up to 764 conditions per place. [2022-12-13 12:42:21,742 INFO L137 encePairwiseOnDemand]: 366/369 looper letters, 93 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2022-12-13 12:42:21,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 96 transitions, 573 flow [2022-12-13 12:42:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:42:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:42:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 662 transitions. [2022-12-13 12:42:21,744 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44850948509485095 [2022-12-13 12:42:21,744 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 662 transitions. [2022-12-13 12:42:21,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 662 transitions. [2022-12-13 12:42:21,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:42:21,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 662 transitions. [2022-12-13 12:42:21,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:21,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:21,747 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:21,747 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 164 flow. Second operand 4 states and 662 transitions. [2022-12-13 12:42:21,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 96 transitions, 573 flow [2022-12-13 12:42:21,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 96 transitions, 569 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:42:21,754 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 174 flow [2022-12-13 12:42:21,754 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2022-12-13 12:42:21,755 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -37 predicate places. [2022-12-13 12:42:21,755 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 174 flow [2022-12-13 12:42:21,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:21,755 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:42:21,755 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] [2022-12-13 12:42:21,764 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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)] Forceful destruction successful, exit code 0 [2022-12-13 12:42:21,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:21,957 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:42:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:42:21,958 INFO L85 PathProgramCache]: Analyzing trace with hash -608280538, now seen corresponding path program 2 times [2022-12-13 12:42:21,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:42:21,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680270846] [2022-12-13 12:42:21,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:42:21,961 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 12:42:21,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:42:21,964 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:21,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:22,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 12:42:22,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:42:22,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 12:42:22,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:42:22,299 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 12:42:22,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:42:22,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:42:22,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680270846] [2022-12-13 12:42:22,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680270846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:42:22,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:42:22,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:42:22,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790710971] [2022-12-13 12:42:22,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:42:22,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:42:22,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:42:22,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:42:22,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:42:22,307 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 369 [2022-12-13 12:42:22,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:22,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:42:22,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 369 [2022-12-13 12:42:22,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:42:22,772 INFO L130 PetriNetUnfolder]: 1094/1777 cut-off events. [2022-12-13 12:42:22,772 INFO L131 PetriNetUnfolder]: For 1758/1800 co-relation queries the response was YES. [2022-12-13 12:42:22,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5547 conditions, 1777 events. 1094/1777 cut-off events. For 1758/1800 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8978 event pairs, 105 based on Foata normal form. 1/1747 useless extension candidates. Maximal degree in co-relation 5537. Up to 889 conditions per place. [2022-12-13 12:42:22,778 INFO L137 encePairwiseOnDemand]: 365/369 looper letters, 87 selfloop transitions, 3 changer transitions 0/93 dead transitions. [2022-12-13 12:42:22,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 563 flow [2022-12-13 12:42:22,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:42:22,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:42:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 657 transitions. [2022-12-13 12:42:22,779 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2022-12-13 12:42:22,779 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 657 transitions. [2022-12-13 12:42:22,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 657 transitions. [2022-12-13 12:42:22,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:42:22,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 657 transitions. [2022-12-13 12:42:22,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.25) internal successors, (657), 4 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:22,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:22,782 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 369.0) internal successors, (1845), 5 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:22,782 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 174 flow. Second operand 4 states and 657 transitions. [2022-12-13 12:42:22,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 563 flow [2022-12-13 12:42:22,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:42:22,796 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 187 flow [2022-12-13 12:42:22,796 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2022-12-13 12:42:22,796 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -34 predicate places. [2022-12-13 12:42:22,796 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 187 flow [2022-12-13 12:42:22,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:22,797 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:42:22,797 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] [2022-12-13 12:42:22,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:22,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:22,998 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:42:22,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:42:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1605567154, now seen corresponding path program 3 times [2022-12-13 12:42:23,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:42:23,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736100774] [2022-12-13 12:42:23,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 12:42:23,002 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 12:42:23,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:42:23,004 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:23,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:23,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 12:42:23,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:42:23,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 12:42:23,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:42:23,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 12:42:23,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 12:42:23,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 12:42:23,567 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 12:42:23,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:42:23,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:42:23,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736100774] [2022-12-13 12:42:23,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736100774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:42:23,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:42:23,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:42:23,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582396016] [2022-12-13 12:42:23,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:42:23,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:42:23,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:42:23,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:42:23,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:42:23,993 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 369 [2022-12-13 12:42:23,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:23,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:42:23,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 369 [2022-12-13 12:42:23,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:42:24,753 INFO L130 PetriNetUnfolder]: 1694/2879 cut-off events. [2022-12-13 12:42:24,753 INFO L131 PetriNetUnfolder]: For 4290/4295 co-relation queries the response was YES. [2022-12-13 12:42:24,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9671 conditions, 2879 events. 1694/2879 cut-off events. For 4290/4295 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 16693 event pairs, 624 based on Foata normal form. 1/2841 useless extension candidates. Maximal degree in co-relation 9660. Up to 1562 conditions per place. [2022-12-13 12:42:24,763 INFO L137 encePairwiseOnDemand]: 363/369 looper letters, 105 selfloop transitions, 7 changer transitions 0/114 dead transitions. [2022-12-13 12:42:24,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 114 transitions, 766 flow [2022-12-13 12:42:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:42:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:42:24,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 897 transitions. [2022-12-13 12:42:24,765 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4051490514905149 [2022-12-13 12:42:24,765 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 897 transitions. [2022-12-13 12:42:24,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 897 transitions. [2022-12-13 12:42:24,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 12:42:24,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 897 transitions. [2022-12-13 12:42:24,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 149.5) internal successors, (897), 6 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 12:42:24,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:24,768 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 369.0) internal successors, (2583), 7 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:24,769 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 187 flow. Second operand 6 states and 897 transitions. [2022-12-13 12:42:24,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 114 transitions, 766 flow [2022-12-13 12:42:24,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 114 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:42:24,798 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 228 flow [2022-12-13 12:42:24,798 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2022-12-13 12:42:24,798 INFO L288 CegarLoopForPetriNet]: 93 programPoint places, -28 predicate places. [2022-12-13 12:42:24,798 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 228 flow [2022-12-13 12:42:24,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:42:24,799 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:42:24,799 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] [2022-12-13 12:42:24,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:24,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:25,000 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 12:42:25,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:42:25,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1473515064, now seen corresponding path program 4 times [2022-12-13 12:42:25,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:42:25,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787036362] [2022-12-13 12:42:25,002 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 12:42:25,002 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 12:42:25,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:42:25,003 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:25,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:25,253 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 12:42:25,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 12:42:25,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:42:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:42:25,453 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 12:42:25,453 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:42:25,453 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (87 of 88 remaining) [2022-12-13 12:42:25,454 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2022-12-13 12:42:25,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2022-12-13 12:42:25,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2022-12-13 12:42:25,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2022-12-13 12:42:25,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2022-12-13 12:42:25,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2022-12-13 12:42:25,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2022-12-13 12:42:25,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2022-12-13 12:42:25,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2022-12-13 12:42:25,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2022-12-13 12:42:25,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2022-12-13 12:42:25,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2022-12-13 12:42:25,455 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 88 remaining) [2022-12-13 12:42:25,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2022-12-13 12:42:25,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2022-12-13 12:42:25,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2022-12-13 12:42:25,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2022-12-13 12:42:25,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2022-12-13 12:42:25,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2022-12-13 12:42:25,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2022-12-13 12:42:25,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2022-12-13 12:42:25,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 88 remaining) [2022-12-13 12:42:25,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2022-12-13 12:42:25,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2022-12-13 12:42:25,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2022-12-13 12:42:25,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2022-12-13 12:42:25,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2022-12-13 12:42:25,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2022-12-13 12:42:25,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2022-12-13 12:42:25,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2022-12-13 12:42:25,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2022-12-13 12:42:25,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2022-12-13 12:42:25,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2022-12-13 12:42:25,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2022-12-13 12:42:25,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2022-12-13 12:42:25,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2022-12-13 12:42:25,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2022-12-13 12:42:25,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2022-12-13 12:42:25,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2022-12-13 12:42:25,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2022-12-13 12:42:25,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2022-12-13 12:42:25,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2022-12-13 12:42:25,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2022-12-13 12:42:25,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2022-12-13 12:42:25,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2022-12-13 12:42:25,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2022-12-13 12:42:25,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2022-12-13 12:42:25,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2022-12-13 12:42:25,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (38 of 88 remaining) [2022-12-13 12:42:25,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 88 remaining) [2022-12-13 12:42:25,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 88 remaining) [2022-12-13 12:42:25,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 88 remaining) [2022-12-13 12:42:25,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 88 remaining) [2022-12-13 12:42:25,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2022-12-13 12:42:25,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 88 remaining) [2022-12-13 12:42:25,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 88 remaining) [2022-12-13 12:42:25,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 88 remaining) [2022-12-13 12:42:25,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 88 remaining) [2022-12-13 12:42:25,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 88 remaining) [2022-12-13 12:42:25,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2022-12-13 12:42:25,461 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2022-12-13 12:42:25,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2022-12-13 12:42:25,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 88 remaining) [2022-12-13 12:42:25,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 88 remaining) [2022-12-13 12:42:25,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2022-12-13 12:42:25,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2022-12-13 12:42:25,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2022-12-13 12:42:25,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2022-12-13 12:42:25,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2022-12-13 12:42:25,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2022-12-13 12:42:25,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2022-12-13 12:42:25,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2022-12-13 12:42:25,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2022-12-13 12:42:25,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2022-12-13 12:42:25,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2022-12-13 12:42:25,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2022-12-13 12:42:25,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2022-12-13 12:42:25,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2022-12-13 12:42:25,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2022-12-13 12:42:25,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2022-12-13 12:42:25,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2022-12-13 12:42:25,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2022-12-13 12:42:25,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2022-12-13 12:42:25,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2022-12-13 12:42:25,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2022-12-13 12:42:25,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2022-12-13 12:42:25,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2022-12-13 12:42:25,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:25,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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 12:42:25,667 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:42:25,685 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:42:25,686 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:42:25,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:42:25 BasicIcfg [2022-12-13 12:42:25,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:42:25,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:42:25,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:42:25,766 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:42:25,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:37:44" (3/4) ... [2022-12-13 12:42:25,768 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 12:42:25,768 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:42:25,769 INFO L158 Benchmark]: Toolchain (without parser) took 283374.29ms. Allocated memory was 67.1MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 44.5MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-12-13 12:42:25,769 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 67.1MB. Free memory is still 45.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:42:25,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.57ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 44.3MB in the beginning and 64.4MB in the end (delta: -20.0MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-12-13 12:42:25,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.06ms. Allocated memory is still 96.5MB. Free memory was 64.4MB in the beginning and 61.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:42:25,769 INFO L158 Benchmark]: Boogie Preprocessor took 37.69ms. Allocated memory is still 96.5MB. Free memory was 61.9MB in the beginning and 59.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 12:42:25,769 INFO L158 Benchmark]: RCFGBuilder took 1200.32ms. Allocated memory is still 96.5MB. Free memory was 59.3MB in the beginning and 60.8MB in the end (delta: -1.5MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2022-12-13 12:42:25,770 INFO L158 Benchmark]: TraceAbstraction took 281647.11ms. Allocated memory was 96.5MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 60.8MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-12-13 12:42:25,770 INFO L158 Benchmark]: Witness Printer took 2.48ms. Allocated memory is still 3.4GB. Free memory is still 1.7GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:42:25,771 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 67.1MB. Free memory is still 45.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.57ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 44.3MB in the beginning and 64.4MB in the end (delta: -20.0MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.06ms. Allocated memory is still 96.5MB. Free memory was 64.4MB in the beginning and 61.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.69ms. Allocated memory is still 96.5MB. Free memory was 61.9MB in the beginning and 59.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1200.32ms. Allocated memory is still 96.5MB. Free memory was 59.3MB in the beginning and 60.8MB in the end (delta: -1.5MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * TraceAbstraction took 281647.11ms. Allocated memory was 96.5MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 60.8MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 2.48ms. Allocated memory is still 3.4GB. Free memory is still 1.7GB. 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: 31.9s, 210 PlacesBefore, 93 PlacesAfterwards, 199 TransitionsBefore, 81 TransitionsAfterwards, 8980 CoEnabledTransitionPairs, 8 FixpointIterations, 73 TrivialSequentialCompositions, 88 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 166 TotalNumberOfCompositions, 41980 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13683, independent: 12999, independent conditional: 0, independent unconditional: 12999, dependent: 684, dependent conditional: 0, dependent unconditional: 684, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3773, independent: 3681, independent conditional: 0, independent unconditional: 3681, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 13683, independent: 9318, independent conditional: 0, independent unconditional: 9318, dependent: 592, dependent conditional: 0, dependent unconditional: 592, unknown: 3773, unknown conditional: 0, unknown unconditional: 3773] , Statistics on independence cache: Total cache size (in pairs): 459, Positive cache size: 411, Positive conditional cache size: 0, Positive unconditional cache size: 411, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L744] 0 _Bool y$flush_delayed; [L745] 0 int y$mem_tmp; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L751] 0 _Bool y$r_buff1_thd0; [L752] 0 _Bool y$r_buff1_thd1; [L753] 0 _Bool y$r_buff1_thd2; [L754] 0 _Bool y$r_buff1_thd3; [L755] 0 _Bool y$r_buff1_thd4; [L756] 0 _Bool y$read_delayed; [L757] 0 int *y$read_delayed_var; [L758] 0 int y$w_buff0; [L759] 0 _Bool y$w_buff0_used; [L760] 0 int y$w_buff1; [L761] 0 _Bool y$w_buff1_used; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L864] 0 pthread_t t2417; [L865] FCALL, FORK 0 pthread_create(&t2417, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2417, ((void *)0), P0, ((void *)0))=-2, t2417={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L866] 0 pthread_t t2418; [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] EXPR 1 \read(y) [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L774] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L775] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L776] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L777] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L779] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L780] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L781] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L782] EXPR 1 \read(y) [L782] 1 __unbuffered_p0_EAX = y [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] EXPR 1 \read(y) [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] 1 y = y$flush_delayed ? y$mem_tmp : y [L784] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 1 return 0; [L867] FCALL, FORK 0 pthread_create(&t2418, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2418, ((void *)0), P1, ((void *)0))=-1, t2417={7:0}, t2418={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L868] 0 pthread_t t2419; [L869] FCALL, FORK 0 pthread_create(&t2419, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2419, ((void *)0), P2, ((void *)0))=0, t2417={7:0}, t2418={14:0}, t2419={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L870] 0 pthread_t t2420; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L811] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 3 y$flush_delayed = weak$$choice2 [L817] EXPR 3 \read(y) [L817] 3 y$mem_tmp = y [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] EXPR 3 \read(y) [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L819] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L820] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L821] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L822] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L824] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 \read(y) [L825] 3 __unbuffered_p2_EBX = y [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] EXPR 3 \read(y) [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] 3 y = y$flush_delayed ? y$mem_tmp : y [L827] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L871] FCALL, FORK 0 pthread_create(&t2420, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2420, ((void *)0), P3, ((void *)0))=1, t2417={7:0}, t2418={14:0}, t2419={15:0}, t2420={11:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; [L839] 4 y = 1 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 \read(y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L843] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L844] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L845] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L846] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 \read(y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L878] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L879] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L880] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L881] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2417={7:0}, t2418={14:0}, t2419={15:0}, t2420={11:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L884] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=2, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: -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: -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: -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: -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: -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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 267 locations, 88 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: 281.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 32.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 917 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 607 mSDsluCounter, 480 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 317 mSDsCounter, 123 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2040 IncrementalHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 123 mSolverCounterUnsat, 163 mSDtfsCounter, 2040 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=12, InterpolantAutomatonStates: 49, 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.8s SatisfiabilityAnalysisTime, 222.8s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 1194 SizeOfPredicates, 61 NumberOfNonLiveVariables, 2074 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 12:42:25,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48877903-54d8-4de9-b3b4-7692a6266f58/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