./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/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_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/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_d332a42f-74b8-4df1-af3a-9df17b71ee24/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 b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:23:28,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:23:28,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:23:28,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:23:28,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:23:28,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:23:28,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:23:28,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:23:28,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:23:28,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:23:28,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:23:28,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:23:28,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:23:28,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:23:28,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:23:28,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:23:28,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:23:28,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:23:28,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:23:28,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:23:28,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:23:28,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:23:28,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:23:28,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:23:28,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:23:28,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:23:28,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:23:28,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:23:28,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:23:28,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:23:28,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:23:28,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:23:28,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:23:28,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:23:28,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:23:28,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:23:28,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:23:28,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:23:28,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:23:28,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:23:28,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:23:28,603 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 18:23:28,630 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:23:28,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:23:28,631 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:23:28,631 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:23:28,632 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:23:28,632 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:23:28,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:23:28,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:23:28,634 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:23:28,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:23:28,635 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:23:28,635 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:23:28,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:23:28,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:23:28,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:23:28,636 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:23:28,636 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:23:28,637 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:23:28,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:23:28,637 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:23:28,637 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:23:28,638 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:23:28,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:23:28,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:23:28,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:23:28,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:23:28,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:23:28,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:23:28,640 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:23:28,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:23:28,640 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:23:28,641 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:23:28,641 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:23:28,641 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_d332a42f-74b8-4df1-af3a-9df17b71ee24/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_d332a42f-74b8-4df1-af3a-9df17b71ee24/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 -> b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e [2022-11-25 18:23:29,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:23:29,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:23:29,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:23:29,072 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:23:29,072 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:23:29,074 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2022-11-25 18:23:32,904 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:23:33,222 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:23:33,222 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2022-11-25 18:23:33,249 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/data/161b6d53e/71652044ae734b4eb5bc3cd5df7aa729/FLAG97bbb972a [2022-11-25 18:23:33,264 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/data/161b6d53e/71652044ae734b4eb5bc3cd5df7aa729 [2022-11-25 18:23:33,267 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:23:33,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:23:33,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:23:33,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:23:33,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:23:33,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:23:33" (1/1) ... [2022-11-25 18:23:33,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5822a883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:33, skipping insertion in model container [2022-11-25 18:23:33,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:23:33" (1/1) ... [2022-11-25 18:23:33,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:23:33,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:23:33,508 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_d332a42f-74b8-4df1-af3a-9df17b71ee24/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i[949,962] [2022-11-25 18:23:33,679 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,680 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,681 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,685 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:23:33,735 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:23:33,748 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_d332a42f-74b8-4df1-af3a-9df17b71ee24/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i[949,962] [2022-11-25 18:23:33,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:23:33,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:23:33,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:23:33,850 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:23:33,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:33 WrapperNode [2022-11-25 18:23:33,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:23:33,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:23:33,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:23:33,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:23:33,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:33" (1/1) ... [2022-11-25 18:23:33,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:33" (1/1) ... [2022-11-25 18:23:33,938 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-25 18:23:33,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:23:33,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:23:33,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:23:33,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:23:33,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:33" (1/1) ... [2022-11-25 18:23:33,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:33" (1/1) ... [2022-11-25 18:23:33,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:33" (1/1) ... [2022-11-25 18:23:33,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:33" (1/1) ... [2022-11-25 18:23:33,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:33" (1/1) ... [2022-11-25 18:23:33,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:33" (1/1) ... [2022-11-25 18:23:33,996 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:33" (1/1) ... [2022-11-25 18:23:33,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:33" (1/1) ... [2022-11-25 18:23:34,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:23:34,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:23:34,017 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:23:34,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:23:34,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:33" (1/1) ... [2022-11-25 18:23:34,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:23:34,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:23:34,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:23:34,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:23:34,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:23:34,161 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:23:34,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:23:34,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:23:34,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:23:34,162 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 18:23:34,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 18:23:34,163 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 18:23:34,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 18:23:34,186 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 18:23:34,186 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 18:23:34,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:23:34,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:23:34,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:23:34,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:23:34,189 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:23:34,408 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:23:34,410 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:23:34,880 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:23:35,193 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:23:35,196 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:23:35,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:23:35 BoogieIcfgContainer [2022-11-25 18:23:35,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:23:35,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:23:35,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:23:35,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:23:35,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:23:33" (1/3) ... [2022-11-25 18:23:35,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9518fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:23:35, skipping insertion in model container [2022-11-25 18:23:35,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:23:33" (2/3) ... [2022-11-25 18:23:35,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9518fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:23:35, skipping insertion in model container [2022-11-25 18:23:35,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:23:35" (3/3) ... [2022-11-25 18:23:35,221 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2022-11-25 18:23:35,243 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:23:35,244 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-25 18:23:35,244 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:23:35,353 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:23:35,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 129 transitions, 273 flow [2022-11-25 18:23:35,506 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-11-25 18:23:35,507 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:23:35,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-25 18:23:35,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 129 transitions, 273 flow [2022-11-25 18:23:35,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 126 transitions, 261 flow [2022-11-25 18:23:35,532 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:23:35,569 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 126 transitions, 261 flow [2022-11-25 18:23:35,575 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 126 transitions, 261 flow [2022-11-25 18:23:35,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 261 flow [2022-11-25 18:23:35,641 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2022-11-25 18:23:35,642 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:23:35,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-25 18:23:35,654 INFO L119 LiptonReduction]: Number of co-enabled transitions 2506 [2022-11-25 18:23:42,767 INFO L134 LiptonReduction]: Checked pairs total: 6733 [2022-11-25 18:23:42,767 INFO L136 LiptonReduction]: Total number of compositions: 125 [2022-11-25 18:23:42,804 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:23:42,817 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;@2cacb5a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:23:42,819 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-25 18:23:42,827 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 18:23:42,827 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:23:42,833 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:23:42,833 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 18:23:42,834 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:23:42,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:42,840 INFO L85 PathProgramCache]: Analyzing trace with hash 552, now seen corresponding path program 1 times [2022-11-25 18:23:42,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:42,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78849691] [2022-11-25 18:23:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:42,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:43,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:43,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:43,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78849691] [2022-11-25 18:23:43,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78849691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:43,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:43,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 18:23:43,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554186963] [2022-11-25 18:23:43,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:43,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:23:43,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:43,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:23:43,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:23:43,084 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 254 [2022-11-25 18:23:43,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:43,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:23:43,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 254 [2022-11-25 18:23:43,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:23:43,654 INFO L130 PetriNetUnfolder]: 1277/1955 cut-off events. [2022-11-25 18:23:43,654 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-25 18:23:43,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3896 conditions, 1955 events. 1277/1955 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9722 event pairs, 1277 based on Foata normal form. 0/1627 useless extension candidates. Maximal degree in co-relation 3885. Up to 1887 conditions per place. [2022-11-25 18:23:43,679 INFO L137 encePairwiseOnDemand]: 247/254 looper letters, 22 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2022-11-25 18:23:43,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 105 flow [2022-11-25 18:23:43,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:23:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 18:23:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 261 transitions. [2022-11-25 18:23:43,699 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5137795275590551 [2022-11-25 18:23:43,700 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 261 transitions. [2022-11-25 18:23:43,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 261 transitions. [2022-11-25 18:23:43,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:23:43,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 261 transitions. [2022-11-25 18:23:43,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 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 18:23:43,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:43,715 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:43,718 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 261 transitions. [2022-11-25 18:23:43,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 105 flow [2022-11-25 18:23:43,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 18:23:43,725 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2022-11-25 18:23:43,727 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2022-11-25 18:23:43,732 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2022-11-25 18:23:43,732 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2022-11-25 18:23:43,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:43,733 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:23:43,733 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:23:43,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:23:43,733 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:23:43,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:43,734 INFO L85 PathProgramCache]: Analyzing trace with hash 522999417, now seen corresponding path program 1 times [2022-11-25 18:23:43,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:43,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732719042] [2022-11-25 18:23:43,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:43,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:44,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:44,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732719042] [2022-11-25 18:23:44,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732719042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:44,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:44,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:23:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569319123] [2022-11-25 18:23:44,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:44,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:23:44,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:44,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:23:44,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:44,185 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 254 [2022-11-25 18:23:44,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:44,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:23:44,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 254 [2022-11-25 18:23:44,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:23:44,612 INFO L130 PetriNetUnfolder]: 999/1570 cut-off events. [2022-11-25 18:23:44,613 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:23:44,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3103 conditions, 1570 events. 999/1570 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7787 event pairs, 277 based on Foata normal form. 0/1429 useless extension candidates. Maximal degree in co-relation 3100. Up to 1195 conditions per place. [2022-11-25 18:23:44,624 INFO L137 encePairwiseOnDemand]: 251/254 looper letters, 31 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2022-11-25 18:23:44,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 156 flow [2022-11-25 18:23:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:23:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:23:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2022-11-25 18:23:44,632 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-11-25 18:23:44,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2022-11-25 18:23:44,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2022-11-25 18:23:44,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:23:44,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2022-11-25 18:23:44,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:44,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:44,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:44,643 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 381 transitions. [2022-11-25 18:23:44,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 156 flow [2022-11-25 18:23:44,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 18:23:44,645 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2022-11-25 18:23:44,645 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-11-25 18:23:44,646 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2022-11-25 18:23:44,646 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2022-11-25 18:23:44,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:44,647 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:23:44,648 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:44,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:23:44,648 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:23:44,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:44,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1828169508, now seen corresponding path program 1 times [2022-11-25 18:23:44,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:44,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503579322] [2022-11-25 18:23:44,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:44,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:45,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:45,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503579322] [2022-11-25 18:23:45,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503579322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:45,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:45,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:23:45,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410916933] [2022-11-25 18:23:45,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:45,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:23:45,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:45,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:23:45,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:23:45,248 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 254 [2022-11-25 18:23:45,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:45,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:23:45,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 254 [2022-11-25 18:23:45,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:23:45,810 INFO L130 PetriNetUnfolder]: 1159/1829 cut-off events. [2022-11-25 18:23:45,810 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-11-25 18:23:45,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3764 conditions, 1829 events. 1159/1829 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9169 event pairs, 311 based on Foata normal form. 0/1777 useless extension candidates. Maximal degree in co-relation 3760. Up to 913 conditions per place. [2022-11-25 18:23:45,826 INFO L137 encePairwiseOnDemand]: 250/254 looper letters, 44 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2022-11-25 18:23:45,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 51 transitions, 214 flow [2022-11-25 18:23:45,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:23:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:23:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-11-25 18:23:45,829 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.484251968503937 [2022-11-25 18:23:45,830 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 615 transitions. [2022-11-25 18:23:45,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 615 transitions. [2022-11-25 18:23:45,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:23:45,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 615 transitions. [2022-11-25 18:23:45,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:45,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:45,837 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:45,838 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 615 transitions. [2022-11-25 18:23:45,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 51 transitions, 214 flow [2022-11-25 18:23:45,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 51 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:23:45,841 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 78 flow [2022-11-25 18:23:45,841 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-11-25 18:23:45,842 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2022-11-25 18:23:45,842 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 78 flow [2022-11-25 18:23:45,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:45,843 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:23:45,843 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:45,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:23:45,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:23:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:45,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1828169482, now seen corresponding path program 1 times [2022-11-25 18:23:45,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:45,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656821821] [2022-11-25 18:23:45,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:45,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:46,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:46,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656821821] [2022-11-25 18:23:46,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656821821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:46,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:46,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:23:46,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099929546] [2022-11-25 18:23:46,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:46,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:23:46,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:46,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:23:46,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:23:46,790 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 254 [2022-11-25 18:23:46,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:46,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:23:46,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 254 [2022-11-25 18:23:46,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:23:47,207 INFO L130 PetriNetUnfolder]: 871/1395 cut-off events. [2022-11-25 18:23:47,207 INFO L131 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES. [2022-11-25 18:23:47,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3109 conditions, 1395 events. 871/1395 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6753 event pairs, 184 based on Foata normal form. 128/1523 useless extension candidates. Maximal degree in co-relation 3102. Up to 880 conditions per place. [2022-11-25 18:23:47,218 INFO L137 encePairwiseOnDemand]: 249/254 looper letters, 33 selfloop transitions, 4 changer transitions 2/42 dead transitions. [2022-11-25 18:23:47,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 188 flow [2022-11-25 18:23:47,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:23:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:23:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 646 transitions. [2022-11-25 18:23:47,222 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4238845144356955 [2022-11-25 18:23:47,222 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 646 transitions. [2022-11-25 18:23:47,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 646 transitions. [2022-11-25 18:23:47,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:23:47,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 646 transitions. [2022-11-25 18:23:47,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:47,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:47,232 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:47,232 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 78 flow. Second operand 6 states and 646 transitions. [2022-11-25 18:23:47,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 188 flow [2022-11-25 18:23:47,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:23:47,238 INFO L231 Difference]: Finished difference. Result has 42 places, 23 transitions, 70 flow [2022-11-25 18:23:47,238 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=23} [2022-11-25 18:23:47,239 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-11-25 18:23:47,239 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 23 transitions, 70 flow [2022-11-25 18:23:47,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:47,240 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:23:47,241 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:47,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:23:47,241 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:23:47,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:47,242 INFO L85 PathProgramCache]: Analyzing trace with hash -121576865, now seen corresponding path program 1 times [2022-11-25 18:23:47,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:47,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282004020] [2022-11-25 18:23:47,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:47,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:47,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:47,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:47,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282004020] [2022-11-25 18:23:47,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282004020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:47,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:47,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:23:47,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384496655] [2022-11-25 18:23:47,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:47,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:23:47,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:47,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:23:47,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:23:47,768 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 254 [2022-11-25 18:23:47,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 23 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:47,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:23:47,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 254 [2022-11-25 18:23:47,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:23:48,183 INFO L130 PetriNetUnfolder]: 856/1375 cut-off events. [2022-11-25 18:23:48,183 INFO L131 PetriNetUnfolder]: For 342/347 co-relation queries the response was YES. [2022-11-25 18:23:48,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2952 conditions, 1375 events. 856/1375 cut-off events. For 342/347 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6576 event pairs, 417 based on Foata normal form. 62/1426 useless extension candidates. Maximal degree in co-relation 2945. Up to 1117 conditions per place. [2022-11-25 18:23:48,192 INFO L137 encePairwiseOnDemand]: 249/254 looper letters, 29 selfloop transitions, 3 changer transitions 15/50 dead transitions. [2022-11-25 18:23:48,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 228 flow [2022-11-25 18:23:48,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:23:48,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:23:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2022-11-25 18:23:48,195 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48346456692913387 [2022-11-25 18:23:48,196 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2022-11-25 18:23:48,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2022-11-25 18:23:48,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:23:48,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2022-11-25 18:23:48,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:48,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:48,202 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:48,202 INFO L175 Difference]: Start difference. First operand has 42 places, 23 transitions, 70 flow. Second operand 5 states and 614 transitions. [2022-11-25 18:23:48,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 228 flow [2022-11-25 18:23:48,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 211 flow, removed 2 selfloop flow, removed 7 redundant places. [2022-11-25 18:23:48,207 INFO L231 Difference]: Finished difference. Result has 40 places, 25 transitions, 84 flow [2022-11-25 18:23:48,207 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2022-11-25 18:23:48,208 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2022-11-25 18:23:48,208 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 84 flow [2022-11-25 18:23:48,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:48,209 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:23:48,209 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:48,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:23:48,209 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:23:48,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:48,210 INFO L85 PathProgramCache]: Analyzing trace with hash 527426994, now seen corresponding path program 1 times [2022-11-25 18:23:48,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:48,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23859226] [2022-11-25 18:23:48,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:48,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:48,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:48,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23859226] [2022-11-25 18:23:48,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23859226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:48,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:48,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:23:48,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644567065] [2022-11-25 18:23:48,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:48,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:23:48,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:48,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:23:48,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:23:48,872 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 254 [2022-11-25 18:23:48,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 84 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:48,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:23:48,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 254 [2022-11-25 18:23:48,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:23:49,309 INFO L130 PetriNetUnfolder]: 854/1388 cut-off events. [2022-11-25 18:23:49,309 INFO L131 PetriNetUnfolder]: For 631/642 co-relation queries the response was YES. [2022-11-25 18:23:49,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3345 conditions, 1388 events. 854/1388 cut-off events. For 631/642 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6878 event pairs, 238 based on Foata normal form. 54/1433 useless extension candidates. Maximal degree in co-relation 3337. Up to 1065 conditions per place. [2022-11-25 18:23:49,319 INFO L137 encePairwiseOnDemand]: 247/254 looper letters, 36 selfloop transitions, 6 changer transitions 14/59 dead transitions. [2022-11-25 18:23:49,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 286 flow [2022-11-25 18:23:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:23:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:23:49,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 730 transitions. [2022-11-25 18:23:49,323 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.479002624671916 [2022-11-25 18:23:49,323 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 730 transitions. [2022-11-25 18:23:49,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 730 transitions. [2022-11-25 18:23:49,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:23:49,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 730 transitions. [2022-11-25 18:23:49,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.66666666666667) internal successors, (730), 6 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:49,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:49,329 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:49,329 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 84 flow. Second operand 6 states and 730 transitions. [2022-11-25 18:23:49,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 286 flow [2022-11-25 18:23:49,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 59 transitions, 281 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 18:23:49,336 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 123 flow [2022-11-25 18:23:49,337 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=123, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-11-25 18:23:49,340 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2022-11-25 18:23:49,340 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 123 flow [2022-11-25 18:23:49,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:49,341 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:23:49,341 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:49,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:23:49,341 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:23:49,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:49,342 INFO L85 PathProgramCache]: Analyzing trace with hash 885996454, now seen corresponding path program 1 times [2022-11-25 18:23:49,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:49,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16244344] [2022-11-25 18:23:49,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:49,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:49,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:49,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16244344] [2022-11-25 18:23:49,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16244344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:49,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:49,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:23:49,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472336356] [2022-11-25 18:23:49,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:49,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:23:49,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:49,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:23:49,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:23:49,714 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 254 [2022-11-25 18:23:49,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:49,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:23:49,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 254 [2022-11-25 18:23:49,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:23:50,150 INFO L130 PetriNetUnfolder]: 850/1410 cut-off events. [2022-11-25 18:23:50,151 INFO L131 PetriNetUnfolder]: For 1723/1772 co-relation queries the response was YES. [2022-11-25 18:23:50,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4056 conditions, 1410 events. 850/1410 cut-off events. For 1723/1772 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7105 event pairs, 118 based on Foata normal form. 51/1452 useless extension candidates. Maximal degree in co-relation 4046. Up to 994 conditions per place. [2022-11-25 18:23:50,165 INFO L137 encePairwiseOnDemand]: 246/254 looper letters, 40 selfloop transitions, 8 changer transitions 12/63 dead transitions. [2022-11-25 18:23:50,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 365 flow [2022-11-25 18:23:50,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:23:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:23:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 718 transitions. [2022-11-25 18:23:50,169 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47112860892388453 [2022-11-25 18:23:50,169 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 718 transitions. [2022-11-25 18:23:50,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 718 transitions. [2022-11-25 18:23:50,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:23:50,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 718 transitions. [2022-11-25 18:23:50,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:50,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:50,176 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:50,177 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 123 flow. Second operand 6 states and 718 transitions. [2022-11-25 18:23:50,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 365 flow [2022-11-25 18:23:50,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 349 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-11-25 18:23:50,184 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 158 flow [2022-11-25 18:23:50,185 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2022-11-25 18:23:50,185 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2022-11-25 18:23:50,186 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 158 flow [2022-11-25 18:23:50,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:50,187 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:23:50,187 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:50,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:23:50,187 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:23:50,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:50,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1716545306, now seen corresponding path program 2 times [2022-11-25 18:23:50,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:50,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654909922] [2022-11-25 18:23:50,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:50,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:50,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:50,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:50,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654909922] [2022-11-25 18:23:50,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654909922] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:50,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:50,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:23:50,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239076101] [2022-11-25 18:23:50,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:50,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:23:50,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:50,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:23:50,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:23:50,784 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 254 [2022-11-25 18:23:50,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:50,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:23:50,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 254 [2022-11-25 18:23:50,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:23:51,275 INFO L130 PetriNetUnfolder]: 814/1344 cut-off events. [2022-11-25 18:23:51,275 INFO L131 PetriNetUnfolder]: For 2441/2531 co-relation queries the response was YES. [2022-11-25 18:23:51,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4272 conditions, 1344 events. 814/1344 cut-off events. For 2441/2531 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6590 event pairs, 126 based on Foata normal form. 57/1392 useless extension candidates. Maximal degree in co-relation 4260. Up to 976 conditions per place. [2022-11-25 18:23:51,289 INFO L137 encePairwiseOnDemand]: 246/254 looper letters, 38 selfloop transitions, 8 changer transitions 12/61 dead transitions. [2022-11-25 18:23:51,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 382 flow [2022-11-25 18:23:51,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:23:51,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:23:51,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 728 transitions. [2022-11-25 18:23:51,293 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4776902887139108 [2022-11-25 18:23:51,293 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 728 transitions. [2022-11-25 18:23:51,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 728 transitions. [2022-11-25 18:23:51,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:23:51,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 728 transitions. [2022-11-25 18:23:51,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:51,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:51,301 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:51,301 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 158 flow. Second operand 6 states and 728 transitions. [2022-11-25 18:23:51,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 382 flow [2022-11-25 18:23:51,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 361 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-11-25 18:23:51,311 INFO L231 Difference]: Finished difference. Result has 50 places, 32 transitions, 169 flow [2022-11-25 18:23:51,311 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=50, PETRI_TRANSITIONS=32} [2022-11-25 18:23:51,312 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2022-11-25 18:23:51,312 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 32 transitions, 169 flow [2022-11-25 18:23:51,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:51,313 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:23:51,313 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:51,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:23:51,314 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:23:51,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:51,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1697428811, now seen corresponding path program 1 times [2022-11-25 18:23:51,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:51,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684570929] [2022-11-25 18:23:51,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:51,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:51,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:51,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684570929] [2022-11-25 18:23:51,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684570929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:51,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:51,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:23:51,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119502180] [2022-11-25 18:23:51,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:51,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:23:51,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:51,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:23:51,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:23:51,980 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 254 [2022-11-25 18:23:51,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 32 transitions, 169 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:51,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:23:51,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 254 [2022-11-25 18:23:51,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:23:52,491 INFO L130 PetriNetUnfolder]: 829/1355 cut-off events. [2022-11-25 18:23:52,491 INFO L131 PetriNetUnfolder]: For 2720/2845 co-relation queries the response was YES. [2022-11-25 18:23:52,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4394 conditions, 1355 events. 829/1355 cut-off events. For 2720/2845 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6579 event pairs, 150 based on Foata normal form. 54/1400 useless extension candidates. Maximal degree in co-relation 4381. Up to 997 conditions per place. [2022-11-25 18:23:52,505 INFO L137 encePairwiseOnDemand]: 245/254 looper letters, 43 selfloop transitions, 12 changer transitions 7/65 dead transitions. [2022-11-25 18:23:52,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 413 flow [2022-11-25 18:23:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:23:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 18:23:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 725 transitions. [2022-11-25 18:23:52,509 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4757217847769029 [2022-11-25 18:23:52,509 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 725 transitions. [2022-11-25 18:23:52,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 725 transitions. [2022-11-25 18:23:52,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:23:52,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 725 transitions. [2022-11-25 18:23:52,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:52,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:52,517 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:52,517 INFO L175 Difference]: Start difference. First operand has 50 places, 32 transitions, 169 flow. Second operand 6 states and 725 transitions. [2022-11-25 18:23:52,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 413 flow [2022-11-25 18:23:52,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 65 transitions, 389 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-11-25 18:23:52,525 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 208 flow [2022-11-25 18:23:52,526 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2022-11-25 18:23:52,527 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2022-11-25 18:23:52,527 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 208 flow [2022-11-25 18:23:52,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:52,528 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:23:52,528 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:52,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:23:52,528 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:23:52,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1741345145, now seen corresponding path program 2 times [2022-11-25 18:23:52,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:52,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495658688] [2022-11-25 18:23:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:53,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:53,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495658688] [2022-11-25 18:23:53,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495658688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:53,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:53,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:23:53,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770364511] [2022-11-25 18:23:53,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:53,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:23:53,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:53,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:23:53,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:23:53,424 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 254 [2022-11-25 18:23:53,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:53,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:23:53,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 254 [2022-11-25 18:23:53,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:23:53,980 INFO L130 PetriNetUnfolder]: 904/1474 cut-off events. [2022-11-25 18:23:53,981 INFO L131 PetriNetUnfolder]: For 3319/3500 co-relation queries the response was YES. [2022-11-25 18:23:53,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5150 conditions, 1474 events. 904/1474 cut-off events. For 3319/3500 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7303 event pairs, 116 based on Foata normal form. 62/1527 useless extension candidates. Maximal degree in co-relation 5138. Up to 898 conditions per place. [2022-11-25 18:23:53,996 INFO L137 encePairwiseOnDemand]: 245/254 looper letters, 45 selfloop transitions, 16 changer transitions 12/76 dead transitions. [2022-11-25 18:23:53,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 76 transitions, 528 flow [2022-11-25 18:23:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:23:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:23:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 845 transitions. [2022-11-25 18:23:53,999 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4752530933633296 [2022-11-25 18:23:53,999 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 845 transitions. [2022-11-25 18:23:53,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 845 transitions. [2022-11-25 18:23:54,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:23:54,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 845 transitions. [2022-11-25 18:23:54,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:54,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:54,005 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:54,005 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 208 flow. Second operand 7 states and 845 transitions. [2022-11-25 18:23:54,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 76 transitions, 528 flow [2022-11-25 18:23:54,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 493 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-11-25 18:23:54,012 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 258 flow [2022-11-25 18:23:54,012 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=258, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2022-11-25 18:23:54,013 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2022-11-25 18:23:54,013 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 258 flow [2022-11-25 18:23:54,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:54,015 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:23:54,015 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:54,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:23:54,015 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:23:54,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:54,016 INFO L85 PathProgramCache]: Analyzing trace with hash 42711665, now seen corresponding path program 1 times [2022-11-25 18:23:54,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:54,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653447879] [2022-11-25 18:23:54,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:54,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:54,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:54,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653447879] [2022-11-25 18:23:54,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653447879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:54,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:54,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:23:54,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146275217] [2022-11-25 18:23:54,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:54,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:23:54,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:54,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:23:54,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:23:54,556 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 254 [2022-11-25 18:23:54,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:54,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:23:54,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 254 [2022-11-25 18:23:54,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:23:55,598 INFO L130 PetriNetUnfolder]: 2286/3454 cut-off events. [2022-11-25 18:23:55,598 INFO L131 PetriNetUnfolder]: For 11019/11049 co-relation queries the response was YES. [2022-11-25 18:23:55,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13293 conditions, 3454 events. 2286/3454 cut-off events. For 11019/11049 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16983 event pairs, 201 based on Foata normal form. 79/3528 useless extension candidates. Maximal degree in co-relation 13279. Up to 1683 conditions per place. [2022-11-25 18:23:55,643 INFO L137 encePairwiseOnDemand]: 245/254 looper letters, 72 selfloop transitions, 15 changer transitions 17/107 dead transitions. [2022-11-25 18:23:55,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 107 transitions, 896 flow [2022-11-25 18:23:55,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:23:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:23:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 790 transitions. [2022-11-25 18:23:55,647 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44431946006749157 [2022-11-25 18:23:55,647 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 790 transitions. [2022-11-25 18:23:55,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 790 transitions. [2022-11-25 18:23:55,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:23:55,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 790 transitions. [2022-11-25 18:23:55,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.85714285714286) internal successors, (790), 7 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:55,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:55,654 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:55,655 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 258 flow. Second operand 7 states and 790 transitions. [2022-11-25 18:23:55,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 107 transitions, 896 flow [2022-11-25 18:23:55,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 107 transitions, 831 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-11-25 18:23:55,677 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 390 flow [2022-11-25 18:23:55,677 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=390, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2022-11-25 18:23:55,678 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2022-11-25 18:23:55,678 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 390 flow [2022-11-25 18:23:55,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:55,679 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:23:55,679 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:55,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:23:55,679 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:23:55,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:55,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1378032049, now seen corresponding path program 2 times [2022-11-25 18:23:55,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:55,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989388884] [2022-11-25 18:23:55,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:55,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:55,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:55,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989388884] [2022-11-25 18:23:55,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989388884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:55,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:55,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:23:55,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415680900] [2022-11-25 18:23:55,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:55,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:23:55,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:55,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:23:55,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:23:55,881 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 254 [2022-11-25 18:23:55,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:55,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:23:55,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 254 [2022-11-25 18:23:55,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:23:56,190 INFO L130 PetriNetUnfolder]: 687/1241 cut-off events. [2022-11-25 18:23:56,191 INFO L131 PetriNetUnfolder]: For 5829/5871 co-relation queries the response was YES. [2022-11-25 18:23:56,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5264 conditions, 1241 events. 687/1241 cut-off events. For 5829/5871 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6630 event pairs, 157 based on Foata normal form. 71/1266 useless extension candidates. Maximal degree in co-relation 5246. Up to 934 conditions per place. [2022-11-25 18:23:56,202 INFO L137 encePairwiseOnDemand]: 249/254 looper letters, 55 selfloop transitions, 4 changer transitions 3/70 dead transitions. [2022-11-25 18:23:56,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 625 flow [2022-11-25 18:23:56,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:23:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:23:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2022-11-25 18:23:56,204 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.484251968503937 [2022-11-25 18:23:56,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2022-11-25 18:23:56,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2022-11-25 18:23:56,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:23:56,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2022-11-25 18:23:56,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:56,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:56,208 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:56,208 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 390 flow. Second operand 3 states and 369 transitions. [2022-11-25 18:23:56,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 625 flow [2022-11-25 18:23:56,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 623 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 18:23:56,216 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 376 flow [2022-11-25 18:23:56,217 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2022-11-25 18:23:56,218 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2022-11-25 18:23:56,218 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 376 flow [2022-11-25 18:23:56,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:56,219 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:23:56,219 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:56,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:23:56,219 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:23:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:56,220 INFO L85 PathProgramCache]: Analyzing trace with hash -394125154, now seen corresponding path program 1 times [2022-11-25 18:23:56,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:56,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614837670] [2022-11-25 18:23:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:56,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:56,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:56,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614837670] [2022-11-25 18:23:56,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614837670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:56,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:56,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:23:56,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494852265] [2022-11-25 18:23:56,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:56,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:23:56,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:56,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:23:56,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:23:56,387 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 254 [2022-11-25 18:23:56,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 376 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:56,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:23:56,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 254 [2022-11-25 18:23:56,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:23:56,588 INFO L130 PetriNetUnfolder]: 309/627 cut-off events. [2022-11-25 18:23:56,588 INFO L131 PetriNetUnfolder]: For 2653/2689 co-relation queries the response was YES. [2022-11-25 18:23:56,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2761 conditions, 627 events. 309/627 cut-off events. For 2653/2689 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3069 event pairs, 61 based on Foata normal form. 73/686 useless extension candidates. Maximal degree in co-relation 2742. Up to 192 conditions per place. [2022-11-25 18:23:56,594 INFO L137 encePairwiseOnDemand]: 249/254 looper letters, 60 selfloop transitions, 7 changer transitions 5/80 dead transitions. [2022-11-25 18:23:56,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 728 flow [2022-11-25 18:23:56,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:23:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:23:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-11-25 18:23:56,598 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.484251968503937 [2022-11-25 18:23:56,598 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2022-11-25 18:23:56,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2022-11-25 18:23:56,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:23:56,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2022-11-25 18:23:56,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:56,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:56,602 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:56,602 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 376 flow. Second operand 4 states and 492 transitions. [2022-11-25 18:23:56,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 728 flow [2022-11-25 18:23:56,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 80 transitions, 722 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 18:23:56,614 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 398 flow [2022-11-25 18:23:56,615 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=398, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2022-11-25 18:23:56,615 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2022-11-25 18:23:56,615 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 398 flow [2022-11-25 18:23:56,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:56,616 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:23:56,616 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:56,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:23:56,616 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:23:56,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:56,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1900333455, now seen corresponding path program 1 times [2022-11-25 18:23:56,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:56,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825344317] [2022-11-25 18:23:56,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:56,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:56,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:56,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825344317] [2022-11-25 18:23:56,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825344317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:56,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:56,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:23:56,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067541808] [2022-11-25 18:23:56,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:56,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:23:56,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:56,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:23:56,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:23:56,829 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 254 [2022-11-25 18:23:56,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 398 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:56,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:23:56,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 254 [2022-11-25 18:23:56,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:23:57,012 INFO L130 PetriNetUnfolder]: 255/508 cut-off events. [2022-11-25 18:23:57,012 INFO L131 PetriNetUnfolder]: For 2395/2431 co-relation queries the response was YES. [2022-11-25 18:23:57,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2277 conditions, 508 events. 255/508 cut-off events. For 2395/2431 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2443 event pairs, 51 based on Foata normal form. 30/526 useless extension candidates. Maximal degree in co-relation 2257. Up to 192 conditions per place. [2022-11-25 18:23:57,016 INFO L137 encePairwiseOnDemand]: 249/254 looper letters, 45 selfloop transitions, 10 changer transitions 19/80 dead transitions. [2022-11-25 18:23:57,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 80 transitions, 750 flow [2022-11-25 18:23:57,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:23:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:23:57,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-11-25 18:23:57,019 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4755905511811024 [2022-11-25 18:23:57,019 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2022-11-25 18:23:57,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2022-11-25 18:23:57,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:23:57,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2022-11-25 18:23:57,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:57,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:57,025 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:57,025 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 398 flow. Second operand 5 states and 604 transitions. [2022-11-25 18:23:57,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 80 transitions, 750 flow [2022-11-25 18:23:57,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 687 flow, removed 19 selfloop flow, removed 4 redundant places. [2022-11-25 18:23:57,034 INFO L231 Difference]: Finished difference. Result has 63 places, 42 transitions, 279 flow [2022-11-25 18:23:57,035 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=63, PETRI_TRANSITIONS=42} [2022-11-25 18:23:57,036 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2022-11-25 18:23:57,036 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 42 transitions, 279 flow [2022-11-25 18:23:57,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:57,036 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:23:57,037 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:57,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:23:57,037 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:23:57,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:57,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1883877079, now seen corresponding path program 1 times [2022-11-25 18:23:57,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:57,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110787421] [2022-11-25 18:23:57,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:57,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:23:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:23:57,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:23:57,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110787421] [2022-11-25 18:23:57,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110787421] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:23:57,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:23:57,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:23:57,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450949252] [2022-11-25 18:23:57,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:23:57,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:23:57,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:23:57,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:23:57,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:23:57,668 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 254 [2022-11-25 18:23:57,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 42 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:57,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:23:57,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 254 [2022-11-25 18:23:57,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:23:58,143 INFO L130 PetriNetUnfolder]: 314/596 cut-off events. [2022-11-25 18:23:58,144 INFO L131 PetriNetUnfolder]: For 2204/2207 co-relation queries the response was YES. [2022-11-25 18:23:58,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 596 events. 314/596 cut-off events. For 2204/2207 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2571 event pairs, 71 based on Foata normal form. 1/594 useless extension candidates. Maximal degree in co-relation 2579. Up to 369 conditions per place. [2022-11-25 18:23:58,149 INFO L137 encePairwiseOnDemand]: 247/254 looper letters, 40 selfloop transitions, 3 changer transitions 44/89 dead transitions. [2022-11-25 18:23:58,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 754 flow [2022-11-25 18:23:58,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:23:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:23:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 776 transitions. [2022-11-25 18:23:58,152 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4364454443194601 [2022-11-25 18:23:58,153 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 776 transitions. [2022-11-25 18:23:58,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 776 transitions. [2022-11-25 18:23:58,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:23:58,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 776 transitions. [2022-11-25 18:23:58,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:58,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:58,160 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:58,160 INFO L175 Difference]: Start difference. First operand has 63 places, 42 transitions, 279 flow. Second operand 7 states and 776 transitions. [2022-11-25 18:23:58,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 754 flow [2022-11-25 18:23:58,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 89 transitions, 634 flow, removed 39 selfloop flow, removed 9 redundant places. [2022-11-25 18:23:58,169 INFO L231 Difference]: Finished difference. Result has 61 places, 35 transitions, 189 flow [2022-11-25 18:23:58,169 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=189, PETRI_PLACES=61, PETRI_TRANSITIONS=35} [2022-11-25 18:23:58,170 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2022-11-25 18:23:58,170 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 35 transitions, 189 flow [2022-11-25 18:23:58,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:23:58,171 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:23:58,171 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:58,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:23:58,171 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:23:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:23:58,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1459110017, now seen corresponding path program 2 times [2022-11-25 18:23:58,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:23:58,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201916324] [2022-11-25 18:23:58,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:23:58,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:23:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:23:58,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:23:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:23:58,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 18:23:58,304 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:23:58,305 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-25 18:23:58,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-25 18:23:58,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-25 18:23:58,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-25 18:23:58,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-25 18:23:58,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-25 18:23:58,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-25 18:23:58,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-25 18:23:58,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-25 18:23:58,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-25 18:23:58,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-25 18:23:58,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-25 18:23:58,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-25 18:23:58,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 18:23:58,311 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:23:58,317 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 18:23:58,317 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:23:58,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:23:58 BasicIcfg [2022-11-25 18:23:58,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:23:58,411 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:23:58,411 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:23:58,412 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:23:58,412 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:23:35" (3/4) ... [2022-11-25 18:23:58,415 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 18:23:58,416 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:23:58,416 INFO L158 Benchmark]: Toolchain (without parser) took 25148.04ms. Allocated memory was 132.1MB in the beginning and 436.2MB in the end (delta: 304.1MB). Free memory was 87.4MB in the beginning and 284.2MB in the end (delta: -196.8MB). Peak memory consumption was 109.3MB. Max. memory is 16.1GB. [2022-11-25 18:23:58,417 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 132.1MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:23:58,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 583.80ms. Allocated memory is still 132.1MB. Free memory was 87.4MB in the beginning and 60.6MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 18:23:58,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.78ms. Allocated memory is still 132.1MB. Free memory was 60.6MB in the beginning and 58.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:23:58,418 INFO L158 Benchmark]: Boogie Preprocessor took 77.42ms. Allocated memory is still 132.1MB. Free memory was 58.1MB in the beginning and 56.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:23:58,418 INFO L158 Benchmark]: RCFGBuilder took 1194.61ms. Allocated memory was 132.1MB in the beginning and 174.1MB in the end (delta: 41.9MB). Free memory was 56.0MB in the beginning and 113.4MB in the end (delta: -57.4MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2022-11-25 18:23:58,419 INFO L158 Benchmark]: TraceAbstraction took 23196.81ms. Allocated memory was 174.1MB in the beginning and 436.2MB in the end (delta: 262.1MB). Free memory was 113.4MB in the beginning and 284.2MB in the end (delta: -170.9MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2022-11-25 18:23:58,419 INFO L158 Benchmark]: Witness Printer took 4.37ms. Allocated memory is still 436.2MB. Free memory is still 284.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:23:58,421 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.37ms. Allocated memory is still 132.1MB. Free memory is still 106.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 583.80ms. Allocated memory is still 132.1MB. Free memory was 87.4MB in the beginning and 60.6MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.78ms. Allocated memory is still 132.1MB. Free memory was 60.6MB in the beginning and 58.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.42ms. Allocated memory is still 132.1MB. Free memory was 58.1MB in the beginning and 56.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1194.61ms. Allocated memory was 132.1MB in the beginning and 174.1MB in the end (delta: 41.9MB). Free memory was 56.0MB in the beginning and 113.4MB in the end (delta: -57.4MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * TraceAbstraction took 23196.81ms. Allocated memory was 174.1MB in the beginning and 436.2MB in the end (delta: 262.1MB). Free memory was 113.4MB in the beginning and 284.2MB in the end (delta: -170.9MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. * Witness Printer took 4.37ms. Allocated memory is still 436.2MB. Free memory is still 284.2MB. 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: 7.2s, 134 PlacesBefore, 42 PlacesAfterwards, 126 TransitionsBefore, 33 TransitionsAfterwards, 2506 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 125 TotalNumberOfCompositions, 6733 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2829, independent: 2645, independent conditional: 0, independent unconditional: 2645, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1609, independent: 1561, independent conditional: 0, independent unconditional: 1561, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1609, independent: 1537, independent conditional: 0, independent unconditional: 1537, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 562, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 519, dependent conditional: 0, dependent unconditional: 519, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2829, independent: 1084, independent conditional: 0, independent unconditional: 1084, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 1609, unknown conditional: 0, unknown unconditional: 1609] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 145, Positive conditional cache size: 0, Positive unconditional cache size: 145, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019; [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=-2, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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, z=0] [L832] 0 pthread_t t1020; [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=-1, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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, z=0] [L834] 0 pthread_t t1021; [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L796] 3 y = 1 [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 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) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 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 [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 833]: 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: 831]: 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: 835]: 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, 158 locations, 13 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: 22.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 765 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 606 mSDsluCounter, 397 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 315 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1939 IncrementalHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 82 mSDtfsCounter, 1939 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=398occurred in iteration=13, InterpolantAutomatonStates: 78, 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.4s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 1708 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 18:23:58,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/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_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/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_d332a42f-74b8-4df1-af3a-9df17b71ee24/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 b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 18:24:00,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:24:00,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:24:00,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:24:00,946 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:24:00,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:24:00,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:24:00,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:24:00,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:24:00,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:24:00,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:24:00,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:24:00,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:24:00,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:24:00,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:24:00,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:24:00,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:24:00,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:24:00,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:24:00,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:24:00,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:24:00,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:24:00,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:24:00,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:24:00,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:24:00,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:24:00,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:24:00,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:24:00,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:24:00,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:24:00,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:24:00,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:24:00,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:24:01,004 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:24:01,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:24:01,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:24:01,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:24:01,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:24:01,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:24:01,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:24:01,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:24:01,013 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 18:24:01,043 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:24:01,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:24:01,044 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:24:01,044 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:24:01,045 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:24:01,046 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:24:01,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:24:01,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:24:01,052 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:24:01,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:24:01,053 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:24:01,053 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:24:01,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:24:01,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:24:01,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:24:01,058 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:24:01,059 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:24:01,059 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:24:01,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:24:01,060 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:24:01,060 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 18:24:01,061 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 18:24:01,061 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:24:01,063 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:24:01,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:24:01,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:24:01,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:24:01,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:24:01,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:24:01,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:24:01,066 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 18:24:01,066 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 18:24:01,066 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:24:01,067 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:24:01,067 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:24:01,067 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 18:24:01,069 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_d332a42f-74b8-4df1-af3a-9df17b71ee24/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_d332a42f-74b8-4df1-af3a-9df17b71ee24/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 -> b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e [2022-11-25 18:24:01,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:24:01,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:24:01,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:24:01,614 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:24:01,615 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:24:01,622 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2022-11-25 18:24:05,367 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:24:05,685 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:24:05,685 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2022-11-25 18:24:05,704 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/data/e9c728763/caf4b6ad0f27499ea2c0fedba4a6adde/FLAGa1693a5a8 [2022-11-25 18:24:05,741 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/data/e9c728763/caf4b6ad0f27499ea2c0fedba4a6adde [2022-11-25 18:24:05,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:24:05,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:24:05,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:24:05,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:24:05,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:24:05,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:24:05" (1/1) ... [2022-11-25 18:24:05,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@977ef62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:05, skipping insertion in model container [2022-11-25 18:24:05,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:24:05" (1/1) ... [2022-11-25 18:24:05,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:24:05,858 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:24:06,073 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_d332a42f-74b8-4df1-af3a-9df17b71ee24/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i[949,962] [2022-11-25 18:24:06,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,294 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,304 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:24:06,349 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:24:06,365 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_d332a42f-74b8-4df1-af3a-9df17b71ee24/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i[949,962] [2022-11-25 18:24:06,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,408 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 18:24:06,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 18:24:06,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:24:06,521 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:24:06,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:06 WrapperNode [2022-11-25 18:24:06,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:24:06,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:24:06,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:24:06,527 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:24:06,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:06" (1/1) ... [2022-11-25 18:24:06,589 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:06" (1/1) ... [2022-11-25 18:24:06,642 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-11-25 18:24:06,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:24:06,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:24:06,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:24:06,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:24:06,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:06" (1/1) ... [2022-11-25 18:24:06,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:06" (1/1) ... [2022-11-25 18:24:06,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:06" (1/1) ... [2022-11-25 18:24:06,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:06" (1/1) ... [2022-11-25 18:24:06,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:06" (1/1) ... [2022-11-25 18:24:06,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:06" (1/1) ... [2022-11-25 18:24:06,717 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:06" (1/1) ... [2022-11-25 18:24:06,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:06" (1/1) ... [2022-11-25 18:24:06,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:24:06,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:24:06,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:24:06,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:24:06,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:06" (1/1) ... [2022-11-25 18:24:06,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:24:06,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:06,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:24:06,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:24:06,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 18:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:24:06,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 18:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 18:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 18:24:06,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 18:24:06,858 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 18:24:06,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 18:24:06,859 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 18:24:06,860 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 18:24:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 18:24:06,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:24:06,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:24:06,863 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 18:24:07,080 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:24:07,096 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:24:07,811 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:24:08,034 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:24:08,035 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:24:08,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:24:08 BoogieIcfgContainer [2022-11-25 18:24:08,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:24:08,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:24:08,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:24:08,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:24:08,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:24:05" (1/3) ... [2022-11-25 18:24:08,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8a7140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:24:08, skipping insertion in model container [2022-11-25 18:24:08,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:06" (2/3) ... [2022-11-25 18:24:08,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8a7140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:24:08, skipping insertion in model container [2022-11-25 18:24:08,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:24:08" (3/3) ... [2022-11-25 18:24:08,069 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2022-11-25 18:24:08,094 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:24:08,094 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-25 18:24:08,094 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 18:24:08,215 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 18:24:08,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 130 transitions, 275 flow [2022-11-25 18:24:08,377 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-11-25 18:24:08,378 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:24:08,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-25 18:24:08,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 130 transitions, 275 flow [2022-11-25 18:24:08,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 127 transitions, 263 flow [2022-11-25 18:24:08,405 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 18:24:08,435 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 127 transitions, 263 flow [2022-11-25 18:24:08,448 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 127 transitions, 263 flow [2022-11-25 18:24:08,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 263 flow [2022-11-25 18:24:08,516 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-11-25 18:24:08,517 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:24:08,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-25 18:24:08,523 INFO L119 LiptonReduction]: Number of co-enabled transitions 2506 [2022-11-25 18:24:20,135 INFO L134 LiptonReduction]: Checked pairs total: 6797 [2022-11-25 18:24:20,136 INFO L136 LiptonReduction]: Total number of compositions: 124 [2022-11-25 18:24:20,157 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:24:20,165 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;@1b986665, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:24:20,165 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-25 18:24:20,167 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 18:24:20,168 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:24:20,168 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:24:20,169 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 18:24:20,170 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:24:20,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:20,176 INFO L85 PathProgramCache]: Analyzing trace with hash 555, now seen corresponding path program 1 times [2022-11-25 18:24:20,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:24:20,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017945064] [2022-11-25 18:24:20,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:20,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:20,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:24:20,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:24:20,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 18:24:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:20,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 18:24:20,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:24:20,335 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:20,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:24:20,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017945064] [2022-11-25 18:24:20,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017945064] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:20,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:20,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 18:24:20,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021677818] [2022-11-25 18:24:20,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:20,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 18:24:20,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:24:20,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 18:24:20,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 18:24:20,391 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 254 [2022-11-25 18:24:20,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:20,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:24:20,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 254 [2022-11-25 18:24:20,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:24:21,133 INFO L130 PetriNetUnfolder]: 1277/1955 cut-off events. [2022-11-25 18:24:21,133 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-25 18:24:21,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3896 conditions, 1955 events. 1277/1955 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9727 event pairs, 1277 based on Foata normal form. 0/1627 useless extension candidates. Maximal degree in co-relation 3885. Up to 1887 conditions per place. [2022-11-25 18:24:21,153 INFO L137 encePairwiseOnDemand]: 247/254 looper letters, 22 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2022-11-25 18:24:21,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 105 flow [2022-11-25 18:24:21,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 18:24:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 18:24:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 263 transitions. [2022-11-25 18:24:21,175 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5177165354330708 [2022-11-25 18:24:21,176 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 263 transitions. [2022-11-25 18:24:21,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 263 transitions. [2022-11-25 18:24:21,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:24:21,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 263 transitions. [2022-11-25 18:24:21,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:21,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:21,190 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:21,192 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 263 transitions. [2022-11-25 18:24:21,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 105 flow [2022-11-25 18:24:21,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 18:24:21,199 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2022-11-25 18:24:21,201 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2022-11-25 18:24:21,205 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2022-11-25 18:24:21,206 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2022-11-25 18:24:21,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:21,207 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:24:21,207 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 18:24:21,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/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)] Ended with exit code 0 [2022-11-25 18:24:21,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:21,419 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:24:21,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash 523053297, now seen corresponding path program 1 times [2022-11-25 18:24:21,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:24:21,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538364472] [2022-11-25 18:24:21,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:21,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:21,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:24:21,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:24:21,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 18:24:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:21,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:24:21,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:24:21,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:21,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:24:21,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538364472] [2022-11-25 18:24:21,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1538364472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:21,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:21,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 18:24:21,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167337162] [2022-11-25 18:24:21,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:21,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:24:21,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:24:21,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:24:21,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:24:21,616 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 254 [2022-11-25 18:24:21,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:21,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:24:21,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 254 [2022-11-25 18:24:21,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:24:22,065 INFO L130 PetriNetUnfolder]: 999/1626 cut-off events. [2022-11-25 18:24:22,066 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 18:24:22,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3159 conditions, 1626 events. 999/1626 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8818 event pairs, 165 based on Foata normal form. 0/1485 useless extension candidates. Maximal degree in co-relation 3156. Up to 1195 conditions per place. [2022-11-25 18:24:22,078 INFO L137 encePairwiseOnDemand]: 251/254 looper letters, 31 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2022-11-25 18:24:22,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 156 flow [2022-11-25 18:24:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:24:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:24:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2022-11-25 18:24:22,087 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5039370078740157 [2022-11-25 18:24:22,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2022-11-25 18:24:22,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2022-11-25 18:24:22,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:24:22,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2022-11-25 18:24:22,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 18:24:22,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:22,099 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:22,099 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 384 transitions. [2022-11-25 18:24:22,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 156 flow [2022-11-25 18:24:22,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 18:24:22,102 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow [2022-11-25 18:24:22,102 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-11-25 18:24:22,105 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2022-11-25 18:24:22,105 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow [2022-11-25 18:24:22,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:22,110 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:24:22,111 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:22,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:22,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:22,332 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:24:22,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:22,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1037749274, now seen corresponding path program 1 times [2022-11-25 18:24:22,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:24:22,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121753021] [2022-11-25 18:24:22,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:22,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:22,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:24:22,336 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:24:22,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 18:24:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:22,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:24:22,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:24:22,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:22,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:24:22,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121753021] [2022-11-25 18:24:22,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121753021] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:22,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:22,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:24:22,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168770939] [2022-11-25 18:24:22,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:22,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:24:22,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:24:22,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:24:22,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:24:22,545 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 254 [2022-11-25 18:24:22,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:22,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:24:22,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 254 [2022-11-25 18:24:22,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:24:22,787 INFO L130 PetriNetUnfolder]: 450/763 cut-off events. [2022-11-25 18:24:22,787 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-11-25 18:24:22,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1609 conditions, 763 events. 450/763 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3505 event pairs, 112 based on Foata normal form. 27/741 useless extension candidates. Maximal degree in co-relation 1605. Up to 633 conditions per place. [2022-11-25 18:24:22,792 INFO L137 encePairwiseOnDemand]: 249/254 looper letters, 29 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2022-11-25 18:24:22,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 156 flow [2022-11-25 18:24:22,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:24:22,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 18:24:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2022-11-25 18:24:22,795 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.489501312335958 [2022-11-25 18:24:22,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2022-11-25 18:24:22,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2022-11-25 18:24:22,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:24:22,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2022-11-25 18:24:22,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:22,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:22,800 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:22,800 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 3 states and 373 transitions. [2022-11-25 18:24:22,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 156 flow [2022-11-25 18:24:22,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 18:24:22,808 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 80 flow [2022-11-25 18:24:22,809 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2022-11-25 18:24:22,809 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2022-11-25 18:24:22,809 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 80 flow [2022-11-25 18:24:22,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:22,810 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:24:22,810 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:22,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:23,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:23,023 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:24:23,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:23,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1635475705, now seen corresponding path program 1 times [2022-11-25 18:24:23,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:24:23,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094210075] [2022-11-25 18:24:23,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:23,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:23,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:24:23,026 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:24:23,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 18:24:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:23,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:24:23,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:24:23,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:23,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:24:23,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094210075] [2022-11-25 18:24:23,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094210075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:23,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:23,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:24:23,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167400070] [2022-11-25 18:24:23,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:23,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:24:23,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:24:23,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:24:23,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:24:23,253 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 254 [2022-11-25 18:24:23,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:23,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:24:23,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 254 [2022-11-25 18:24:23,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:24:23,447 INFO L130 PetriNetUnfolder]: 180/358 cut-off events. [2022-11-25 18:24:23,447 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-11-25 18:24:23,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 358 events. 180/358 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1446 event pairs, 61 based on Foata normal form. 27/370 useless extension candidates. Maximal degree in co-relation 868. Up to 129 conditions per place. [2022-11-25 18:24:23,450 INFO L137 encePairwiseOnDemand]: 249/254 looper letters, 37 selfloop transitions, 7 changer transitions 0/48 dead transitions. [2022-11-25 18:24:23,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 222 flow [2022-11-25 18:24:23,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:24:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 18:24:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 497 transitions. [2022-11-25 18:24:23,453 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4891732283464567 [2022-11-25 18:24:23,453 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 497 transitions. [2022-11-25 18:24:23,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 497 transitions. [2022-11-25 18:24:23,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:24:23,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 497 transitions. [2022-11-25 18:24:23,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:23,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:23,458 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:23,458 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 80 flow. Second operand 4 states and 497 transitions. [2022-11-25 18:24:23,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 222 flow [2022-11-25 18:24:23,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:24:23,461 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 116 flow [2022-11-25 18:24:23,461 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2022-11-25 18:24:23,462 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2022-11-25 18:24:23,463 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 116 flow [2022-11-25 18:24:23,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:23,463 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:24:23,464 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 18:24:23,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:23,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:23,676 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:24:23,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1227292231, now seen corresponding path program 1 times [2022-11-25 18:24:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:24:23,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824271589] [2022-11-25 18:24:23,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:23,677 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:23,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:24:23,681 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:24:23,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 18:24:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:23,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 18:24:23,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:24:23,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:23,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:24:23,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824271589] [2022-11-25 18:24:23,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824271589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:23,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:23,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:24:23,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46248911] [2022-11-25 18:24:23,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:23,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:23,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:24:23,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:23,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:23,924 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 254 [2022-11-25 18:24:23,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:23,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:24:23,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 254 [2022-11-25 18:24:23,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:24:24,169 INFO L130 PetriNetUnfolder]: 135/268 cut-off events. [2022-11-25 18:24:24,170 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-11-25 18:24:24,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 268 events. 135/268 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1041 event pairs, 56 based on Foata normal form. 9/271 useless extension candidates. Maximal degree in co-relation 713. Up to 108 conditions per place. [2022-11-25 18:24:24,172 INFO L137 encePairwiseOnDemand]: 249/254 looper letters, 34 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2022-11-25 18:24:24,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 246 flow [2022-11-25 18:24:24,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:24:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:24:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-11-25 18:24:24,177 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48031496062992124 [2022-11-25 18:24:24,177 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2022-11-25 18:24:24,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2022-11-25 18:24:24,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:24:24,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2022-11-25 18:24:24,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:24,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:24,184 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:24,184 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 116 flow. Second operand 5 states and 610 transitions. [2022-11-25 18:24:24,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 246 flow [2022-11-25 18:24:24,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 232 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-25 18:24:24,189 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 130 flow [2022-11-25 18:24:24,189 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-11-25 18:24:24,192 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2022-11-25 18:24:24,193 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 130 flow [2022-11-25 18:24:24,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:24,193 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:24:24,194 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:24,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/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)] Ended with exit code 0 [2022-11-25 18:24:24,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:24,406 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:24:24,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:24,407 INFO L85 PathProgramCache]: Analyzing trace with hash -404950437, now seen corresponding path program 1 times [2022-11-25 18:24:24,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:24:24,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325289834] [2022-11-25 18:24:24,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:24,408 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:24,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:24:24,408 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:24:24,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 18:24:24,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:24,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:24:24,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:24:24,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:24,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:24:24,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325289834] [2022-11-25 18:24:24,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325289834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:24,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:24,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:24:24,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081578540] [2022-11-25 18:24:24,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:24,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:24,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:24:24,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:24,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:24,859 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 254 [2022-11-25 18:24:24,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:24,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:24:24,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 254 [2022-11-25 18:24:24,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:24:25,155 INFO L130 PetriNetUnfolder]: 198/384 cut-off events. [2022-11-25 18:24:25,156 INFO L131 PetriNetUnfolder]: For 378/378 co-relation queries the response was YES. [2022-11-25 18:24:25,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 384 events. 198/384 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1571 event pairs, 38 based on Foata normal form. 0/381 useless extension candidates. Maximal degree in co-relation 1087. Up to 224 conditions per place. [2022-11-25 18:24:25,160 INFO L137 encePairwiseOnDemand]: 250/254 looper letters, 54 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2022-11-25 18:24:25,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 60 transitions, 390 flow [2022-11-25 18:24:25,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:24:25,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:24:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2022-11-25 18:24:25,164 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4755905511811024 [2022-11-25 18:24:25,164 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2022-11-25 18:24:25,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2022-11-25 18:24:25,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:24:25,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2022-11-25 18:24:25,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:25,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:25,172 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:25,172 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 130 flow. Second operand 5 states and 604 transitions. [2022-11-25 18:24:25,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 60 transitions, 390 flow [2022-11-25 18:24:25,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 334 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-11-25 18:24:25,183 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 125 flow [2022-11-25 18:24:25,183 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-11-25 18:24:25,186 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2022-11-25 18:24:25,186 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 125 flow [2022-11-25 18:24:25,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:25,187 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:24:25,187 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:25,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/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 18:24:25,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:25,402 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:24:25,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:25,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1642250376, now seen corresponding path program 1 times [2022-11-25 18:24:25,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:24:25,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443652759] [2022-11-25 18:24:25,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:25,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:25,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:24:25,405 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:24:25,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 18:24:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:25,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 18:24:25,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:24:26,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:26,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:24:26,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443652759] [2022-11-25 18:24:26,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443652759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:26,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:26,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:24:26,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404295052] [2022-11-25 18:24:26,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:26,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:26,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:24:26,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:26,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:26,416 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 254 [2022-11-25 18:24:26,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:26,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:24:26,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 254 [2022-11-25 18:24:26,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:24:26,733 INFO L130 PetriNetUnfolder]: 178/356 cut-off events. [2022-11-25 18:24:26,734 INFO L131 PetriNetUnfolder]: For 257/257 co-relation queries the response was YES. [2022-11-25 18:24:26,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988 conditions, 356 events. 178/356 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1513 event pairs, 68 based on Foata normal form. 2/353 useless extension candidates. Maximal degree in co-relation 978. Up to 286 conditions per place. [2022-11-25 18:24:26,737 INFO L137 encePairwiseOnDemand]: 250/254 looper letters, 25 selfloop transitions, 3 changer transitions 10/42 dead transitions. [2022-11-25 18:24:26,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 245 flow [2022-11-25 18:24:26,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:24:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:24:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2022-11-25 18:24:26,740 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4204724409448819 [2022-11-25 18:24:26,740 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2022-11-25 18:24:26,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2022-11-25 18:24:26,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:24:26,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2022-11-25 18:24:26,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:26,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:26,746 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:26,746 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 125 flow. Second operand 5 states and 534 transitions. [2022-11-25 18:24:26,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 245 flow [2022-11-25 18:24:26,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 18:24:26,750 INFO L231 Difference]: Finished difference. Result has 47 places, 29 transitions, 116 flow [2022-11-25 18:24:26,750 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=47, PETRI_TRANSITIONS=29} [2022-11-25 18:24:26,751 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2022-11-25 18:24:26,751 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 29 transitions, 116 flow [2022-11-25 18:24:26,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:26,752 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:24:26,752 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:26,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:26,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:26,966 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:24:26,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:26,967 INFO L85 PathProgramCache]: Analyzing trace with hash -469265939, now seen corresponding path program 2 times [2022-11-25 18:24:26,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:24:26,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717926761] [2022-11-25 18:24:26,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:24:26,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:26,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:24:26,973 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:24:27,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 18:24:27,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 18:24:27,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:24:27,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-25 18:24:27,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:24:27,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:27,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:24:27,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717926761] [2022-11-25 18:24:27,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717926761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:27,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:27,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 18:24:27,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838361438] [2022-11-25 18:24:27,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:27,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:24:27,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:24:27,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:24:27,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:24:28,095 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 254 [2022-11-25 18:24:28,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 29 transitions, 116 flow. Second operand has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:28,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:24:28,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 254 [2022-11-25 18:24:28,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:24:28,603 INFO L130 PetriNetUnfolder]: 224/463 cut-off events. [2022-11-25 18:24:28,603 INFO L131 PetriNetUnfolder]: For 298/298 co-relation queries the response was YES. [2022-11-25 18:24:28,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 463 events. 224/463 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2066 event pairs, 66 based on Foata normal form. 1/462 useless extension candidates. Maximal degree in co-relation 1265. Up to 189 conditions per place. [2022-11-25 18:24:28,607 INFO L137 encePairwiseOnDemand]: 248/254 looper letters, 40 selfloop transitions, 6 changer transitions 17/66 dead transitions. [2022-11-25 18:24:28,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 392 flow [2022-11-25 18:24:28,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:24:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 18:24:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 827 transitions. [2022-11-25 18:24:28,611 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4651293588301462 [2022-11-25 18:24:28,611 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 827 transitions. [2022-11-25 18:24:28,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 827 transitions. [2022-11-25 18:24:28,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:24:28,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 827 transitions. [2022-11-25 18:24:28,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:28,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:28,619 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:28,620 INFO L175 Difference]: Start difference. First operand has 47 places, 29 transitions, 116 flow. Second operand 7 states and 827 transitions. [2022-11-25 18:24:28,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 392 flow [2022-11-25 18:24:28,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 376 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-11-25 18:24:28,624 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 129 flow [2022-11-25 18:24:28,625 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=129, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2022-11-25 18:24:28,625 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2022-11-25 18:24:28,625 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 129 flow [2022-11-25 18:24:28,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:28,626 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:24:28,627 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:28,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/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 18:24:28,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:28,852 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:24:28,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:28,853 INFO L85 PathProgramCache]: Analyzing trace with hash -598518799, now seen corresponding path program 3 times [2022-11-25 18:24:28,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:24:28,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883054881] [2022-11-25 18:24:28,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:24:28,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:28,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:24:28,861 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:24:28,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 18:24:28,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 18:24:28,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:24:29,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 18:24:29,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:24:29,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:29,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 18:24:29,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883054881] [2022-11-25 18:24:29,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883054881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:29,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:29,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:24:29,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006318553] [2022-11-25 18:24:29,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:29,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:29,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 18:24:29,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:29,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:29,222 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 254 [2022-11-25 18:24:29,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:29,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 18:24:29,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 254 [2022-11-25 18:24:29,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 18:24:29,446 INFO L130 PetriNetUnfolder]: 205/425 cut-off events. [2022-11-25 18:24:29,446 INFO L131 PetriNetUnfolder]: For 279/280 co-relation queries the response was YES. [2022-11-25 18:24:29,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1254 conditions, 425 events. 205/425 cut-off events. For 279/280 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1785 event pairs, 111 based on Foata normal form. 1/425 useless extension candidates. Maximal degree in co-relation 1244. Up to 157 conditions per place. [2022-11-25 18:24:29,450 INFO L137 encePairwiseOnDemand]: 250/254 looper letters, 25 selfloop transitions, 1 changer transitions 28/57 dead transitions. [2022-11-25 18:24:29,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 354 flow [2022-11-25 18:24:29,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:24:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 18:24:29,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2022-11-25 18:24:29,453 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47086614173228347 [2022-11-25 18:24:29,454 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 598 transitions. [2022-11-25 18:24:29,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 598 transitions. [2022-11-25 18:24:29,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 18:24:29,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 598 transitions. [2022-11-25 18:24:29,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:29,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:29,460 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:29,461 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 129 flow. Second operand 5 states and 598 transitions. [2022-11-25 18:24:29,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 354 flow [2022-11-25 18:24:29,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 344 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 18:24:29,465 INFO L231 Difference]: Finished difference. Result has 51 places, 29 transitions, 123 flow [2022-11-25 18:24:29,465 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2022-11-25 18:24:29,466 INFO L288 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-11-25 18:24:29,466 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 123 flow [2022-11-25 18:24:29,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:29,467 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 18:24:29,467 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:29,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:29,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:29,691 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 18:24:29,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:29,691 INFO L85 PathProgramCache]: Analyzing trace with hash -764404627, now seen corresponding path program 4 times [2022-11-25 18:24:29,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 18:24:29,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140058702] [2022-11-25 18:24:29,692 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 18:24:29,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:29,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 18:24:29,694 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 18:24:29,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 18:24:29,908 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 18:24:29,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 18:24:29,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 18:24:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 18:24:30,070 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 18:24:30,070 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 18:24:30,071 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-25 18:24:30,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-25 18:24:30,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-25 18:24:30,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-25 18:24:30,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-25 18:24:30,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-25 18:24:30,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-25 18:24:30,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-25 18:24:30,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-25 18:24:30,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-25 18:24:30,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-25 18:24:30,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-25 18:24:30,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-25 18:24:30,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:30,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 18:24:30,289 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:30,295 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 18:24:30,295 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:24:30,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:24:30 BasicIcfg [2022-11-25 18:24:30,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:24:30,424 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:24:30,424 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:24:30,424 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:24:30,425 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:24:08" (3/4) ... [2022-11-25 18:24:30,432 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 18:24:30,432 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:24:30,433 INFO L158 Benchmark]: Toolchain (without parser) took 24684.14ms. Allocated memory was 73.4MB in the beginning and 159.4MB in the end (delta: 86.0MB). Free memory was 30.9MB in the beginning and 43.9MB in the end (delta: -13.0MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2022-11-25 18:24:30,433 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 73.4MB. Free memory was 52.2MB in the beginning and 52.1MB in the end (delta: 82.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:24:30,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 769.66ms. Allocated memory is still 73.4MB. Free memory was 30.8MB in the beginning and 50.8MB in the end (delta: -20.1MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2022-11-25 18:24:30,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.73ms. Allocated memory is still 73.4MB. Free memory was 50.8MB in the beginning and 48.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:24:30,437 INFO L158 Benchmark]: Boogie Preprocessor took 84.93ms. Allocated memory is still 73.4MB. Free memory was 48.0MB in the beginning and 45.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:24:30,437 INFO L158 Benchmark]: RCFGBuilder took 1311.52ms. Allocated memory was 73.4MB in the beginning and 109.1MB in the end (delta: 35.7MB). Free memory was 45.9MB in the beginning and 59.7MB in the end (delta: -13.8MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2022-11-25 18:24:30,446 INFO L158 Benchmark]: TraceAbstraction took 22369.11ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 59.2MB in the beginning and 43.9MB in the end (delta: 15.3MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2022-11-25 18:24:30,447 INFO L158 Benchmark]: Witness Printer took 8.23ms. Allocated memory is still 159.4MB. Free memory is still 43.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:24:30,450 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.67ms. Allocated memory is still 73.4MB. Free memory was 52.2MB in the beginning and 52.1MB in the end (delta: 82.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 769.66ms. Allocated memory is still 73.4MB. Free memory was 30.8MB in the beginning and 50.8MB in the end (delta: -20.1MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.73ms. Allocated memory is still 73.4MB. Free memory was 50.8MB in the beginning and 48.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.93ms. Allocated memory is still 73.4MB. Free memory was 48.0MB in the beginning and 45.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1311.52ms. Allocated memory was 73.4MB in the beginning and 109.1MB in the end (delta: 35.7MB). Free memory was 45.9MB in the beginning and 59.7MB in the end (delta: -13.8MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22369.11ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 59.2MB in the beginning and 43.9MB in the end (delta: 15.3MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * Witness Printer took 8.23ms. Allocated memory is still 159.4MB. Free memory is still 43.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.7s, 135 PlacesBefore, 42 PlacesAfterwards, 127 TransitionsBefore, 33 TransitionsAfterwards, 2506 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 124 TotalNumberOfCompositions, 6797 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2953, independent: 2769, independent conditional: 0, independent unconditional: 2769, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1648, independent: 1600, independent conditional: 0, independent unconditional: 1600, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1648, independent: 1568, independent conditional: 0, independent unconditional: 1568, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 552, independent: 91, independent conditional: 0, independent unconditional: 91, dependent: 461, dependent conditional: 0, dependent unconditional: 461, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2953, independent: 1169, independent conditional: 0, independent unconditional: 1169, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 1648, unknown conditional: 0, unknown unconditional: 1648] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 165, Positive conditional cache size: 0, Positive unconditional cache size: 165, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019; [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=0, t1019={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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, z=0] [L832] 0 pthread_t t1020; [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=1, t1019={-6:0}, t1020={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_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, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] 0 pthread_t t1021; [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=2, t1019={-6:0}, t1020={-10:0}, t1021={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L796] 3 y = 1 [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 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) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 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 [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={-6:0}, t1020={-10:0}, t1021={-2:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 833]: 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: 831]: 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: 835]: 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, 159 locations, 13 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: 22.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 313 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 197 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1058 IncrementalHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 19 mSDtfsCounter, 1058 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=5, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 131 ConstructedInterpolants, 17 QuantifiedInterpolants, 1384 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1163 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 18:24:30,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d332a42f-74b8-4df1-af3a-9df17b71ee24/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample