./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de3096cf2a7a81c5a5563cf2e9ae3ddf8f4cc1ab1b483fb6503759d4e39a0a81 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:06:16,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:06:16,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:06:16,680 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:06:16,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:06:16,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:06:16,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:06:16,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:06:16,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:06:16,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:06:16,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:06:16,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:06:16,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:06:16,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:06:16,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:06:16,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:06:16,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:06:16,722 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:06:16,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:06:16,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:06:16,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:06:16,733 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:06:16,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:06:16,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:06:16,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:06:16,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:06:16,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:06:16,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:06:16,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:06:16,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:06:16,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:06:16,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:06:16,760 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:06:16,762 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:06:16,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:06:16,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:06:16,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:06:16,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:06:16,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:06:16,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:06:16,769 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:06:16,770 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:06:16,810 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:06:16,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:06:16,814 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:06:16,815 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:06:16,815 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:06:16,816 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:06:16,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:06:16,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:06:16,817 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:06:16,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:06:16,818 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:06:16,819 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:06:16,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:06:16,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:06:16,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:06:16,820 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:06:16,820 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:06:16,820 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:06:16,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:06:16,821 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:06:16,821 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:06:16,821 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:06:16,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:06:16,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:06:16,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:06:16,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:06:16,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:06:16,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:06:16,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:06:16,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:06:16,824 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:06:16,824 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:06:16,824 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:06:16,824 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_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de3096cf2a7a81c5a5563cf2e9ae3ddf8f4cc1ab1b483fb6503759d4e39a0a81 [2022-11-25 17:06:17,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:06:17,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:06:17,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:06:17,205 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:06:17,206 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:06:17,207 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i [2022-11-25 17:06:20,353 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:06:20,727 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:06:20,728 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i [2022-11-25 17:06:20,744 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/data/58722bdcb/5858e33df5d94e619da832424f02291c/FLAG648fcbb95 [2022-11-25 17:06:20,760 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/data/58722bdcb/5858e33df5d94e619da832424f02291c [2022-11-25 17:06:20,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:06:20,766 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:06:20,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:06:20,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:06:20,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:06:20,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:06:20" (1/1) ... [2022-11-25 17:06:20,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e1b7b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:20, skipping insertion in model container [2022-11-25 17:06:20,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:06:20" (1/1) ... [2022-11-25 17:06:20,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:06:20,857 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:06:21,042 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_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i[993,1006] [2022-11-25 17:06:21,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:06:21,324 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:06:21,338 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_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i[993,1006] [2022-11-25 17:06:21,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:06:21,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:06:21,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:06:21,452 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:06:21,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:21 WrapperNode [2022-11-25 17:06:21,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:06:21,455 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:06:21,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:06:21,455 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:06:21,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:21" (1/1) ... [2022-11-25 17:06:21,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:21" (1/1) ... [2022-11-25 17:06:21,513 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2022-11-25 17:06:21,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:06:21,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:06:21,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:06:21,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:06:21,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:21" (1/1) ... [2022-11-25 17:06:21,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:21" (1/1) ... [2022-11-25 17:06:21,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:21" (1/1) ... [2022-11-25 17:06:21,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:21" (1/1) ... [2022-11-25 17:06:21,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:21" (1/1) ... [2022-11-25 17:06:21,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:21" (1/1) ... [2022-11-25 17:06:21,579 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:21" (1/1) ... [2022-11-25 17:06:21,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:21" (1/1) ... [2022-11-25 17:06:21,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:06:21,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:06:21,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:06:21,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:06:21,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:21" (1/1) ... [2022-11-25 17:06:21,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:06:21,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:06:21,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:06:21,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:06:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:06:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:06:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:06:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:06:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:06:21,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:06:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:06:21,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:06:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:06:21,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:06:21,682 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:06:21,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:06:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:06:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:06:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:06:21,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:06:21,685 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:06:21,857 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:06:21,860 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:06:22,706 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:06:23,357 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:06:23,358 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:06:23,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:06:23 BoogieIcfgContainer [2022-11-25 17:06:23,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:06:23,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:06:23,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:06:23,369 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:06:23,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:06:20" (1/3) ... [2022-11-25 17:06:23,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25507b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:06:23, skipping insertion in model container [2022-11-25 17:06:23,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:06:21" (2/3) ... [2022-11-25 17:06:23,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25507b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:06:23, skipping insertion in model container [2022-11-25 17:06:23,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:06:23" (3/3) ... [2022-11-25 17:06:23,378 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.opt.i [2022-11-25 17:06:23,402 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:06:23,403 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2022-11-25 17:06:23,403 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:06:23,582 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:06:23,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 180 transitions, 375 flow [2022-11-25 17:06:23,828 INFO L130 PetriNetUnfolder]: 2/177 cut-off events. [2022-11-25 17:06:23,831 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:06:23,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 2/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 275 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2022-11-25 17:06:23,844 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 180 transitions, 375 flow [2022-11-25 17:06:23,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 177 transitions, 363 flow [2022-11-25 17:06:23,863 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:06:23,897 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 177 transitions, 363 flow [2022-11-25 17:06:23,902 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 177 transitions, 363 flow [2022-11-25 17:06:23,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 177 transitions, 363 flow [2022-11-25 17:06:24,023 INFO L130 PetriNetUnfolder]: 2/177 cut-off events. [2022-11-25 17:06:24,024 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:06:24,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 2/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 275 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2022-11-25 17:06:24,033 INFO L119 LiptonReduction]: Number of co-enabled transitions 7240 [2022-11-25 17:06:46,671 INFO L134 LiptonReduction]: Checked pairs total: 27260 [2022-11-25 17:06:46,680 INFO L136 LiptonReduction]: Total number of compositions: 184 [2022-11-25 17:06:46,708 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:06:46,722 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;@52471148, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:06:46,723 INFO L358 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2022-11-25 17:06:46,728 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 17:06:46,728 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:06:46,728 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:06:46,729 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:06:46,730 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:06:46,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:46,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1139, now seen corresponding path program 1 times [2022-11-25 17:06:46,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:46,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734079294] [2022-11-25 17:06:46,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:46,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:46,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:46,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734079294] [2022-11-25 17:06:46,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734079294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:46,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:46,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:06:46,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517907598] [2022-11-25 17:06:46,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:46,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:06:46,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:46,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:06:46,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:06:46,956 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 364 [2022-11-25 17:06:46,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 72 transitions, 153 flow. Second operand has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:46,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:06:46,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 364 [2022-11-25 17:06:46,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:06:50,343 INFO L130 PetriNetUnfolder]: 8950/12668 cut-off events. [2022-11-25 17:06:50,343 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-25 17:06:50,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25401 conditions, 12668 events. 8950/12668 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 77681 event pairs, 8950 based on Foata normal form. 0/6230 useless extension candidates. Maximal degree in co-relation 25390. Up to 12657 conditions per place. [2022-11-25 17:06:50,452 INFO L137 encePairwiseOnDemand]: 332/364 looper letters, 38 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2022-11-25 17:06:50,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 165 flow [2022-11-25 17:06:50,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:06:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:06:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 328 transitions. [2022-11-25 17:06:50,468 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45054945054945056 [2022-11-25 17:06:50,469 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 328 transitions. [2022-11-25 17:06:50,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 328 transitions. [2022-11-25 17:06:50,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:06:50,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 328 transitions. [2022-11-25 17:06:50,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:50,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:50,486 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 364.0) internal successors, (1092), 3 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:50,488 INFO L175 Difference]: Start difference. First operand has 81 places, 72 transitions, 153 flow. Second operand 2 states and 328 transitions. [2022-11-25 17:06:50,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 165 flow [2022-11-25 17:06:50,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:06:50,496 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 86 flow [2022-11-25 17:06:50,498 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-11-25 17:06:50,502 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -33 predicate places. [2022-11-25 17:06:50,503 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 86 flow [2022-11-25 17:06:50,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:50,503 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:06:50,504 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:06:50,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:06:50,504 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:06:50,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1123250, now seen corresponding path program 1 times [2022-11-25 17:06:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:50,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833915562] [2022-11-25 17:06:50,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:50,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:50,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:50,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:50,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833915562] [2022-11-25 17:06:50,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833915562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:50,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:50,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:06:50,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527964001] [2022-11-25 17:06:50,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:50,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:06:50,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:50,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:06:50,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:06:50,891 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 364 [2022-11-25 17:06:50,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:50,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:06:50,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 364 [2022-11-25 17:06:50,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:06:52,715 INFO L130 PetriNetUnfolder]: 4344/6247 cut-off events. [2022-11-25 17:06:52,716 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:06:52,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12537 conditions, 6247 events. 4344/6247 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 34928 event pairs, 4344 based on Foata normal form. 0/3773 useless extension candidates. Maximal degree in co-relation 12534. Up to 6237 conditions per place. [2022-11-25 17:06:52,762 INFO L137 encePairwiseOnDemand]: 358/364 looper letters, 32 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2022-11-25 17:06:52,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 142 flow [2022-11-25 17:06:52,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:06:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:06:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2022-11-25 17:06:52,769 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38644688644688646 [2022-11-25 17:06:52,770 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2022-11-25 17:06:52,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2022-11-25 17:06:52,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:06:52,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2022-11-25 17:06:52,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:52,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:52,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:52,780 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 86 flow. Second operand 3 states and 422 transitions. [2022-11-25 17:06:52,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 142 flow [2022-11-25 17:06:52,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:06:52,782 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2022-11-25 17:06:52,782 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-11-25 17:06:52,783 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -36 predicate places. [2022-11-25 17:06:52,783 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow [2022-11-25 17:06:52,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:52,785 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:06:52,785 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:06:52,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:06:52,785 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:06:52,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:52,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1123249, now seen corresponding path program 1 times [2022-11-25 17:06:52,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:52,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946040156] [2022-11-25 17:06:52,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:52,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:52,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:52,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946040156] [2022-11-25 17:06:52,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946040156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:52,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:52,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:06:52,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649728408] [2022-11-25 17:06:52,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:52,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:06:52,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:52,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:06:52,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:06:52,992 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 364 [2022-11-25 17:06:52,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:52,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:06:52,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 364 [2022-11-25 17:06:52,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:06:54,554 INFO L130 PetriNetUnfolder]: 2811/4345 cut-off events. [2022-11-25 17:06:54,555 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:06:54,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8659 conditions, 4345 events. 2811/4345 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 25126 event pairs, 1669 based on Foata normal form. 0/3279 useless extension candidates. Maximal degree in co-relation 8655. Up to 2451 conditions per place. [2022-11-25 17:06:54,588 INFO L137 encePairwiseOnDemand]: 350/364 looper letters, 35 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2022-11-25 17:06:54,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 184 flow [2022-11-25 17:06:54,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:06:54,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:06:54,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2022-11-25 17:06:54,591 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3882783882783883 [2022-11-25 17:06:54,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2022-11-25 17:06:54,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2022-11-25 17:06:54,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:06:54,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2022-11-25 17:06:54,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:54,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:54,598 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:54,598 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 3 states and 424 transitions. [2022-11-25 17:06:54,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 184 flow [2022-11-25 17:06:54,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 183 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:06:54,600 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 137 flow [2022-11-25 17:06:54,600 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2022-11-25 17:06:54,601 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -35 predicate places. [2022-11-25 17:06:54,601 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 137 flow [2022-11-25 17:06:54,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:54,602 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:06:54,602 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:54,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:06:54,603 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:06:54,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:54,603 INFO L85 PathProgramCache]: Analyzing trace with hash 182162521, now seen corresponding path program 1 times [2022-11-25 17:06:54,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:54,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941860570] [2022-11-25 17:06:54,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:54,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:54,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:54,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941860570] [2022-11-25 17:06:54,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941860570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:54,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:54,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:06:54,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743692835] [2022-11-25 17:06:54,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:54,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:06:54,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:54,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:06:54,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:06:54,787 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 364 [2022-11-25 17:06:54,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:54,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:06:54,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 364 [2022-11-25 17:06:54,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:06:55,768 INFO L130 PetriNetUnfolder]: 2322/3612 cut-off events. [2022-11-25 17:06:55,768 INFO L131 PetriNetUnfolder]: For 1093/1093 co-relation queries the response was YES. [2022-11-25 17:06:55,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9716 conditions, 3612 events. 2322/3612 cut-off events. For 1093/1093 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 21116 event pairs, 405 based on Foata normal form. 0/3168 useless extension candidates. Maximal degree in co-relation 9711. Up to 2976 conditions per place. [2022-11-25 17:06:55,793 INFO L137 encePairwiseOnDemand]: 361/364 looper letters, 56 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2022-11-25 17:06:55,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 333 flow [2022-11-25 17:06:55,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:06:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:06:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2022-11-25 17:06:55,795 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3956043956043956 [2022-11-25 17:06:55,796 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2022-11-25 17:06:55,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2022-11-25 17:06:55,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:06:55,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2022-11-25 17:06:55,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:55,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:55,801 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:55,801 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 137 flow. Second operand 3 states and 432 transitions. [2022-11-25 17:06:55,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 333 flow [2022-11-25 17:06:55,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:06:55,814 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 123 flow [2022-11-25 17:06:55,814 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=123, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-11-25 17:06:55,815 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -36 predicate places. [2022-11-25 17:06:55,815 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 123 flow [2022-11-25 17:06:55,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:55,816 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:06:55,816 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:55,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:06:55,816 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:06:55,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:55,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1352074345, now seen corresponding path program 1 times [2022-11-25 17:06:55,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:55,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938373236] [2022-11-25 17:06:55,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:55,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:55,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:55,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938373236] [2022-11-25 17:06:55,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938373236] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:55,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:55,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:06:55,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821804192] [2022-11-25 17:06:55,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:55,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:06:55,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:55,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:06:55,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:06:55,930 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 364 [2022-11-25 17:06:55,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:55,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:06:55,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 364 [2022-11-25 17:06:55,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:06:56,758 INFO L130 PetriNetUnfolder]: 2242/3611 cut-off events. [2022-11-25 17:06:56,758 INFO L131 PetriNetUnfolder]: For 616/621 co-relation queries the response was YES. [2022-11-25 17:06:56,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9135 conditions, 3611 events. 2242/3611 cut-off events. For 616/621 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 21639 event pairs, 952 based on Foata normal form. 0/2906 useless extension candidates. Maximal degree in co-relation 9130. Up to 2279 conditions per place. [2022-11-25 17:06:56,781 INFO L137 encePairwiseOnDemand]: 360/364 looper letters, 61 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2022-11-25 17:06:56,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 341 flow [2022-11-25 17:06:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:06:56,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:06:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2022-11-25 17:06:56,783 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40201465201465203 [2022-11-25 17:06:56,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2022-11-25 17:06:56,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2022-11-25 17:06:56,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:06:56,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2022-11-25 17:06:56,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:56,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:56,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:56,789 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 123 flow. Second operand 3 states and 439 transitions. [2022-11-25 17:06:56,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 341 flow [2022-11-25 17:06:56,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 66 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:06:56,792 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 132 flow [2022-11-25 17:06:56,793 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-11-25 17:06:56,793 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -35 predicate places. [2022-11-25 17:06:56,794 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 132 flow [2022-11-25 17:06:56,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:56,794 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:06:56,794 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:56,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:06:56,795 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:06:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:56,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1035367472, now seen corresponding path program 1 times [2022-11-25 17:06:56,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:56,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519683235] [2022-11-25 17:06:56,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:56,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:57,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:57,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519683235] [2022-11-25 17:06:57,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519683235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:57,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:57,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:06:57,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689647012] [2022-11-25 17:06:57,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:57,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:06:57,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:57,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:06:57,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:06:57,230 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 364 [2022-11-25 17:06:57,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:57,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:06:57,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 364 [2022-11-25 17:06:57,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:06:58,127 INFO L130 PetriNetUnfolder]: 3298/5337 cut-off events. [2022-11-25 17:06:58,127 INFO L131 PetriNetUnfolder]: For 994/999 co-relation queries the response was YES. [2022-11-25 17:06:58,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13670 conditions, 5337 events. 3298/5337 cut-off events. For 994/999 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 35090 event pairs, 1771 based on Foata normal form. 0/4526 useless extension candidates. Maximal degree in co-relation 13664. Up to 2944 conditions per place. [2022-11-25 17:06:58,160 INFO L137 encePairwiseOnDemand]: 359/364 looper letters, 61 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2022-11-25 17:06:58,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 68 transitions, 358 flow [2022-11-25 17:06:58,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:06:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:06:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 552 transitions. [2022-11-25 17:06:58,163 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3791208791208791 [2022-11-25 17:06:58,163 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 552 transitions. [2022-11-25 17:06:58,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 552 transitions. [2022-11-25 17:06:58,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:06:58,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 552 transitions. [2022-11-25 17:06:58,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:58,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:58,170 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:58,170 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 132 flow. Second operand 4 states and 552 transitions. [2022-11-25 17:06:58,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 68 transitions, 358 flow [2022-11-25 17:06:58,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:06:58,174 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 150 flow [2022-11-25 17:06:58,174 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-11-25 17:06:58,175 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -33 predicate places. [2022-11-25 17:06:58,175 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 150 flow [2022-11-25 17:06:58,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:58,176 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:06:58,176 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:58,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:06:58,176 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:06:58,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:58,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1035367473, now seen corresponding path program 1 times [2022-11-25 17:06:58,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:58,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504873820] [2022-11-25 17:06:58,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:58,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:58,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:58,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:58,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504873820] [2022-11-25 17:06:58,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504873820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:58,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:58,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:06:58,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640229414] [2022-11-25 17:06:58,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:58,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:06:58,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:58,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:06:58,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:06:58,366 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 364 [2022-11-25 17:06:58,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:58,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:06:58,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 364 [2022-11-25 17:06:58,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:06:59,404 INFO L130 PetriNetUnfolder]: 3358/5417 cut-off events. [2022-11-25 17:06:59,404 INFO L131 PetriNetUnfolder]: For 1848/1853 co-relation queries the response was YES. [2022-11-25 17:06:59,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14000 conditions, 5417 events. 3358/5417 cut-off events. For 1848/1853 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 35563 event pairs, 1574 based on Foata normal form. 64/4667 useless extension candidates. Maximal degree in co-relation 13993. Up to 3471 conditions per place. [2022-11-25 17:06:59,437 INFO L137 encePairwiseOnDemand]: 358/364 looper letters, 51 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2022-11-25 17:06:59,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 318 flow [2022-11-25 17:06:59,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:06:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:06:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2022-11-25 17:06:59,440 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3873626373626374 [2022-11-25 17:06:59,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2022-11-25 17:06:59,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2022-11-25 17:06:59,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:06:59,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2022-11-25 17:06:59,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:59,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:59,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:59,446 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 150 flow. Second operand 3 states and 423 transitions. [2022-11-25 17:06:59,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 318 flow [2022-11-25 17:06:59,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:06:59,449 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 182 flow [2022-11-25 17:06:59,449 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2022-11-25 17:06:59,450 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -33 predicate places. [2022-11-25 17:06:59,450 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 182 flow [2022-11-25 17:06:59,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:06:59,451 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:06:59,451 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:06:59,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:06:59,451 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:06:59,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:06:59,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1908191072, now seen corresponding path program 2 times [2022-11-25 17:06:59,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:06:59,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545372829] [2022-11-25 17:06:59,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:06:59,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:06:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:06:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:06:59,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:06:59,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545372829] [2022-11-25 17:06:59,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545372829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:06:59,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:06:59,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:06:59,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733442284] [2022-11-25 17:06:59,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:06:59,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:06:59,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:06:59,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:06:59,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:00,102 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 364 [2022-11-25 17:07:00,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:00,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:00,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 364 [2022-11-25 17:07:00,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:01,329 INFO L130 PetriNetUnfolder]: 3294/5317 cut-off events. [2022-11-25 17:07:01,330 INFO L131 PetriNetUnfolder]: For 3209/3214 co-relation queries the response was YES. [2022-11-25 17:07:01,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14829 conditions, 5317 events. 3294/5317 cut-off events. For 3209/3214 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 34695 event pairs, 1098 based on Foata normal form. 32/4535 useless extension candidates. Maximal degree in co-relation 14821. Up to 2292 conditions per place. [2022-11-25 17:07:01,361 INFO L137 encePairwiseOnDemand]: 357/364 looper letters, 66 selfloop transitions, 7 changer transitions 0/75 dead transitions. [2022-11-25 17:07:01,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 75 transitions, 430 flow [2022-11-25 17:07:01,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:07:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:07:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2022-11-25 17:07:01,365 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3747252747252747 [2022-11-25 17:07:01,366 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2022-11-25 17:07:01,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2022-11-25 17:07:01,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:01,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2022-11-25 17:07:01,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:01,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:01,374 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:01,374 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 182 flow. Second operand 5 states and 682 transitions. [2022-11-25 17:07:01,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 75 transitions, 430 flow [2022-11-25 17:07:01,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:07:01,385 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 181 flow [2022-11-25 17:07:01,385 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2022-11-25 17:07:01,386 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -32 predicate places. [2022-11-25 17:07:01,386 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 181 flow [2022-11-25 17:07:01,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.2) internal successors, (631), 5 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:01,387 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:01,387 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:01,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:07:01,388 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:07:01,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1035372174, now seen corresponding path program 1 times [2022-11-25 17:07:01,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:01,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011227961] [2022-11-25 17:07:01,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:01,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:07:01,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:01,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011227961] [2022-11-25 17:07:01,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011227961] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:01,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:01,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:07:01,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671226103] [2022-11-25 17:07:01,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:01,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:01,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:01,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:01,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:01,722 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 364 [2022-11-25 17:07:01,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:01,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:01,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 364 [2022-11-25 17:07:01,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:02,930 INFO L130 PetriNetUnfolder]: 4784/7506 cut-off events. [2022-11-25 17:07:02,930 INFO L131 PetriNetUnfolder]: For 4552/4552 co-relation queries the response was YES. [2022-11-25 17:07:02,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20349 conditions, 7506 events. 4784/7506 cut-off events. For 4552/4552 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 47162 event pairs, 2641 based on Foata normal form. 0/6409 useless extension candidates. Maximal degree in co-relation 20342. Up to 7184 conditions per place. [2022-11-25 17:07:02,970 INFO L137 encePairwiseOnDemand]: 360/364 looper letters, 62 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2022-11-25 17:07:02,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 417 flow [2022-11-25 17:07:02,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:07:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2022-11-25 17:07:02,973 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3956043956043956 [2022-11-25 17:07:02,973 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2022-11-25 17:07:02,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2022-11-25 17:07:02,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:02,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2022-11-25 17:07:02,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:02,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:02,978 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:02,978 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 181 flow. Second operand 3 states and 432 transitions. [2022-11-25 17:07:02,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 417 flow [2022-11-25 17:07:02,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 403 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:07:02,991 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 209 flow [2022-11-25 17:07:02,992 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=209, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2022-11-25 17:07:02,993 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -32 predicate places. [2022-11-25 17:07:02,994 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 209 flow [2022-11-25 17:07:02,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:02,997 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:02,997 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:02,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:07:02,999 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:07:02,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:03,000 INFO L85 PathProgramCache]: Analyzing trace with hash -2031767689, now seen corresponding path program 1 times [2022-11-25 17:07:03,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:03,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259364350] [2022-11-25 17:07:03,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:03,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:07:03,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:03,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259364350] [2022-11-25 17:07:03,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259364350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:03,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:03,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:07:03,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513564364] [2022-11-25 17:07:03,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:03,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:03,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:03,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:03,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:03,347 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 364 [2022-11-25 17:07:03,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:03,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:03,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 364 [2022-11-25 17:07:03,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:04,411 INFO L130 PetriNetUnfolder]: 4762/7754 cut-off events. [2022-11-25 17:07:04,412 INFO L131 PetriNetUnfolder]: For 4591/4591 co-relation queries the response was YES. [2022-11-25 17:07:04,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21280 conditions, 7754 events. 4762/7754 cut-off events. For 4591/4591 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 51633 event pairs, 1100 based on Foata normal form. 8/6776 useless extension candidates. Maximal degree in co-relation 21272. Up to 6907 conditions per place. [2022-11-25 17:07:04,453 INFO L137 encePairwiseOnDemand]: 360/364 looper letters, 70 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2022-11-25 17:07:04,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 75 transitions, 481 flow [2022-11-25 17:07:04,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:07:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-11-25 17:07:04,456 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39377289377289376 [2022-11-25 17:07:04,456 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2022-11-25 17:07:04,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2022-11-25 17:07:04,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:04,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2022-11-25 17:07:04,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:04,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:04,462 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:04,462 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 209 flow. Second operand 3 states and 430 transitions. [2022-11-25 17:07:04,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 75 transitions, 481 flow [2022-11-25 17:07:04,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:07:04,477 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 229 flow [2022-11-25 17:07:04,477 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2022-11-25 17:07:04,478 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -30 predicate places. [2022-11-25 17:07:04,478 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 229 flow [2022-11-25 17:07:04,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:04,479 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:04,479 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:04,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:07:04,479 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:07:04,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:04,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2031768433, now seen corresponding path program 1 times [2022-11-25 17:07:04,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:04,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463921982] [2022-11-25 17:07:04,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:04,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:04,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:07:04,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:04,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463921982] [2022-11-25 17:07:04,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463921982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:04,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:04,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:07:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584715964] [2022-11-25 17:07:04,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:04,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:04,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:04,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:04,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:04,694 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 364 [2022-11-25 17:07:04,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:04,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:04,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 364 [2022-11-25 17:07:04,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:05,781 INFO L130 PetriNetUnfolder]: 4912/7792 cut-off events. [2022-11-25 17:07:05,781 INFO L131 PetriNetUnfolder]: For 5867/5867 co-relation queries the response was YES. [2022-11-25 17:07:05,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23031 conditions, 7792 events. 4912/7792 cut-off events. For 5867/5867 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 50207 event pairs, 1408 based on Foata normal form. 44/6746 useless extension candidates. Maximal degree in co-relation 23022. Up to 5623 conditions per place. [2022-11-25 17:07:05,823 INFO L137 encePairwiseOnDemand]: 361/364 looper letters, 71 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2022-11-25 17:07:05,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 75 transitions, 505 flow [2022-11-25 17:07:05,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:07:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-11-25 17:07:05,826 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-11-25 17:07:05,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2022-11-25 17:07:05,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2022-11-25 17:07:05,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:05,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2022-11-25 17:07:05,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:05,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:05,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:05,832 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 229 flow. Second operand 3 states and 429 transitions. [2022-11-25 17:07:05,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 75 transitions, 505 flow [2022-11-25 17:07:05,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:07:05,847 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 233 flow [2022-11-25 17:07:05,847 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2022-11-25 17:07:05,848 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -28 predicate places. [2022-11-25 17:07:05,848 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 233 flow [2022-11-25 17:07:05,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:05,848 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:05,849 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:05,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:07:05,849 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:07:05,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:05,850 INFO L85 PathProgramCache]: Analyzing trace with hash 243433224, now seen corresponding path program 1 times [2022-11-25 17:07:05,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:05,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106403512] [2022-11-25 17:07:05,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:05,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:06,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:07:06,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:06,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106403512] [2022-11-25 17:07:06,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106403512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:06,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:06,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:07:06,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086987354] [2022-11-25 17:07:06,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:06,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:06,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:06,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:06,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:06,092 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 364 [2022-11-25 17:07:06,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:06,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:06,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 364 [2022-11-25 17:07:06,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:07,387 INFO L130 PetriNetUnfolder]: 4044/6597 cut-off events. [2022-11-25 17:07:07,387 INFO L131 PetriNetUnfolder]: For 5058/5058 co-relation queries the response was YES. [2022-11-25 17:07:07,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19656 conditions, 6597 events. 4044/6597 cut-off events. For 5058/5058 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 44013 event pairs, 2341 based on Foata normal form. 12/5663 useless extension candidates. Maximal degree in co-relation 19646. Up to 5171 conditions per place. [2022-11-25 17:07:07,425 INFO L137 encePairwiseOnDemand]: 361/364 looper letters, 63 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2022-11-25 17:07:07,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 71 transitions, 455 flow [2022-11-25 17:07:07,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:07:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2022-11-25 17:07:07,428 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4010989010989011 [2022-11-25 17:07:07,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2022-11-25 17:07:07,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2022-11-25 17:07:07,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:07,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2022-11-25 17:07:07,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-11-25 17:07:07,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:07,437 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:07,437 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 233 flow. Second operand 3 states and 438 transitions. [2022-11-25 17:07:07,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 71 transitions, 455 flow [2022-11-25 17:07:07,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 451 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:07:07,457 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 246 flow [2022-11-25 17:07:07,458 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-11-25 17:07:07,458 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -27 predicate places. [2022-11-25 17:07:07,459 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 246 flow [2022-11-25 17:07:07,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:07,459 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:07,459 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:07,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:07:07,460 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:07:07,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:07,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1439746478, now seen corresponding path program 1 times [2022-11-25 17:07:07,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:07,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367224400] [2022-11-25 17:07:07,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:07,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:07,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:07:07,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:07,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367224400] [2022-11-25 17:07:07,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367224400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:07,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:07,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:07:07,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397254487] [2022-11-25 17:07:07,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:07,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:07:07,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:07,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:07:07,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:07,959 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 364 [2022-11-25 17:07:07,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:07,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:07,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 364 [2022-11-25 17:07:07,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:09,059 INFO L130 PetriNetUnfolder]: 3621/5839 cut-off events. [2022-11-25 17:07:09,059 INFO L131 PetriNetUnfolder]: For 6015/6015 co-relation queries the response was YES. [2022-11-25 17:07:09,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17916 conditions, 5839 events. 3621/5839 cut-off events. For 6015/6015 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 37775 event pairs, 650 based on Foata normal form. 16/5029 useless extension candidates. Maximal degree in co-relation 17905. Up to 2279 conditions per place. [2022-11-25 17:07:09,089 INFO L137 encePairwiseOnDemand]: 352/364 looper letters, 70 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2022-11-25 17:07:09,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 89 transitions, 666 flow [2022-11-25 17:07:09,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:07:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:07:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2022-11-25 17:07:09,092 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.36428571428571427 [2022-11-25 17:07:09,093 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2022-11-25 17:07:09,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2022-11-25 17:07:09,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:09,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2022-11-25 17:07:09,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:09,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:09,100 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:09,100 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 246 flow. Second operand 5 states and 663 transitions. [2022-11-25 17:07:09,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 89 transitions, 666 flow [2022-11-25 17:07:09,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 89 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:07:09,115 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 363 flow [2022-11-25 17:07:09,116 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=363, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2022-11-25 17:07:09,116 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -22 predicate places. [2022-11-25 17:07:09,117 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 363 flow [2022-11-25 17:07:09,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:09,117 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:09,117 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:09,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:07:09,118 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:07:09,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:09,118 INFO L85 PathProgramCache]: Analyzing trace with hash 933065581, now seen corresponding path program 1 times [2022-11-25 17:07:09,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:09,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289998121] [2022-11-25 17:07:09,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:09,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:07:09,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:09,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289998121] [2022-11-25 17:07:09,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289998121] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:09,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:09,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:07:09,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743117754] [2022-11-25 17:07:09,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:09,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:09,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:09,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:09,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:09,358 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 364 [2022-11-25 17:07:09,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:09,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:09,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 364 [2022-11-25 17:07:09,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:09,870 INFO L130 PetriNetUnfolder]: 1474/2659 cut-off events. [2022-11-25 17:07:09,871 INFO L131 PetriNetUnfolder]: For 3399/3399 co-relation queries the response was YES. [2022-11-25 17:07:09,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9211 conditions, 2659 events. 1474/2659 cut-off events. For 3399/3399 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 16555 event pairs, 399 based on Foata normal form. 39/2448 useless extension candidates. Maximal degree in co-relation 9198. Up to 2437 conditions per place. [2022-11-25 17:07:09,889 INFO L137 encePairwiseOnDemand]: 359/364 looper letters, 66 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2022-11-25 17:07:09,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 587 flow [2022-11-25 17:07:09,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:07:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2022-11-25 17:07:09,892 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38278388278388276 [2022-11-25 17:07:09,892 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2022-11-25 17:07:09,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2022-11-25 17:07:09,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:09,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2022-11-25 17:07:09,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:09,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:09,897 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:09,898 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 363 flow. Second operand 3 states and 418 transitions. [2022-11-25 17:07:09,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 587 flow [2022-11-25 17:07:09,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 587 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:07:09,908 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 389 flow [2022-11-25 17:07:09,909 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2022-11-25 17:07:09,909 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -19 predicate places. [2022-11-25 17:07:09,909 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 389 flow [2022-11-25 17:07:09,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:09,910 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:09,910 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:09,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:07:09,911 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:07:09,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:09,911 INFO L85 PathProgramCache]: Analyzing trace with hash -664935263, now seen corresponding path program 1 times [2022-11-25 17:07:09,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:09,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406852896] [2022-11-25 17:07:09,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:09,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:07:10,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:10,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406852896] [2022-11-25 17:07:10,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406852896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:10,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:10,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:07:10,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445449475] [2022-11-25 17:07:10,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:10,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:07:10,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:10,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:07:10,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:07:10,210 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 364 [2022-11-25 17:07:10,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:10,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:10,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 364 [2022-11-25 17:07:10,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:10,520 INFO L130 PetriNetUnfolder]: 362/775 cut-off events. [2022-11-25 17:07:10,521 INFO L131 PetriNetUnfolder]: For 1061/1061 co-relation queries the response was YES. [2022-11-25 17:07:10,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2874 conditions, 775 events. 362/775 cut-off events. For 1061/1061 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4023 event pairs, 82 based on Foata normal form. 46/774 useless extension candidates. Maximal degree in co-relation 2859. Up to 413 conditions per place. [2022-11-25 17:07:10,526 INFO L137 encePairwiseOnDemand]: 359/364 looper letters, 70 selfloop transitions, 7 changer transitions 1/81 dead transitions. [2022-11-25 17:07:10,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 81 transitions, 632 flow [2022-11-25 17:07:10,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:07:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:07:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2022-11-25 17:07:10,529 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3804945054945055 [2022-11-25 17:07:10,529 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2022-11-25 17:07:10,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2022-11-25 17:07:10,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:10,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2022-11-25 17:07:10,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:10,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:10,535 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 364.0) internal successors, (1820), 5 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:10,535 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 389 flow. Second operand 4 states and 554 transitions. [2022-11-25 17:07:10,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 81 transitions, 632 flow [2022-11-25 17:07:10,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 81 transitions, 628 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:07:10,541 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 368 flow [2022-11-25 17:07:10,541 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=368, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2022-11-25 17:07:10,542 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -16 predicate places. [2022-11-25 17:07:10,542 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 368 flow [2022-11-25 17:07:10,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:10,543 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:10,543 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:10,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:07:10,543 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:07:10,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:10,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1275011162, now seen corresponding path program 1 times [2022-11-25 17:07:10,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:10,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285676843] [2022-11-25 17:07:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:10,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:07:14,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:14,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285676843] [2022-11-25 17:07:14,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285676843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:14,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:14,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:07:14,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320863371] [2022-11-25 17:07:14,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:14,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:07:14,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:14,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:07:14,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:07:14,471 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 364 [2022-11-25 17:07:14,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 368 flow. Second operand has 9 states, 9 states have (on average 112.77777777777777) internal successors, (1015), 9 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:14,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:14,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 364 [2022-11-25 17:07:14,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:15,438 INFO L130 PetriNetUnfolder]: 407/871 cut-off events. [2022-11-25 17:07:15,439 INFO L131 PetriNetUnfolder]: For 1700/1700 co-relation queries the response was YES. [2022-11-25 17:07:15,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3393 conditions, 871 events. 407/871 cut-off events. For 1700/1700 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4630 event pairs, 69 based on Foata normal form. 2/829 useless extension candidates. Maximal degree in co-relation 3377. Up to 532 conditions per place. [2022-11-25 17:07:15,443 INFO L137 encePairwiseOnDemand]: 352/364 looper letters, 104 selfloop transitions, 30 changer transitions 1/138 dead transitions. [2022-11-25 17:07:15,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 138 transitions, 1113 flow [2022-11-25 17:07:15,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:07:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 17:07:15,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1313 transitions. [2022-11-25 17:07:15,449 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.32792207792207795 [2022-11-25 17:07:15,449 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1313 transitions. [2022-11-25 17:07:15,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1313 transitions. [2022-11-25 17:07:15,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:15,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1313 transitions. [2022-11-25 17:07:15,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.36363636363636) internal successors, (1313), 11 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:15,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 364.0) internal successors, (4368), 12 states have internal predecessors, (4368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:15,462 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 364.0) internal successors, (4368), 12 states have internal predecessors, (4368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:15,462 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 368 flow. Second operand 11 states and 1313 transitions. [2022-11-25 17:07:15,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 138 transitions, 1113 flow [2022-11-25 17:07:15,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 138 transitions, 1059 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-11-25 17:07:15,471 INFO L231 Difference]: Finished difference. Result has 77 places, 84 transitions, 614 flow [2022-11-25 17:07:15,472 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=614, PETRI_PLACES=77, PETRI_TRANSITIONS=84} [2022-11-25 17:07:15,472 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -4 predicate places. [2022-11-25 17:07:15,472 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 84 transitions, 614 flow [2022-11-25 17:07:15,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.77777777777777) internal successors, (1015), 9 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:15,473 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:15,474 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:15,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:07:15,474 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:07:15,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:15,475 INFO L85 PathProgramCache]: Analyzing trace with hash -966053410, now seen corresponding path program 2 times [2022-11-25 17:07:15,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:15,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819574997] [2022-11-25 17:07:15,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:15,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:07:18,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:18,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819574997] [2022-11-25 17:07:18,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819574997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:18,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:18,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:07:18,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532380933] [2022-11-25 17:07:18,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:18,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:07:18,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:18,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:07:18,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:07:18,815 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 364 [2022-11-25 17:07:18,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 84 transitions, 614 flow. Second operand has 10 states, 10 states have (on average 112.6) internal successors, (1126), 10 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:18,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:18,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 364 [2022-11-25 17:07:18,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:21,052 INFO L130 PetriNetUnfolder]: 622/1301 cut-off events. [2022-11-25 17:07:21,052 INFO L131 PetriNetUnfolder]: For 3066/3066 co-relation queries the response was YES. [2022-11-25 17:07:21,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5523 conditions, 1301 events. 622/1301 cut-off events. For 3066/3066 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7614 event pairs, 64 based on Foata normal form. 5/1237 useless extension candidates. Maximal degree in co-relation 5503. Up to 582 conditions per place. [2022-11-25 17:07:21,064 INFO L137 encePairwiseOnDemand]: 351/364 looper letters, 223 selfloop transitions, 71 changer transitions 0/297 dead transitions. [2022-11-25 17:07:21,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 297 transitions, 2509 flow [2022-11-25 17:07:21,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 17:07:21,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-25 17:07:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2740 transitions. [2022-11-25 17:07:21,073 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.327281414237936 [2022-11-25 17:07:21,073 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2740 transitions. [2022-11-25 17:07:21,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2740 transitions. [2022-11-25 17:07:21,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:21,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2740 transitions. [2022-11-25 17:07:21,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 119.1304347826087) internal successors, (2740), 23 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:21,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 364.0) internal successors, (8736), 24 states have internal predecessors, (8736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:21,109 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 364.0) internal successors, (8736), 24 states have internal predecessors, (8736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:21,118 INFO L175 Difference]: Start difference. First operand has 77 places, 84 transitions, 614 flow. Second operand 23 states and 2740 transitions. [2022-11-25 17:07:21,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 297 transitions, 2509 flow [2022-11-25 17:07:21,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 297 transitions, 2493 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-11-25 17:07:21,137 INFO L231 Difference]: Finished difference. Result has 109 places, 143 transitions, 1316 flow [2022-11-25 17:07:21,137 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1316, PETRI_PLACES=109, PETRI_TRANSITIONS=143} [2022-11-25 17:07:21,138 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, 28 predicate places. [2022-11-25 17:07:21,138 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 143 transitions, 1316 flow [2022-11-25 17:07:21,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 112.6) internal successors, (1126), 10 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:21,139 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:21,140 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:21,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 17:07:21,140 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:07:21,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:21,140 INFO L85 PathProgramCache]: Analyzing trace with hash 960276866, now seen corresponding path program 3 times [2022-11-25 17:07:21,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:21,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793310342] [2022-11-25 17:07:21,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:21,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:07:21,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:21,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793310342] [2022-11-25 17:07:21,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793310342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:21,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:21,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:07:21,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003747447] [2022-11-25 17:07:21,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:21,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:07:21,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:21,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:07:21,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:07:21,368 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 364 [2022-11-25 17:07:21,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 143 transitions, 1316 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:21,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:21,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 364 [2022-11-25 17:07:21,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:21,942 INFO L130 PetriNetUnfolder]: 1035/2093 cut-off events. [2022-11-25 17:07:21,942 INFO L131 PetriNetUnfolder]: For 8095/8105 co-relation queries the response was YES. [2022-11-25 17:07:21,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10028 conditions, 2093 events. 1035/2093 cut-off events. For 8095/8105 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13311 event pairs, 222 based on Foata normal form. 16/1996 useless extension candidates. Maximal degree in co-relation 9996. Up to 1048 conditions per place. [2022-11-25 17:07:21,955 INFO L137 encePairwiseOnDemand]: 361/364 looper letters, 240 selfloop transitions, 3 changer transitions 0/244 dead transitions. [2022-11-25 17:07:21,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 244 transitions, 2678 flow [2022-11-25 17:07:21,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:07:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:07:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2022-11-25 17:07:21,958 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3946886446886447 [2022-11-25 17:07:21,958 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2022-11-25 17:07:21,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2022-11-25 17:07:21,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:21,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2022-11-25 17:07:21,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:21,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:21,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 364.0) internal successors, (1456), 4 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:21,962 INFO L175 Difference]: Start difference. First operand has 109 places, 143 transitions, 1316 flow. Second operand 3 states and 431 transitions. [2022-11-25 17:07:21,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 244 transitions, 2678 flow [2022-11-25 17:07:22,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 244 transitions, 2552 flow, removed 63 selfloop flow, removed 0 redundant places. [2022-11-25 17:07:22,005 INFO L231 Difference]: Finished difference. Result has 112 places, 143 transitions, 1251 flow [2022-11-25 17:07:22,006 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1251, PETRI_PLACES=112, PETRI_TRANSITIONS=143} [2022-11-25 17:07:22,006 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, 31 predicate places. [2022-11-25 17:07:22,006 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 143 transitions, 1251 flow [2022-11-25 17:07:22,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:22,007 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:22,007 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:22,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 17:07:22,007 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:07:22,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:22,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1487549187, now seen corresponding path program 1 times [2022-11-25 17:07:22,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:22,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722547661] [2022-11-25 17:07:22,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:22,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:07:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:07:22,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:07:22,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722547661] [2022-11-25 17:07:22,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722547661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:07:22,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:07:22,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:07:22,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367562936] [2022-11-25 17:07:22,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:07:22,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:07:22,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:07:22,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:07:22,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:07:22,324 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 364 [2022-11-25 17:07:22,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 143 transitions, 1251 flow. Second operand has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:22,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:07:22,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 364 [2022-11-25 17:07:22,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:07:22,705 INFO L130 PetriNetUnfolder]: 483/953 cut-off events. [2022-11-25 17:07:22,706 INFO L131 PetriNetUnfolder]: For 3514/3522 co-relation queries the response was YES. [2022-11-25 17:07:22,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4368 conditions, 953 events. 483/953 cut-off events. For 3514/3522 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5573 event pairs, 48 based on Foata normal form. 46/990 useless extension candidates. Maximal degree in co-relation 4334. Up to 441 conditions per place. [2022-11-25 17:07:22,714 INFO L137 encePairwiseOnDemand]: 359/364 looper letters, 138 selfloop transitions, 10 changer transitions 1/152 dead transitions. [2022-11-25 17:07:22,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 152 transitions, 1587 flow [2022-11-25 17:07:22,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:07:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:07:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 675 transitions. [2022-11-25 17:07:22,717 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3708791208791209 [2022-11-25 17:07:22,717 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 675 transitions. [2022-11-25 17:07:22,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 675 transitions. [2022-11-25 17:07:22,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:07:22,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 675 transitions. [2022-11-25 17:07:22,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:22,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:22,723 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:22,723 INFO L175 Difference]: Start difference. First operand has 112 places, 143 transitions, 1251 flow. Second operand 5 states and 675 transitions. [2022-11-25 17:07:22,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 152 transitions, 1587 flow [2022-11-25 17:07:22,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 152 transitions, 1266 flow, removed 47 selfloop flow, removed 20 redundant places. [2022-11-25 17:07:22,735 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 500 flow [2022-11-25 17:07:22,735 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=500, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2022-11-25 17:07:22,736 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, 3 predicate places. [2022-11-25 17:07:22,736 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 500 flow [2022-11-25 17:07:22,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:07:22,737 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:07:22,737 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-11-25 17:07:22,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 17:07:22,737 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:07:22,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:07:22,738 INFO L85 PathProgramCache]: Analyzing trace with hash -771274278, now seen corresponding path program 1 times [2022-11-25 17:07:22,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:07:22,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189365725] [2022-11-25 17:07:22,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:07:22,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:07:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:07:22,927 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:07:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:07:23,140 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:07:23,140 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:07:23,141 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (82 of 83 remaining) [2022-11-25 17:07:23,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 83 remaining) [2022-11-25 17:07:23,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 83 remaining) [2022-11-25 17:07:23,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 83 remaining) [2022-11-25 17:07:23,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 83 remaining) [2022-11-25 17:07:23,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 83 remaining) [2022-11-25 17:07:23,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 83 remaining) [2022-11-25 17:07:23,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 83 remaining) [2022-11-25 17:07:23,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 83 remaining) [2022-11-25 17:07:23,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 83 remaining) [2022-11-25 17:07:23,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 83 remaining) [2022-11-25 17:07:23,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 83 remaining) [2022-11-25 17:07:23,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 83 remaining) [2022-11-25 17:07:23,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 83 remaining) [2022-11-25 17:07:23,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 83 remaining) [2022-11-25 17:07:23,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 83 remaining) [2022-11-25 17:07:23,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 83 remaining) [2022-11-25 17:07:23,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 83 remaining) [2022-11-25 17:07:23,151 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 83 remaining) [2022-11-25 17:07:23,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 83 remaining) [2022-11-25 17:07:23,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 83 remaining) [2022-11-25 17:07:23,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 83 remaining) [2022-11-25 17:07:23,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 83 remaining) [2022-11-25 17:07:23,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 83 remaining) [2022-11-25 17:07:23,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 83 remaining) [2022-11-25 17:07:23,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 83 remaining) [2022-11-25 17:07:23,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 83 remaining) [2022-11-25 17:07:23,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 83 remaining) [2022-11-25 17:07:23,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 83 remaining) [2022-11-25 17:07:23,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (53 of 83 remaining) [2022-11-25 17:07:23,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 83 remaining) [2022-11-25 17:07:23,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 83 remaining) [2022-11-25 17:07:23,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 83 remaining) [2022-11-25 17:07:23,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 83 remaining) [2022-11-25 17:07:23,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 83 remaining) [2022-11-25 17:07:23,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 83 remaining) [2022-11-25 17:07:23,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 83 remaining) [2022-11-25 17:07:23,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 83 remaining) [2022-11-25 17:07:23,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 83 remaining) [2022-11-25 17:07:23,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 83 remaining) [2022-11-25 17:07:23,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 83 remaining) [2022-11-25 17:07:23,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 83 remaining) [2022-11-25 17:07:23,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 83 remaining) [2022-11-25 17:07:23,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 83 remaining) [2022-11-25 17:07:23,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 83 remaining) [2022-11-25 17:07:23,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 83 remaining) [2022-11-25 17:07:23,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (36 of 83 remaining) [2022-11-25 17:07:23,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 83 remaining) [2022-11-25 17:07:23,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 83 remaining) [2022-11-25 17:07:23,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 83 remaining) [2022-11-25 17:07:23,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 83 remaining) [2022-11-25 17:07:23,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 83 remaining) [2022-11-25 17:07:23,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 83 remaining) [2022-11-25 17:07:23,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 83 remaining) [2022-11-25 17:07:23,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 83 remaining) [2022-11-25 17:07:23,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 83 remaining) [2022-11-25 17:07:23,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 83 remaining) [2022-11-25 17:07:23,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 83 remaining) [2022-11-25 17:07:23,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 83 remaining) [2022-11-25 17:07:23,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 83 remaining) [2022-11-25 17:07:23,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 83 remaining) [2022-11-25 17:07:23,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 83 remaining) [2022-11-25 17:07:23,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 83 remaining) [2022-11-25 17:07:23,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 83 remaining) [2022-11-25 17:07:23,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 83 remaining) [2022-11-25 17:07:23,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 83 remaining) [2022-11-25 17:07:23,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 83 remaining) [2022-11-25 17:07:23,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 83 remaining) [2022-11-25 17:07:23,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 83 remaining) [2022-11-25 17:07:23,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 83 remaining) [2022-11-25 17:07:23,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 83 remaining) [2022-11-25 17:07:23,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 83 remaining) [2022-11-25 17:07:23,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 83 remaining) [2022-11-25 17:07:23,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 83 remaining) [2022-11-25 17:07:23,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 83 remaining) [2022-11-25 17:07:23,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 83 remaining) [2022-11-25 17:07:23,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 83 remaining) [2022-11-25 17:07:23,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 83 remaining) [2022-11-25 17:07:23,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 83 remaining) [2022-11-25 17:07:23,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 83 remaining) [2022-11-25 17:07:23,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 83 remaining) [2022-11-25 17:07:23,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 83 remaining) [2022-11-25 17:07:23,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 83 remaining) [2022-11-25 17:07:23,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 17:07:23,167 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:07:23,178 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:07:23,179 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:07:23,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:07:23 BasicIcfg [2022-11-25 17:07:23,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:07:23,332 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:07:23,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:07:23,332 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:07:23,333 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:06:23" (3/4) ... [2022-11-25 17:07:23,336 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:07:23,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:07:23,337 INFO L158 Benchmark]: Toolchain (without parser) took 62571.15ms. Allocated memory was 165.7MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 133.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 312.2MB. Max. memory is 16.1GB. [2022-11-25 17:07:23,337 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 117.4MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:07:23,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 686.58ms. Allocated memory is still 165.7MB. Free memory was 133.2MB in the beginning and 105.5MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 17:07:23,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.72ms. Allocated memory is still 165.7MB. Free memory was 105.5MB in the beginning and 102.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:07:23,340 INFO L158 Benchmark]: Boogie Preprocessor took 79.75ms. Allocated memory is still 165.7MB. Free memory was 102.8MB in the beginning and 100.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:07:23,341 INFO L158 Benchmark]: RCFGBuilder took 1766.42ms. Allocated memory is still 165.7MB. Free memory was 100.3MB in the beginning and 100.3MB in the end (delta: -24.1kB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. [2022-11-25 17:07:23,341 INFO L158 Benchmark]: TraceAbstraction took 59965.86ms. Allocated memory was 165.7MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 100.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 276.7MB. Max. memory is 16.1GB. [2022-11-25 17:07:23,341 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 1.5GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:07:23,343 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.33ms. Allocated memory is still 117.4MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 686.58ms. Allocated memory is still 165.7MB. Free memory was 133.2MB in the beginning and 105.5MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.72ms. Allocated memory is still 165.7MB. Free memory was 105.5MB in the beginning and 102.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.75ms. Allocated memory is still 165.7MB. Free memory was 102.8MB in the beginning and 100.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1766.42ms. Allocated memory is still 165.7MB. Free memory was 100.3MB in the beginning and 100.3MB in the end (delta: -24.1kB). Peak memory consumption was 46.0MB. Max. memory is 16.1GB. * TraceAbstraction took 59965.86ms. Allocated memory was 165.7MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 100.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 276.7MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 1.5GB. Free memory is still 1.2GB. 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: 22.8s, 185 PlacesBefore, 81 PlacesAfterwards, 177 TransitionsBefore, 72 TransitionsAfterwards, 7240 CoEnabledTransitionPairs, 8 FixpointIterations, 73 TrivialSequentialCompositions, 106 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 184 TotalNumberOfCompositions, 27260 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10845, independent: 10429, independent conditional: 0, independent unconditional: 10429, dependent: 335, dependent conditional: 0, dependent unconditional: 335, unknown: 81, unknown conditional: 0, unknown unconditional: 81] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4915, independent: 4829, independent conditional: 0, independent unconditional: 4829, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4915, independent: 4254, independent conditional: 0, independent unconditional: 4254, dependent: 661, dependent conditional: 0, dependent unconditional: 661, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 661, independent: 575, independent conditional: 0, independent unconditional: 575, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3937, independent: 3056, independent conditional: 0, independent unconditional: 3056, dependent: 463, dependent conditional: 0, dependent unconditional: 463, unknown: 418, unknown conditional: 0, unknown unconditional: 418] ], Cache Queries: [ total: 10845, independent: 5600, independent conditional: 0, independent unconditional: 5600, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 4974, unknown conditional: 0, unknown unconditional: 4974] , Statistics on independence cache: Total cache size (in pairs): 483, Positive cache size: 442, Positive conditional cache size: 0, Positive unconditional cache size: 442, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 12, Unknown conditional cache size: 0, Unknown unconditional cache size: 12 - 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1684; [L858] FCALL, FORK 0 pthread_create(&t1684, ((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_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$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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1684, ((void *)0), P0, ((void *)0))=-1, t1684={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L859] 0 pthread_t t1685; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$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_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$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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L780] 1 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_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$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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L860] FCALL, FORK 0 pthread_create(&t1685, ((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_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$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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1685, ((void *)0), P1, ((void *)0))=0, t1684={6:0}, t1685={7:0}, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L792] 2 y = 2 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_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$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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] 2 __unbuffered_p1_EAX = y 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_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$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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L861] 0 pthread_t t1686; 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_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$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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1684={6:0}, t1685={7:0}, t1686={5:0}, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L862] FCALL, FORK 0 pthread_create(&t1686, ((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_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$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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1686, ((void *)0), P2, ((void *)0))=1, t1684={6:0}, t1685={7:0}, t1686={5:0}, weak$$choice0=255, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 \read(x) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$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_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$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_p1_EAX=2, __unbuffered_p1_EBX=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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L823] 3 x$w_buff1 = x$w_buff0 [L824] 3 x$w_buff0 = 1 [L825] 3 x$w_buff1_used = x$w_buff0_used [L826] 3 x$w_buff0_used = (_Bool)1 [L827] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L827] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L828] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L829] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L830] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L831] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L832] 3 x$r_buff0_thd3 = (_Bool)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_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$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_p1_EAX=2, __unbuffered_p1_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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L835] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L836] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L837] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L838] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L839] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_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_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$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_p1_EAX=2, __unbuffered_p1_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={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L842] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 3 return 0; [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L866] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L866] RET 0 assume_abort_if_not(main$tmp_guard0) [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L868] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L868] EXPR 0 \read(x) [L868] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L868] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L870] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L871] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L872] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __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_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$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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1684={6:0}, t1685={7:0}, t1686={5:0}, weak$$choice0=2, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L875] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L876] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L876] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L876] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L876] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L876] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L876] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L877] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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_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$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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 855]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 862]: 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: 858]: 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 7 procedures, 237 locations, 83 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: 59.5s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 25.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 23.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1429 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1064 mSDsluCounter, 626 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 464 mSDsCounter, 336 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3130 IncrementalHoareTripleChecker+Invalid, 3466 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 336 mSolverCounterUnsat, 162 mSDtfsCounter, 3130 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1316occurred in iteration=17, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 2245 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-11-25 17:07:23,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de3096cf2a7a81c5a5563cf2e9ae3ddf8f4cc1ab1b483fb6503759d4e39a0a81 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:07:25,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:07:25,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:07:25,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:07:25,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:07:25,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:07:25,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:07:26,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:07:26,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:07:26,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:07:26,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:07:26,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:07:26,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:07:26,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:07:26,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:07:26,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:07:26,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:07:26,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:07:26,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:07:26,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:07:26,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:07:26,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:07:26,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:07:26,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:07:26,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:07:26,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:07:26,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:07:26,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:07:26,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:07:26,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:07:26,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:07:26,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:07:26,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:07:26,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:07:26,062 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:07:26,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:07:26,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:07:26,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:07:26,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:07:26,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:07:26,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:07:26,073 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 17:07:26,126 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:07:26,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:07:26,128 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:07:26,128 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:07:26,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:07:26,129 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:07:26,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:07:26,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:07:26,131 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:07:26,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:07:26,132 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:07:26,133 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:07:26,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:07:26,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:07:26,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:07:26,134 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:07:26,134 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:07:26,134 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:07:26,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:07:26,135 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:07:26,135 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 17:07:26,135 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 17:07:26,136 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:07:26,136 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:07:26,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:07:26,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:07:26,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:07:26,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:07:26,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:07:26,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:07:26,138 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 17:07:26,138 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 17:07:26,139 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:07:26,139 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:07:26,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:07:26,140 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 17:07:26,140 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_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de3096cf2a7a81c5a5563cf2e9ae3ddf8f4cc1ab1b483fb6503759d4e39a0a81 [2022-11-25 17:07:26,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:07:26,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:07:26,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:07:26,592 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:07:26,593 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:07:26,595 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i [2022-11-25 17:07:29,959 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:07:30,319 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:07:30,320 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i [2022-11-25 17:07:30,336 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/data/55eda4940/d11dece36f7348f789a15099e72b8deb/FLAGb514beb13 [2022-11-25 17:07:30,354 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/data/55eda4940/d11dece36f7348f789a15099e72b8deb [2022-11-25 17:07:30,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:07:30,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:07:30,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:07:30,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:07:30,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:07:30,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:07:30" (1/1) ... [2022-11-25 17:07:30,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa22881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:30, skipping insertion in model container [2022-11-25 17:07:30,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:07:30" (1/1) ... [2022-11-25 17:07:30,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:07:30,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:07:30,605 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_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i[993,1006] [2022-11-25 17:07:30,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:30,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:30,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:30,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:30,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:30,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:30,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:30,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:30,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:30,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:30,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:30,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:30,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:30,921 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:30,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:30,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:30,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:30,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:30,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:30,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:30,933 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:30,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:30,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:30,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:30,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:30,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:30,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:30,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:30,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:30,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:30,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:07:30,998 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:07:31,022 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_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i[993,1006] [2022-11-25 17:07:31,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:31,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:31,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:31,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:31,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:31,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:31,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:31,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:31,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:31,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:31,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:31,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:31,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:31,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:31,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:31,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:31,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:31,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:31,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:31,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:31,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:31,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:31,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:31,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:31,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:31,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:31,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:31,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:31,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:07:31,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:07:31,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:07:31,183 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:07:31,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:31 WrapperNode [2022-11-25 17:07:31,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:07:31,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:07:31,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:07:31,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:07:31,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:31" (1/1) ... [2022-11-25 17:07:31,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:31" (1/1) ... [2022-11-25 17:07:31,299 INFO L138 Inliner]: procedures = 180, calls = 75, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 178 [2022-11-25 17:07:31,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:07:31,318 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:07:31,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:07:31,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:07:31,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:31" (1/1) ... [2022-11-25 17:07:31,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:31" (1/1) ... [2022-11-25 17:07:31,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:31" (1/1) ... [2022-11-25 17:07:31,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:31" (1/1) ... [2022-11-25 17:07:31,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:31" (1/1) ... [2022-11-25 17:07:31,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:31" (1/1) ... [2022-11-25 17:07:31,383 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:31" (1/1) ... [2022-11-25 17:07:31,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:31" (1/1) ... [2022-11-25 17:07:31,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:07:31,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:07:31,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:07:31,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:07:31,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:31" (1/1) ... [2022-11-25 17:07:31,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:07:31,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:07:31,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:07:31,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:07:31,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 17:07:31,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:07:31,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:07:31,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:07:31,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:07:31,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 17:07:31,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 17:07:31,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-25 17:07:31,502 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:07:31,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:07:31,502 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:07:31,503 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:07:31,504 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:07:31,504 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:07:31,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:07:31,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:07:31,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:07:31,506 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:07:31,806 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:07:31,808 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:07:32,794 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:07:33,692 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:07:33,692 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:07:33,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:07:33 BoogieIcfgContainer [2022-11-25 17:07:33,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:07:33,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:07:33,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:07:33,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:07:33,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:07:30" (1/3) ... [2022-11-25 17:07:33,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2597ecae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:07:33, skipping insertion in model container [2022-11-25 17:07:33,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:07:31" (2/3) ... [2022-11-25 17:07:33,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2597ecae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:07:33, skipping insertion in model container [2022-11-25 17:07:33,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:07:33" (3/3) ... [2022-11-25 17:07:33,708 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.opt.i [2022-11-25 17:07:33,731 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:07:33,732 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2022-11-25 17:07:33,732 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:07:33,942 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:07:33,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 181 transitions, 377 flow [2022-11-25 17:07:34,085 INFO L130 PetriNetUnfolder]: 2/178 cut-off events. [2022-11-25 17:07:34,085 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:07:34,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 2/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 275 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2022-11-25 17:07:34,093 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 181 transitions, 377 flow [2022-11-25 17:07:34,100 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 178 transitions, 365 flow [2022-11-25 17:07:34,104 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:07:34,120 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 178 transitions, 365 flow [2022-11-25 17:07:34,123 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 178 transitions, 365 flow [2022-11-25 17:07:34,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 178 transitions, 365 flow [2022-11-25 17:07:34,208 INFO L130 PetriNetUnfolder]: 2/178 cut-off events. [2022-11-25 17:07:34,208 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:07:34,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 2/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 276 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2022-11-25 17:07:34,218 INFO L119 LiptonReduction]: Number of co-enabled transitions 7240 [2022-11-25 17:07:51,067 WARN L233 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 195 DAG size of output: 194 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 17:08:00,967 WARN L233 SmtUtils]: Spent 7.32s on a formula simplification. DAG size of input: 223 DAG size of output: 222 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 17:08:35,734 INFO L134 LiptonReduction]: Checked pairs total: 27950 [2022-11-25 17:08:35,734 INFO L136 LiptonReduction]: Total number of compositions: 188 [2022-11-25 17:08:35,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:08:35,757 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;@6d652fea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:08:35,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2022-11-25 17:08:35,759 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 17:08:35,759 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:08:35,760 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:35,760 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:08:35,761 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:08:35,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:35,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1145, now seen corresponding path program 1 times [2022-11-25 17:08:35,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:08:35,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922455077] [2022-11-25 17:08:35,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:35,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:08:35,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:08:35,784 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:08:35,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 17:08:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:36,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:08:36,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:08:36,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:08:36,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:08:36,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922455077] [2022-11-25 17:08:36,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922455077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:36,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:36,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:08:36,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640618069] [2022-11-25 17:08:36,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:36,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:08:36,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:08:36,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:08:36,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:08:36,118 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 369 [2022-11-25 17:08:36,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 72 transitions, 153 flow. Second operand has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:36,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:36,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 369 [2022-11-25 17:08:36,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:39,652 INFO L130 PetriNetUnfolder]: 8950/12668 cut-off events. [2022-11-25 17:08:39,652 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-25 17:08:39,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25401 conditions, 12668 events. 8950/12668 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 77466 event pairs, 8950 based on Foata normal form. 0/6230 useless extension candidates. Maximal degree in co-relation 25390. Up to 12657 conditions per place. [2022-11-25 17:08:39,754 INFO L137 encePairwiseOnDemand]: 337/369 looper letters, 38 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2022-11-25 17:08:39,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 165 flow [2022-11-25 17:08:39,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:08:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:08:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 330 transitions. [2022-11-25 17:08:39,773 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2022-11-25 17:08:39,774 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 330 transitions. [2022-11-25 17:08:39,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 330 transitions. [2022-11-25 17:08:39,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:39,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 330 transitions. [2022-11-25 17:08:39,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 165.0) internal successors, (330), 2 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:39,793 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-11-25 17:08:39,794 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-11-25 17:08:39,796 INFO L175 Difference]: Start difference. First operand has 81 places, 72 transitions, 153 flow. Second operand 2 states and 330 transitions. [2022-11-25 17:08:39,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 165 flow [2022-11-25 17:08:39,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:08:39,805 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 86 flow [2022-11-25 17:08:39,807 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-11-25 17:08:39,811 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -33 predicate places. [2022-11-25 17:08:39,812 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 86 flow [2022-11-25 17:08:39,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 130.5) internal successors, (261), 2 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:39,812 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:39,813 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:08:39,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:40,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:08:40,027 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:08:40,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:40,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1131961, now seen corresponding path program 1 times [2022-11-25 17:08:40,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:08:40,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431369248] [2022-11-25 17:08:40,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:40,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:08:40,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:08:40,031 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:08:40,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 17:08:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:40,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:08:40,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:40,398 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 17:08:40,399 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-11-25 17:08:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:08:40,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:08:40,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:08:40,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431369248] [2022-11-25 17:08:40,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431369248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:40,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:40,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:08:40,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640146982] [2022-11-25 17:08:40,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:40,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:08:40,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:08:40,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:08:40,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:08:40,520 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 369 [2022-11-25 17:08:40,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 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-11-25 17:08:40,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:40,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 369 [2022-11-25 17:08:40,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:42,800 INFO L130 PetriNetUnfolder]: 4845/6968 cut-off events. [2022-11-25 17:08:42,801 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:08:42,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13979 conditions, 6968 events. 4845/6968 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 39339 event pairs, 3029 based on Foata normal form. 0/4063 useless extension candidates. Maximal degree in co-relation 13976. Up to 3710 conditions per place. [2022-11-25 17:08:42,861 INFO L137 encePairwiseOnDemand]: 361/369 looper letters, 46 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-11-25 17:08:42,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 202 flow [2022-11-25 17:08:42,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:08:42,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:08:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2022-11-25 17:08:42,868 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39295392953929537 [2022-11-25 17:08:42,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2022-11-25 17:08:42,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2022-11-25 17:08:42,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:42,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2022-11-25 17:08:42,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:42,878 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-11-25 17:08:42,879 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-11-25 17:08:42,879 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 86 flow. Second operand 3 states and 435 transitions. [2022-11-25 17:08:42,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 202 flow [2022-11-25 17:08:42,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 202 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:08:42,882 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 96 flow [2022-11-25 17:08:42,882 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=96, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2022-11-25 17:08:42,883 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -32 predicate places. [2022-11-25 17:08:42,883 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 96 flow [2022-11-25 17:08:42,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 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-11-25 17:08:42,885 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:42,886 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:08:42,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:43,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:08:43,104 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:08:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:43,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1131962, now seen corresponding path program 1 times [2022-11-25 17:08:43,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:08:43,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016367434] [2022-11-25 17:08:43,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:43,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:08:43,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:08:43,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:08:43,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 17:08:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:43,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:08:43,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:43,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 17:08:43,432 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-11-25 17:08:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:08:43,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:08:43,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:08:43,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016367434] [2022-11-25 17:08:43,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016367434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:43,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:43,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:08:43,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879515319] [2022-11-25 17:08:43,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:43,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:08:43,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:08:43,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:08:43,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:08:43,562 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 369 [2022-11-25 17:08:43,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:43,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:43,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 369 [2022-11-25 17:08:43,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:44,609 INFO L130 PetriNetUnfolder]: 2197/3231 cut-off events. [2022-11-25 17:08:44,609 INFO L131 PetriNetUnfolder]: For 234/234 co-relation queries the response was YES. [2022-11-25 17:08:44,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7024 conditions, 3231 events. 2197/3231 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 16429 event pairs, 2197 based on Foata normal form. 0/2663 useless extension candidates. Maximal degree in co-relation 7019. Up to 3223 conditions per place. [2022-11-25 17:08:44,632 INFO L137 encePairwiseOnDemand]: 363/369 looper letters, 30 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2022-11-25 17:08:44,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 33 transitions, 148 flow [2022-11-25 17:08:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:08:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:08:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2022-11-25 17:08:44,668 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38482384823848237 [2022-11-25 17:08:44,668 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2022-11-25 17:08:44,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2022-11-25 17:08:44,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:44,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2022-11-25 17:08:44,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:44,672 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-11-25 17:08:44,673 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-11-25 17:08:44,673 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 96 flow. Second operand 3 states and 426 transitions. [2022-11-25 17:08:44,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 33 transitions, 148 flow [2022-11-25 17:08:44,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:08:44,678 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 84 flow [2022-11-25 17:08:44,678 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-11-25 17:08:44,680 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -37 predicate places. [2022-11-25 17:08:44,680 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 84 flow [2022-11-25 17:08:44,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:44,681 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:44,681 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:44,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:44,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:08:44,894 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:08:44,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:44,895 INFO L85 PathProgramCache]: Analyzing trace with hash 487313894, now seen corresponding path program 1 times [2022-11-25 17:08:44,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:08:44,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216015498] [2022-11-25 17:08:44,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:44,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:08:44,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:08:44,899 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:08:44,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 17:08:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:45,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:08:45,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:45,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:08:45,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:08:45,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:08:45,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216015498] [2022-11-25 17:08:45,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216015498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:45,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:45,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:08:45,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569095286] [2022-11-25 17:08:45,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:45,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:08:45,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:08:45,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:08:45,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:08:45,231 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 369 [2022-11-25 17:08:45,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:45,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:45,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 369 [2022-11-25 17:08:45,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:46,247 INFO L130 PetriNetUnfolder]: 1810/2680 cut-off events. [2022-11-25 17:08:46,247 INFO L131 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2022-11-25 17:08:46,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5814 conditions, 2680 events. 1810/2680 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 14484 event pairs, 281 based on Foata normal form. 0/2332 useless extension candidates. Maximal degree in co-relation 5809. Up to 2182 conditions per place. [2022-11-25 17:08:46,265 INFO L137 encePairwiseOnDemand]: 366/369 looper letters, 45 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2022-11-25 17:08:46,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 215 flow [2022-11-25 17:08:46,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:08:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:08:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2022-11-25 17:08:46,268 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39295392953929537 [2022-11-25 17:08:46,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2022-11-25 17:08:46,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2022-11-25 17:08:46,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:46,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2022-11-25 17:08:46,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:46,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-11-25 17:08:46,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-11-25 17:08:46,275 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 84 flow. Second operand 3 states and 435 transitions. [2022-11-25 17:08:46,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 215 flow [2022-11-25 17:08:46,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:08:46,277 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 85 flow [2022-11-25 17:08:46,277 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2022-11-25 17:08:46,278 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -37 predicate places. [2022-11-25 17:08:46,278 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 85 flow [2022-11-25 17:08:46,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:46,279 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:46,279 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:46,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:46,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:08:46,492 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:08:46,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:46,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2073135583, now seen corresponding path program 1 times [2022-11-25 17:08:46,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:08:46,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248532829] [2022-11-25 17:08:46,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:46,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:08:46,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:08:46,495 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:08:46,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 17:08:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:46,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-25 17:08:46,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:08:46,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:08:46,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:08:46,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248532829] [2022-11-25 17:08:46,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248532829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:46,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:46,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:08:46,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888395804] [2022-11-25 17:08:46,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:46,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:08:46,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:08:46,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:08:46,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:08:46,796 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 369 [2022-11-25 17:08:46,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:46,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:46,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 369 [2022-11-25 17:08:46,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:47,791 INFO L130 PetriNetUnfolder]: 1730/2683 cut-off events. [2022-11-25 17:08:47,791 INFO L131 PetriNetUnfolder]: For 377/377 co-relation queries the response was YES. [2022-11-25 17:08:47,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5862 conditions, 2683 events. 1730/2683 cut-off events. For 377/377 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 14473 event pairs, 740 based on Foata normal form. 0/2370 useless extension candidates. Maximal degree in co-relation 5857. Up to 1643 conditions per place. [2022-11-25 17:08:47,813 INFO L137 encePairwiseOnDemand]: 365/369 looper letters, 51 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2022-11-25 17:08:47,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 55 transitions, 250 flow [2022-11-25 17:08:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:08:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:08:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-11-25 17:08:47,816 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3992773261065944 [2022-11-25 17:08:47,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-11-25 17:08:47,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-11-25 17:08:47,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:47,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-11-25 17:08:47,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:47,821 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-11-25 17:08:47,822 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-11-25 17:08:47,823 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 85 flow. Second operand 3 states and 442 transitions. [2022-11-25 17:08:47,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 55 transitions, 250 flow [2022-11-25 17:08:47,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 244 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:08:47,826 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 91 flow [2022-11-25 17:08:47,827 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-11-25 17:08:47,829 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -36 predicate places. [2022-11-25 17:08:47,830 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 91 flow [2022-11-25 17:08:47,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:47,830 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:47,830 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:47,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:48,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:08:48,043 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:08:48,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash 157304821, now seen corresponding path program 1 times [2022-11-25 17:08:48,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:08:48,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065547115] [2022-11-25 17:08:48,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:48,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:08:48,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:08:48,047 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:08:48,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 17:08:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:08:48,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:08:48,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:08:48,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:08:48,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065547115] [2022-11-25 17:08:48,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065547115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:48,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:48,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:08:48,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127339035] [2022-11-25 17:08:48,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:48,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:48,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:08:48,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:48,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:48,418 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 369 [2022-11-25 17:08:48,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:48,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:48,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 369 [2022-11-25 17:08:48,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:49,130 INFO L130 PetriNetUnfolder]: 856/1410 cut-off events. [2022-11-25 17:08:49,130 INFO L131 PetriNetUnfolder]: For 218/218 co-relation queries the response was YES. [2022-11-25 17:08:49,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3300 conditions, 1410 events. 856/1410 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7027 event pairs, 266 based on Foata normal form. 80/1342 useless extension candidates. Maximal degree in co-relation 3294. Up to 1200 conditions per place. [2022-11-25 17:08:49,136 INFO L137 encePairwiseOnDemand]: 361/369 looper letters, 40 selfloop transitions, 4 changer transitions 17/63 dead transitions. [2022-11-25 17:08:49,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 288 flow [2022-11-25 17:08:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:08:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2022-11-25 17:08:49,140 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37506775067750675 [2022-11-25 17:08:49,140 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 692 transitions. [2022-11-25 17:08:49,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 692 transitions. [2022-11-25 17:08:49,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:49,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 692 transitions. [2022-11-25 17:08:49,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:49,146 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-11-25 17:08:49,148 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-11-25 17:08:49,148 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 91 flow. Second operand 5 states and 692 transitions. [2022-11-25 17:08:49,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 288 flow [2022-11-25 17:08:49,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 63 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:08:49,150 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 131 flow [2022-11-25 17:08:49,151 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2022-11-25 17:08:49,151 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -31 predicate places. [2022-11-25 17:08:49,151 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 131 flow [2022-11-25 17:08:49,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:49,152 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:49,152 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:49,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:49,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:08:49,366 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:08:49,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:49,366 INFO L85 PathProgramCache]: Analyzing trace with hash 197556614, now seen corresponding path program 1 times [2022-11-25 17:08:49,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:08:49,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262439459] [2022-11-25 17:08:49,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:49,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:08:49,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:08:49,368 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:08:49,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 17:08:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:08:49,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:08:49,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:08:49,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:08:49,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262439459] [2022-11-25 17:08:49,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262439459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:49,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:49,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:08:49,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790895980] [2022-11-25 17:08:49,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:49,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:08:49,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:08:49,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:08:49,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:49,805 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 369 [2022-11-25 17:08:49,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:49,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:49,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 369 [2022-11-25 17:08:49,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:50,495 INFO L130 PetriNetUnfolder]: 245/479 cut-off events. [2022-11-25 17:08:50,495 INFO L131 PetriNetUnfolder]: For 274/274 co-relation queries the response was YES. [2022-11-25 17:08:50,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 479 events. 245/479 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1978 event pairs, 62 based on Foata normal form. 53/495 useless extension candidates. Maximal degree in co-relation 1379. Up to 228 conditions per place. [2022-11-25 17:08:50,498 INFO L137 encePairwiseOnDemand]: 361/369 looper letters, 48 selfloop transitions, 7 changer transitions 17/74 dead transitions. [2022-11-25 17:08:50,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 401 flow [2022-11-25 17:08:50,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:08:50,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:08:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 828 transitions. [2022-11-25 17:08:50,503 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37398373983739835 [2022-11-25 17:08:50,503 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 828 transitions. [2022-11-25 17:08:50,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 828 transitions. [2022-11-25 17:08:50,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:50,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 828 transitions. [2022-11-25 17:08:50,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:50,512 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-11-25 17:08:50,513 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-11-25 17:08:50,513 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 131 flow. Second operand 6 states and 828 transitions. [2022-11-25 17:08:50,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 401 flow [2022-11-25 17:08:50,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 391 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-25 17:08:50,523 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 185 flow [2022-11-25 17:08:50,523 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2022-11-25 17:08:50,524 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -27 predicate places. [2022-11-25 17:08:50,524 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 185 flow [2022-11-25 17:08:50,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:50,526 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:50,526 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:50,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:50,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:08:50,740 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:08:50,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:50,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1834270829, now seen corresponding path program 1 times [2022-11-25 17:08:50,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:08:50,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321621128] [2022-11-25 17:08:50,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:50,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:08:50,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:08:50,748 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:08:50,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 17:08:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:08:51,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:08:51,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:08:51,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:08:51,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321621128] [2022-11-25 17:08:51,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321621128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:51,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:51,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:51,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646354067] [2022-11-25 17:08:51,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:51,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:08:51,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:08:51,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:08:51,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:08:51,167 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 369 [2022-11-25 17:08:51,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:51,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:08:51,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 369 [2022-11-25 17:08:51,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:08:51,889 INFO L130 PetriNetUnfolder]: 121/240 cut-off events. [2022-11-25 17:08:51,889 INFO L131 PetriNetUnfolder]: For 317/317 co-relation queries the response was YES. [2022-11-25 17:08:51,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 240 events. 121/240 cut-off events. For 317/317 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 802 event pairs, 40 based on Foata normal form. 17/251 useless extension candidates. Maximal degree in co-relation 761. Up to 92 conditions per place. [2022-11-25 17:08:51,890 INFO L137 encePairwiseOnDemand]: 361/369 looper letters, 40 selfloop transitions, 10 changer transitions 10/62 dead transitions. [2022-11-25 17:08:51,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 382 flow [2022-11-25 17:08:51,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:08:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:08:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 941 transitions. [2022-11-25 17:08:51,894 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3643050716221448 [2022-11-25 17:08:51,895 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 941 transitions. [2022-11-25 17:08:51,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 941 transitions. [2022-11-25 17:08:51,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:08:51,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 941 transitions. [2022-11-25 17:08:51,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.42857142857142) internal successors, (941), 7 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:51,902 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-11-25 17:08:51,903 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-11-25 17:08:51,904 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 185 flow. Second operand 7 states and 941 transitions. [2022-11-25 17:08:51,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 382 flow [2022-11-25 17:08:51,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 336 flow, removed 18 selfloop flow, removed 5 redundant places. [2022-11-25 17:08:51,908 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 167 flow [2022-11-25 17:08:51,909 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=167, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2022-11-25 17:08:51,909 INFO L288 CegarLoopForPetriNet]: 81 programPoint places, -29 predicate places. [2022-11-25 17:08:51,909 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 167 flow [2022-11-25 17:08:51,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:51,910 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:08:51,910 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:51,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:52,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:08:52,130 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2022-11-25 17:08:52,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:52,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1279091949, now seen corresponding path program 1 times [2022-11-25 17:08:52,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:08:52,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1708971838] [2022-11-25 17:08:52,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:52,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-11-25 17:08:52,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:08:52,133 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:08:52,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7fa5a2-c982-43c7-8286-939cec0b7bb3/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 17:08:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:08:52,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:14:57,967 WARN L233 SmtUtils]: Spent 36.43s on a formula simplification that was a NOOP. DAG size: 671 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)