./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/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_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/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_8040ad72-63f3-4b88-98f9-b591f1dd6c25/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 b8efebf87dc67f98045ac231dc43d6a61f436e058244f16134f1d46d3b696c80 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:54:37,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:54:37,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:54:37,272 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:54:37,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:54:37,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:54:37,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:54:37,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:54:37,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:54:37,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:54:37,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:54:37,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:54:37,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:54:37,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:54:37,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:54:37,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:54:37,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:54:37,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:54:37,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:54:37,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:54:37,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:54:37,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:54:37,332 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:54:37,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:54:37,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:54:37,346 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:54:37,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:54:37,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:54:37,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:54:37,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:54:37,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:54:37,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:54:37,358 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:54:37,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:54:37,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:54:37,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:54:37,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:54:37,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:54:37,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:54:37,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:54:37,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:54:37,367 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:54:37,417 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:54:37,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:54:37,418 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:54:37,418 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:54:37,419 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:54:37,420 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:54:37,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:54:37,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:54:37,421 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:54:37,421 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:54:37,423 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:54:37,423 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:54:37,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:54:37,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:54:37,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:54:37,424 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:54:37,424 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:54:37,424 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:54:37,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:54:37,425 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:54:37,425 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:54:37,425 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:54:37,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:54:37,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:54:37,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:54:37,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:54:37,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:54:37,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:54:37,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:54:37,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:54:37,428 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:54:37,428 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:54:37,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:54:37,429 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_8040ad72-63f3-4b88-98f9-b591f1dd6c25/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_8040ad72-63f3-4b88-98f9-b591f1dd6c25/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 -> b8efebf87dc67f98045ac231dc43d6a61f436e058244f16134f1d46d3b696c80 [2022-11-25 17:54:37,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:54:37,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:54:37,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:54:37,761 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:54:37,762 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:54:37,763 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:54:41,629 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:54:42,097 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:54:42,098 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/sv-benchmarks/c/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:54:42,129 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/data/0b511ad6f/a365eb2b3951413aadf22f2bbd9d7c6f/FLAG7d172956a [2022-11-25 17:54:42,148 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/data/0b511ad6f/a365eb2b3951413aadf22f2bbd9d7c6f [2022-11-25 17:54:42,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:54:42,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:54:42,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:54:42,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:54:42,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:54:42,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:54:42" (1/1) ... [2022-11-25 17:54:42,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@206f7ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:42, skipping insertion in model container [2022-11-25 17:54:42,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:54:42" (1/1) ... [2022-11-25 17:54:42,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:54:42,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:54:42,481 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_8040ad72-63f3-4b88-98f9-b591f1dd6c25/sv-benchmarks/c/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 17:54:42,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,711 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:54:42,839 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:54:42,862 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_8040ad72-63f3-4b88-98f9-b591f1dd6c25/sv-benchmarks/c/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 17:54:42,918 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,973 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:42,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:42,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:43,000 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:43,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:43,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:43,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:43,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:43,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:43,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:54:43,066 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:54:43,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:43 WrapperNode [2022-11-25 17:54:43,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:54:43,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:54:43,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:54:43,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:54:43,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:43" (1/1) ... [2022-11-25 17:54:43,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:43" (1/1) ... [2022-11-25 17:54:43,191 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-25 17:54:43,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:54:43,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:54:43,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:54:43,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:54:43,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:43" (1/1) ... [2022-11-25 17:54:43,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:43" (1/1) ... [2022-11-25 17:54:43,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:43" (1/1) ... [2022-11-25 17:54:43,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:43" (1/1) ... [2022-11-25 17:54:43,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:43" (1/1) ... [2022-11-25 17:54:43,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:43" (1/1) ... [2022-11-25 17:54:43,260 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:43" (1/1) ... [2022-11-25 17:54:43,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:43" (1/1) ... [2022-11-25 17:54:43,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:54:43,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:54:43,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:54:43,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:54:43,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:43" (1/1) ... [2022-11-25 17:54:43,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:54:43,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:54:43,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:54:43,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:54:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:54:43,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:54:43,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:54:43,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:54:43,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:54:43,404 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:54:43,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:54:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:54:43,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:54:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:54:43,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:54:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 17:54:43,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 17:54:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:54:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:54:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:54:43,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:54:43,410 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:54:43,696 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:54:43,698 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:54:44,269 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:54:44,573 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:54:44,574 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:54:44,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:54:44 BoogieIcfgContainer [2022-11-25 17:54:44,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:54:44,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:54:44,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:54:44,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:54:44,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:54:42" (1/3) ... [2022-11-25 17:54:44,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa9d4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:54:44, skipping insertion in model container [2022-11-25 17:54:44,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:43" (2/3) ... [2022-11-25 17:54:44,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa9d4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:54:44, skipping insertion in model container [2022-11-25 17:54:44,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:54:44" (3/3) ... [2022-11-25 17:54:44,593 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:54:44,622 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:54:44,622 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 17:54:44,623 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:54:44,705 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:54:44,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 314 flow [2022-11-25 17:54:44,871 INFO L130 PetriNetUnfolder]: 2/143 cut-off events. [2022-11-25 17:54:44,876 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:54:44,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 2/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-25 17:54:44,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 147 transitions, 314 flow [2022-11-25 17:54:44,897 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 143 transitions, 298 flow [2022-11-25 17:54:44,903 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:54:44,936 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 143 transitions, 298 flow [2022-11-25 17:54:44,947 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 143 transitions, 298 flow [2022-11-25 17:54:44,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 298 flow [2022-11-25 17:54:45,015 INFO L130 PetriNetUnfolder]: 2/143 cut-off events. [2022-11-25 17:54:45,015 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:54:45,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 2/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-25 17:54:45,020 INFO L119 LiptonReduction]: Number of co-enabled transitions 3644 [2022-11-25 17:54:53,991 INFO L134 LiptonReduction]: Checked pairs total: 10025 [2022-11-25 17:54:53,991 INFO L136 LiptonReduction]: Total number of compositions: 145 [2022-11-25 17:54:54,025 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:54:54,036 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;@58be63c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:54:54,037 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 17:54:54,040 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 17:54:54,041 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:54:54,041 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:54,043 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:54:54,043 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:54:54,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:54,051 INFO L85 PathProgramCache]: Analyzing trace with hash 623, now seen corresponding path program 1 times [2022-11-25 17:54:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:54,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136372954] [2022-11-25 17:54:54,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:54,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:54:54,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:54,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136372954] [2022-11-25 17:54:54,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136372954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:54,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:54,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:54:54,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218957714] [2022-11-25 17:54:54,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:54,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:54:54,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:54,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:54:54,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:54:54,313 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 292 [2022-11-25 17:54:54,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:54,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:54,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 292 [2022-11-25 17:54:54,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:56,728 INFO L130 PetriNetUnfolder]: 7479/10111 cut-off events. [2022-11-25 17:54:56,728 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-11-25 17:54:56,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20419 conditions, 10111 events. 7479/10111 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 50774 event pairs, 7479 based on Foata normal form. 0/8764 useless extension candidates. Maximal degree in co-relation 20407. Up to 10091 conditions per place. [2022-11-25 17:54:56,848 INFO L137 encePairwiseOnDemand]: 284/292 looper letters, 27 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2022-11-25 17:54:56,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 126 flow [2022-11-25 17:54:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:54:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:54:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 299 transitions. [2022-11-25 17:54:56,883 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.511986301369863 [2022-11-25 17:54:56,884 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 299 transitions. [2022-11-25 17:54:56,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 299 transitions. [2022-11-25 17:54:56,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:56,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 299 transitions. [2022-11-25 17:54:56,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:56,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:56,913 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:56,915 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 2 states and 299 transitions. [2022-11-25 17:54:56,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 126 flow [2022-11-25 17:54:56,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 17:54:56,930 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2022-11-25 17:54:56,933 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-11-25 17:54:56,938 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2022-11-25 17:54:56,939 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2022-11-25 17:54:56,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:56,940 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:56,941 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:54:56,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:54:56,945 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:54:56,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:56,958 INFO L85 PathProgramCache]: Analyzing trace with hash 614915, now seen corresponding path program 1 times [2022-11-25 17:54:56,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:56,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126127452] [2022-11-25 17:54:56,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:56,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:57,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:54:57,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:57,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126127452] [2022-11-25 17:54:57,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126127452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:57,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:57,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:54:57,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261240096] [2022-11-25 17:54:57,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:57,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:54:57,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:57,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:54:57,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:54:57,452 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 292 [2022-11-25 17:54:57,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:57,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:57,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 292 [2022-11-25 17:54:57,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:59,253 INFO L130 PetriNetUnfolder]: 5879/8106 cut-off events. [2022-11-25 17:54:59,254 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:54:59,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16247 conditions, 8106 events. 5879/8106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 40973 event pairs, 2239 based on Foata normal form. 0/7461 useless extension candidates. Maximal degree in co-relation 16244. Up to 6367 conditions per place. [2022-11-25 17:54:59,340 INFO L137 encePairwiseOnDemand]: 289/292 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2022-11-25 17:54:59,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 208 flow [2022-11-25 17:54:59,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:54:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:54:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2022-11-25 17:54:59,345 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5034246575342466 [2022-11-25 17:54:59,345 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2022-11-25 17:54:59,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2022-11-25 17:54:59,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:59,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2022-11-25 17:54:59,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:59,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:59,357 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:59,357 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 441 transitions. [2022-11-25 17:54:59,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 208 flow [2022-11-25 17:54:59,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:54:59,360 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2022-11-25 17:54:59,360 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-11-25 17:54:59,362 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2022-11-25 17:54:59,363 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2022-11-25 17:54:59,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:59,364 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:59,365 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:59,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:54:59,366 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:54:59,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:59,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2130120043, now seen corresponding path program 1 times [2022-11-25 17:54:59,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:59,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455448681] [2022-11-25 17:54:59,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:59,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:59,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:54:59,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:59,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455448681] [2022-11-25 17:54:59,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455448681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:59,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:59,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:54:59,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772441280] [2022-11-25 17:54:59,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:59,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:54:59,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:59,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:54:59,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:54:59,790 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 292 [2022-11-25 17:54:59,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:59,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:59,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 292 [2022-11-25 17:54:59,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:04,332 INFO L130 PetriNetUnfolder]: 17460/23679 cut-off events. [2022-11-25 17:55:04,332 INFO L131 PetriNetUnfolder]: For 1113/1113 co-relation queries the response was YES. [2022-11-25 17:55:04,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48981 conditions, 23679 events. 17460/23679 cut-off events. For 1113/1113 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 126400 event pairs, 6102 based on Foata normal form. 0/23079 useless extension candidates. Maximal degree in co-relation 48977. Up to 13105 conditions per place. [2022-11-25 17:55:04,532 INFO L137 encePairwiseOnDemand]: 283/292 looper letters, 43 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2022-11-25 17:55:04,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 222 flow [2022-11-25 17:55:04,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:55:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:55:04,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-11-25 17:55:04,536 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4805936073059361 [2022-11-25 17:55:04,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2022-11-25 17:55:04,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2022-11-25 17:55:04,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:04,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2022-11-25 17:55:04,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:04,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:04,545 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:04,545 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 421 transitions. [2022-11-25 17:55:04,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 222 flow [2022-11-25 17:55:04,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:55:04,548 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 126 flow [2022-11-25 17:55:04,549 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2022-11-25 17:55:04,550 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2022-11-25 17:55:04,550 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 126 flow [2022-11-25 17:55:04,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:04,551 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:04,552 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:04,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:55:04,553 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:55:04,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:04,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2130120035, now seen corresponding path program 1 times [2022-11-25 17:55:04,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:04,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412611471] [2022-11-25 17:55:04,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:04,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:05,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:05,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412611471] [2022-11-25 17:55:05,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412611471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:05,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:05,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:55:05,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959219720] [2022-11-25 17:55:05,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:05,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:55:05,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:05,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:55:05,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:55:06,018 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 292 [2022-11-25 17:55:06,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:06,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:06,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 292 [2022-11-25 17:55:06,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:08,703 INFO L130 PetriNetUnfolder]: 10845/15224 cut-off events. [2022-11-25 17:55:08,703 INFO L131 PetriNetUnfolder]: For 6989/7160 co-relation queries the response was YES. [2022-11-25 17:55:08,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36204 conditions, 15224 events. 10845/15224 cut-off events. For 6989/7160 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 86569 event pairs, 3844 based on Foata normal form. 1113/15848 useless extension candidates. Maximal degree in co-relation 36199. Up to 13986 conditions per place. [2022-11-25 17:55:08,821 INFO L137 encePairwiseOnDemand]: 287/292 looper letters, 41 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2022-11-25 17:55:08,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 250 flow [2022-11-25 17:55:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:55:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:55:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 727 transitions. [2022-11-25 17:55:08,826 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4149543378995434 [2022-11-25 17:55:08,826 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 727 transitions. [2022-11-25 17:55:08,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 727 transitions. [2022-11-25 17:55:08,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:08,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 727 transitions. [2022-11-25 17:55:08,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:08,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 292.0) internal successors, (2044), 7 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:08,836 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 292.0) internal successors, (2044), 7 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:08,837 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 126 flow. Second operand 6 states and 727 transitions. [2022-11-25 17:55:08,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 250 flow [2022-11-25 17:55:08,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:55:08,861 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 110 flow [2022-11-25 17:55:08,861 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-11-25 17:55:08,862 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -7 predicate places. [2022-11-25 17:55:08,863 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 110 flow [2022-11-25 17:55:08,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:08,864 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:08,864 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:08,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:55:08,865 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:55:08,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:08,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1110481339, now seen corresponding path program 1 times [2022-11-25 17:55:08,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:08,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356032863] [2022-11-25 17:55:08,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:08,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:09,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:09,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356032863] [2022-11-25 17:55:09,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356032863] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:09,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:09,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:55:09,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645854397] [2022-11-25 17:55:09,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:09,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:55:09,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:09,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:55:09,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:55:09,150 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 292 [2022-11-25 17:55:09,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:09,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:09,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 292 [2022-11-25 17:55:09,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:12,189 INFO L130 PetriNetUnfolder]: 13388/18294 cut-off events. [2022-11-25 17:55:12,190 INFO L131 PetriNetUnfolder]: For 3231/3231 co-relation queries the response was YES. [2022-11-25 17:55:12,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43104 conditions, 18294 events. 13388/18294 cut-off events. For 3231/3231 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 94691 event pairs, 1209 based on Foata normal form. 40/18334 useless extension candidates. Maximal degree in co-relation 43099. Up to 10001 conditions per place. [2022-11-25 17:55:12,334 INFO L137 encePairwiseOnDemand]: 284/292 looper letters, 55 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2022-11-25 17:55:12,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 334 flow [2022-11-25 17:55:12,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:55:12,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:55:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2022-11-25 17:55:12,338 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4751712328767123 [2022-11-25 17:55:12,338 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2022-11-25 17:55:12,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2022-11-25 17:55:12,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:12,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2022-11-25 17:55:12,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:12,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:12,360 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:12,360 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 110 flow. Second operand 4 states and 555 transitions. [2022-11-25 17:55:12,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 334 flow [2022-11-25 17:55:12,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 325 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 17:55:12,367 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 187 flow [2022-11-25 17:55:12,368 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-11-25 17:55:12,371 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2022-11-25 17:55:12,371 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 187 flow [2022-11-25 17:55:12,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:12,373 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:12,373 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:12,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:55:12,374 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:55:12,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:12,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1609214906, now seen corresponding path program 1 times [2022-11-25 17:55:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:12,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128039634] [2022-11-25 17:55:12,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:12,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:12,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:12,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128039634] [2022-11-25 17:55:12,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128039634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:12,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:12,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:55:12,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165145987] [2022-11-25 17:55:12,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:12,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:55:12,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:12,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:55:12,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:55:12,717 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 292 [2022-11-25 17:55:12,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:12,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:12,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 292 [2022-11-25 17:55:12,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:15,391 INFO L130 PetriNetUnfolder]: 13130/17948 cut-off events. [2022-11-25 17:55:15,392 INFO L131 PetriNetUnfolder]: For 14240/14240 co-relation queries the response was YES. [2022-11-25 17:55:15,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48709 conditions, 17948 events. 13130/17948 cut-off events. For 14240/14240 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 93749 event pairs, 2522 based on Foata normal form. 40/17988 useless extension candidates. Maximal degree in co-relation 48702. Up to 10157 conditions per place. [2022-11-25 17:55:15,510 INFO L137 encePairwiseOnDemand]: 284/292 looper letters, 64 selfloop transitions, 17 changer transitions 0/81 dead transitions. [2022-11-25 17:55:15,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 495 flow [2022-11-25 17:55:15,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:55:15,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:55:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2022-11-25 17:55:15,515 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4803082191780822 [2022-11-25 17:55:15,515 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2022-11-25 17:55:15,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2022-11-25 17:55:15,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:15,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2022-11-25 17:55:15,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:15,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:15,522 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:15,523 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 187 flow. Second operand 4 states and 561 transitions. [2022-11-25 17:55:15,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 495 flow [2022-11-25 17:55:15,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 81 transitions, 495 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:55:15,598 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 331 flow [2022-11-25 17:55:15,598 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=331, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2022-11-25 17:55:15,601 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2022-11-25 17:55:15,602 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 331 flow [2022-11-25 17:55:15,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:15,602 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:15,603 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:15,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:55:15,603 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:55:15,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:15,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1653978010, now seen corresponding path program 1 times [2022-11-25 17:55:15,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:15,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984089562] [2022-11-25 17:55:15,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:15,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:15,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:15,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984089562] [2022-11-25 17:55:15,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984089562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:15,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:15,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:55:15,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067535521] [2022-11-25 17:55:15,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:15,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:55:15,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:15,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:55:15,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:55:15,901 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 292 [2022-11-25 17:55:15,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 331 flow. Second operand has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:15,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:15,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 292 [2022-11-25 17:55:15,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:17,897 INFO L130 PetriNetUnfolder]: 8684/12755 cut-off events. [2022-11-25 17:55:17,897 INFO L131 PetriNetUnfolder]: For 23418/24836 co-relation queries the response was YES. [2022-11-25 17:55:17,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35823 conditions, 12755 events. 8684/12755 cut-off events. For 23418/24836 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 77729 event pairs, 1429 based on Foata normal form. 1307/13819 useless extension candidates. Maximal degree in co-relation 35813. Up to 8038 conditions per place. [2022-11-25 17:55:17,999 INFO L137 encePairwiseOnDemand]: 285/292 looper letters, 104 selfloop transitions, 10 changer transitions 0/127 dead transitions. [2022-11-25 17:55:17,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 127 transitions, 1026 flow [2022-11-25 17:55:18,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:55:18,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:55:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2022-11-25 17:55:18,003 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4808219178082192 [2022-11-25 17:55:18,003 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2022-11-25 17:55:18,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2022-11-25 17:55:18,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:18,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2022-11-25 17:55:18,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:18,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:18,011 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:18,011 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 331 flow. Second operand 5 states and 702 transitions. [2022-11-25 17:55:18,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 127 transitions, 1026 flow [2022-11-25 17:55:18,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 127 transitions, 1026 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:55:18,046 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 406 flow [2022-11-25 17:55:18,046 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2022-11-25 17:55:18,047 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2022-11-25 17:55:18,048 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 406 flow [2022-11-25 17:55:18,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:18,048 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:18,049 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:18,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:55:18,049 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:55:18,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:18,050 INFO L85 PathProgramCache]: Analyzing trace with hash -730001053, now seen corresponding path program 1 times [2022-11-25 17:55:18,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:18,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452703402] [2022-11-25 17:55:18,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:18,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:18,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:18,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452703402] [2022-11-25 17:55:18,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452703402] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:18,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:18,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:55:18,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058185736] [2022-11-25 17:55:18,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:18,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:55:18,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:18,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:55:18,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:55:18,345 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 292 [2022-11-25 17:55:18,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 406 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:18,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:18,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 292 [2022-11-25 17:55:18,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:21,061 INFO L130 PetriNetUnfolder]: 15353/21965 cut-off events. [2022-11-25 17:55:21,061 INFO L131 PetriNetUnfolder]: For 54251/54251 co-relation queries the response was YES. [2022-11-25 17:55:21,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80545 conditions, 21965 events. 15353/21965 cut-off events. For 54251/54251 co-relation queries the response was YES. Maximal size of possible extension queue 831. Compared 130839 event pairs, 4329 based on Foata normal form. 223/22188 useless extension candidates. Maximal degree in co-relation 80531. Up to 9905 conditions per place. [2022-11-25 17:55:21,198 INFO L137 encePairwiseOnDemand]: 284/292 looper letters, 80 selfloop transitions, 19 changer transitions 20/119 dead transitions. [2022-11-25 17:55:21,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 119 transitions, 956 flow [2022-11-25 17:55:21,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:55:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:55:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 564 transitions. [2022-11-25 17:55:21,201 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4828767123287671 [2022-11-25 17:55:21,201 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 564 transitions. [2022-11-25 17:55:21,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 564 transitions. [2022-11-25 17:55:21,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:21,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 564 transitions. [2022-11-25 17:55:21,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:21,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:21,209 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:21,209 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 406 flow. Second operand 4 states and 564 transitions. [2022-11-25 17:55:21,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 119 transitions, 956 flow [2022-11-25 17:55:21,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 119 transitions, 943 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:55:21,491 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 485 flow [2022-11-25 17:55:21,492 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=485, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2022-11-25 17:55:21,493 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2022-11-25 17:55:21,493 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 485 flow [2022-11-25 17:55:21,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:21,494 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:21,494 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:21,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:55:21,495 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:55:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:21,495 INFO L85 PathProgramCache]: Analyzing trace with hash -58933419, now seen corresponding path program 1 times [2022-11-25 17:55:21,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:21,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524328566] [2022-11-25 17:55:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:21,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:21,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:21,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524328566] [2022-11-25 17:55:21,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524328566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:21,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:21,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:55:21,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217963688] [2022-11-25 17:55:21,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:21,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:55:21,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:21,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:55:21,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:55:21,853 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 292 [2022-11-25 17:55:21,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 485 flow. Second operand has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:21,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:21,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 292 [2022-11-25 17:55:21,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:23,476 INFO L130 PetriNetUnfolder]: 6328/9790 cut-off events. [2022-11-25 17:55:23,476 INFO L131 PetriNetUnfolder]: For 28738/29593 co-relation queries the response was YES. [2022-11-25 17:55:23,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34282 conditions, 9790 events. 6328/9790 cut-off events. For 28738/29593 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 62321 event pairs, 946 based on Foata normal form. 1094/10708 useless extension candidates. Maximal degree in co-relation 34266. Up to 3583 conditions per place. [2022-11-25 17:55:23,542 INFO L137 encePairwiseOnDemand]: 285/292 looper letters, 126 selfloop transitions, 14 changer transitions 1/154 dead transitions. [2022-11-25 17:55:23,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 154 transitions, 1543 flow [2022-11-25 17:55:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:55:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:55:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions. [2022-11-25 17:55:23,546 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4823059360730594 [2022-11-25 17:55:23,547 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 845 transitions. [2022-11-25 17:55:23,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 845 transitions. [2022-11-25 17:55:23,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:23,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 845 transitions. [2022-11-25 17:55:23,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:23,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 292.0) internal successors, (2044), 7 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:23,555 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 292.0) internal successors, (2044), 7 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:23,555 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 485 flow. Second operand 6 states and 845 transitions. [2022-11-25 17:55:23,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 154 transitions, 1543 flow [2022-11-25 17:55:23,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 154 transitions, 1478 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-11-25 17:55:23,656 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 582 flow [2022-11-25 17:55:23,656 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=582, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2022-11-25 17:55:23,657 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2022-11-25 17:55:23,657 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 582 flow [2022-11-25 17:55:23,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:23,658 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:23,658 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:23,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:55:23,659 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:55:23,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:23,660 INFO L85 PathProgramCache]: Analyzing trace with hash -803941853, now seen corresponding path program 1 times [2022-11-25 17:55:23,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:23,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202345157] [2022-11-25 17:55:23,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:23,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:23,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:23,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202345157] [2022-11-25 17:55:23,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202345157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:23,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:23,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:55:23,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129307245] [2022-11-25 17:55:23,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:23,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:55:23,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:23,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:55:23,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:55:23,917 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 292 [2022-11-25 17:55:23,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 582 flow. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:23,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:23,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 292 [2022-11-25 17:55:23,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:26,709 INFO L130 PetriNetUnfolder]: 10802/16180 cut-off events. [2022-11-25 17:55:26,709 INFO L131 PetriNetUnfolder]: For 63932/63932 co-relation queries the response was YES. [2022-11-25 17:55:26,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70059 conditions, 16180 events. 10802/16180 cut-off events. For 63932/63932 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 99946 event pairs, 2268 based on Foata normal form. 76/16256 useless extension candidates. Maximal degree in co-relation 70040. Up to 8502 conditions per place. [2022-11-25 17:55:26,797 INFO L137 encePairwiseOnDemand]: 284/292 looper letters, 82 selfloop transitions, 18 changer transitions 29/129 dead transitions. [2022-11-25 17:55:26,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 129 transitions, 1321 flow [2022-11-25 17:55:26,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:55:26,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:55:26,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2022-11-25 17:55:26,801 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4794520547945205 [2022-11-25 17:55:26,801 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2022-11-25 17:55:26,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2022-11-25 17:55:26,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:26,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2022-11-25 17:55:26,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:26,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:26,807 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:26,808 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 582 flow. Second operand 4 states and 560 transitions. [2022-11-25 17:55:26,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 129 transitions, 1321 flow [2022-11-25 17:55:27,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 129 transitions, 1193 flow, removed 51 selfloop flow, removed 2 redundant places. [2022-11-25 17:55:27,711 INFO L231 Difference]: Finished difference. Result has 71 places, 57 transitions, 544 flow [2022-11-25 17:55:27,712 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=544, PETRI_PLACES=71, PETRI_TRANSITIONS=57} [2022-11-25 17:55:27,712 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2022-11-25 17:55:27,713 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 57 transitions, 544 flow [2022-11-25 17:55:27,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:27,713 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:27,713 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:27,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:55:27,714 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:55:27,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:27,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1911574567, now seen corresponding path program 1 times [2022-11-25 17:55:27,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:27,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699363086] [2022-11-25 17:55:27,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:27,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:28,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:28,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699363086] [2022-11-25 17:55:28,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699363086] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:28,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:28,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:55:28,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399499109] [2022-11-25 17:55:28,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:28,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:55:28,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:28,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:55:28,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:55:28,098 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 292 [2022-11-25 17:55:28,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 57 transitions, 544 flow. Second operand has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:28,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:28,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 292 [2022-11-25 17:55:28,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:29,453 INFO L130 PetriNetUnfolder]: 4434/7094 cut-off events. [2022-11-25 17:55:29,453 INFO L131 PetriNetUnfolder]: For 21997/22449 co-relation queries the response was YES. [2022-11-25 17:55:29,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26440 conditions, 7094 events. 4434/7094 cut-off events. For 21997/22449 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 45297 event pairs, 871 based on Foata normal form. 528/7448 useless extension candidates. Maximal degree in co-relation 26419. Up to 2375 conditions per place. [2022-11-25 17:55:29,497 INFO L137 encePairwiseOnDemand]: 285/292 looper letters, 111 selfloop transitions, 17 changer transitions 28/167 dead transitions. [2022-11-25 17:55:29,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 167 transitions, 1793 flow [2022-11-25 17:55:29,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:55:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:55:29,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 986 transitions. [2022-11-25 17:55:29,502 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48238747553816047 [2022-11-25 17:55:29,502 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 986 transitions. [2022-11-25 17:55:29,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 986 transitions. [2022-11-25 17:55:29,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:29,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 986 transitions. [2022-11-25 17:55:29,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.85714285714286) internal successors, (986), 7 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:29,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:29,512 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:29,512 INFO L175 Difference]: Start difference. First operand has 71 places, 57 transitions, 544 flow. Second operand 7 states and 986 transitions. [2022-11-25 17:55:29,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 167 transitions, 1793 flow [2022-11-25 17:55:29,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 167 transitions, 1648 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-11-25 17:55:29,572 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 612 flow [2022-11-25 17:55:29,573 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=612, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2022-11-25 17:55:29,573 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2022-11-25 17:55:29,573 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 612 flow [2022-11-25 17:55:29,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:29,574 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:29,575 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 17:55:29,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:55:29,575 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:55:29,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:29,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1173613902, now seen corresponding path program 1 times [2022-11-25 17:55:29,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:29,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740600264] [2022-11-25 17:55:29,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:29,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:31,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:31,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740600264] [2022-11-25 17:55:31,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740600264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:31,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:31,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:55:31,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797529738] [2022-11-25 17:55:31,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:31,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:55:31,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:31,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:55:31,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:55:31,067 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 292 [2022-11-25 17:55:31,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 612 flow. Second operand has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:31,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:31,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 292 [2022-11-25 17:55:31,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:33,416 INFO L130 PetriNetUnfolder]: 7261/12227 cut-off events. [2022-11-25 17:55:33,416 INFO L131 PetriNetUnfolder]: For 36540/36766 co-relation queries the response was YES. [2022-11-25 17:55:33,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51057 conditions, 12227 events. 7261/12227 cut-off events. For 36540/36766 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 92273 event pairs, 1033 based on Foata normal form. 101/12227 useless extension candidates. Maximal degree in co-relation 51034. Up to 4766 conditions per place. [2022-11-25 17:55:33,503 INFO L137 encePairwiseOnDemand]: 284/292 looper letters, 156 selfloop transitions, 7 changer transitions 31/205 dead transitions. [2022-11-25 17:55:33,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 205 transitions, 2166 flow [2022-11-25 17:55:33,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:55:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:55:33,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 855 transitions. [2022-11-25 17:55:33,508 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.488013698630137 [2022-11-25 17:55:33,508 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 855 transitions. [2022-11-25 17:55:33,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 855 transitions. [2022-11-25 17:55:33,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:33,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 855 transitions. [2022-11-25 17:55:33,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:33,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 292.0) internal successors, (2044), 7 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:33,517 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 292.0) internal successors, (2044), 7 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:33,518 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 612 flow. Second operand 6 states and 855 transitions. [2022-11-25 17:55:33,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 205 transitions, 2166 flow [2022-11-25 17:55:34,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 205 transitions, 1905 flow, removed 103 selfloop flow, removed 2 redundant places. [2022-11-25 17:55:34,590 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 607 flow [2022-11-25 17:55:34,591 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=607, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2022-11-25 17:55:34,592 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2022-11-25 17:55:34,592 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 607 flow [2022-11-25 17:55:34,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:34,593 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:34,593 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 17:55:34,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:55:34,594 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:55:34,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:34,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1016597042, now seen corresponding path program 2 times [2022-11-25 17:55:34,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:34,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99102198] [2022-11-25 17:55:34,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:34,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:34,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:34,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:34,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99102198] [2022-11-25 17:55:34,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99102198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:34,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:34,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:55:34,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575810537] [2022-11-25 17:55:34,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:34,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:55:34,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:34,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:55:34,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:55:34,990 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 292 [2022-11-25 17:55:34,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 607 flow. Second operand has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:34,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:34,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 292 [2022-11-25 17:55:34,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:37,216 INFO L130 PetriNetUnfolder]: 6969/11602 cut-off events. [2022-11-25 17:55:37,216 INFO L131 PetriNetUnfolder]: For 27972/28573 co-relation queries the response was YES. [2022-11-25 17:55:37,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46315 conditions, 11602 events. 6969/11602 cut-off events. For 27972/28573 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 86488 event pairs, 929 based on Foata normal form. 351/11759 useless extension candidates. Maximal degree in co-relation 46288. Up to 3785 conditions per place. [2022-11-25 17:55:37,301 INFO L137 encePairwiseOnDemand]: 285/292 looper letters, 97 selfloop transitions, 22 changer transitions 56/181 dead transitions. [2022-11-25 17:55:37,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 181 transitions, 1823 flow [2022-11-25 17:55:37,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:55:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 17:55:37,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1238 transitions. [2022-11-25 17:55:37,306 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4710806697108067 [2022-11-25 17:55:37,307 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1238 transitions. [2022-11-25 17:55:37,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1238 transitions. [2022-11-25 17:55:37,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:37,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1238 transitions. [2022-11-25 17:55:37,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.55555555555554) internal successors, (1238), 9 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:37,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 292.0) internal successors, (2920), 10 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:37,318 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 292.0) internal successors, (2920), 10 states have internal predecessors, (2920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:37,318 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 607 flow. Second operand 9 states and 1238 transitions. [2022-11-25 17:55:37,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 181 transitions, 1823 flow [2022-11-25 17:55:38,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 181 transitions, 1787 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-11-25 17:55:38,693 INFO L231 Difference]: Finished difference. Result has 89 places, 57 transitions, 505 flow [2022-11-25 17:55:38,693 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=505, PETRI_PLACES=89, PETRI_TRANSITIONS=57} [2022-11-25 17:55:38,694 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 38 predicate places. [2022-11-25 17:55:38,694 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 57 transitions, 505 flow [2022-11-25 17:55:38,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:38,695 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:38,695 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:38,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:55:38,696 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:55:38,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1360482362, now seen corresponding path program 1 times [2022-11-25 17:55:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:38,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573684626] [2022-11-25 17:55:38,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:38,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:39,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:39,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573684626] [2022-11-25 17:55:39,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573684626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:39,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:39,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:55:39,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895837269] [2022-11-25 17:55:39,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:39,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:55:39,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:39,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:55:39,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:55:39,074 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 292 [2022-11-25 17:55:39,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 57 transitions, 505 flow. Second operand has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:39,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:39,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 292 [2022-11-25 17:55:39,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:40,180 INFO L130 PetriNetUnfolder]: 2523/4084 cut-off events. [2022-11-25 17:55:40,180 INFO L131 PetriNetUnfolder]: For 15027/15128 co-relation queries the response was YES. [2022-11-25 17:55:40,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19095 conditions, 4084 events. 2523/4084 cut-off events. For 15027/15128 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 22951 event pairs, 555 based on Foata normal form. 77/4157 useless extension candidates. Maximal degree in co-relation 19065. Up to 2097 conditions per place. [2022-11-25 17:55:40,211 INFO L137 encePairwiseOnDemand]: 289/292 looper letters, 47 selfloop transitions, 1 changer transitions 56/106 dead transitions. [2022-11-25 17:55:40,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 106 transitions, 1074 flow [2022-11-25 17:55:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:55:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:55:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2022-11-25 17:55:40,215 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4811643835616438 [2022-11-25 17:55:40,215 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2022-11-25 17:55:40,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2022-11-25 17:55:40,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:40,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2022-11-25 17:55:40,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:40,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:40,221 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:40,221 INFO L175 Difference]: Start difference. First operand has 89 places, 57 transitions, 505 flow. Second operand 4 states and 562 transitions. [2022-11-25 17:55:40,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 106 transitions, 1074 flow [2022-11-25 17:55:40,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 106 transitions, 876 flow, removed 43 selfloop flow, removed 16 redundant places. [2022-11-25 17:55:40,311 INFO L231 Difference]: Finished difference. Result has 76 places, 42 transitions, 248 flow [2022-11-25 17:55:40,312 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=76, PETRI_TRANSITIONS=42} [2022-11-25 17:55:40,312 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2022-11-25 17:55:40,313 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 42 transitions, 248 flow [2022-11-25 17:55:40,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:40,313 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:40,314 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:40,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:55:40,314 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:55:40,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:40,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1327825766, now seen corresponding path program 2 times [2022-11-25 17:55:40,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:40,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830825830] [2022-11-25 17:55:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:40,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:55:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:55:41,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:55:41,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830825830] [2022-11-25 17:55:41,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830825830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:55:41,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:55:41,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:55:41,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325862323] [2022-11-25 17:55:41,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:55:41,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:55:41,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:55:41,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:55:41,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:55:41,944 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 292 [2022-11-25 17:55:41,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 42 transitions, 248 flow. Second operand has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:41,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:55:41,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 292 [2022-11-25 17:55:41,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:55:42,726 INFO L130 PetriNetUnfolder]: 962/1633 cut-off events. [2022-11-25 17:55:42,726 INFO L131 PetriNetUnfolder]: For 3216/3250 co-relation queries the response was YES. [2022-11-25 17:55:42,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6372 conditions, 1633 events. 962/1633 cut-off events. For 3216/3250 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8062 event pairs, 190 based on Foata normal form. 20/1647 useless extension candidates. Maximal degree in co-relation 6349. Up to 685 conditions per place. [2022-11-25 17:55:42,740 INFO L137 encePairwiseOnDemand]: 285/292 looper letters, 76 selfloop transitions, 6 changer transitions 48/133 dead transitions. [2022-11-25 17:55:42,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 133 transitions, 1012 flow [2022-11-25 17:55:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:55:42,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:55:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 956 transitions. [2022-11-25 17:55:42,744 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46771037181996084 [2022-11-25 17:55:42,744 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 956 transitions. [2022-11-25 17:55:42,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 956 transitions. [2022-11-25 17:55:42,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:55:42,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 956 transitions. [2022-11-25 17:55:42,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.57142857142858) internal successors, (956), 7 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:42,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:42,756 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:42,756 INFO L175 Difference]: Start difference. First operand has 76 places, 42 transitions, 248 flow. Second operand 7 states and 956 transitions. [2022-11-25 17:55:42,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 133 transitions, 1012 flow [2022-11-25 17:55:42,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 133 transitions, 899 flow, removed 19 selfloop flow, removed 17 redundant places. [2022-11-25 17:55:42,785 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 225 flow [2022-11-25 17:55:42,786 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=225, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2022-11-25 17:55:42,789 INFO L288 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2022-11-25 17:55:42,789 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 225 flow [2022-11-25 17:55:42,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 129.0) internal successors, (1032), 8 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:55:42,791 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:55:42,791 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:42,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:55:42,791 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:55:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:55:42,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1428836990, now seen corresponding path program 3 times [2022-11-25 17:55:42,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:55:42,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260606265] [2022-11-25 17:55:42,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:55:42,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:55:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:55:42,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:55:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:55:43,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:55:43,034 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:55:43,035 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-25 17:55:43,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-25 17:55:43,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-25 17:55:43,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-25 17:55:43,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-25 17:55:43,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-25 17:55:43,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-25 17:55:43,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-25 17:55:43,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-25 17:55:43,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-25 17:55:43,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-25 17:55:43,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-25 17:55:43,051 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-25 17:55:43,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-25 17:55:43,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-25 17:55:43,052 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-25 17:55:43,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:55:43,053 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:55:43,062 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:55:43,062 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:55:43,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:55:43 BasicIcfg [2022-11-25 17:55:43,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:55:43,214 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:55:43,214 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:55:43,214 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:55:43,215 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:54:44" (3/4) ... [2022-11-25 17:55:43,218 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:55:43,219 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:55:43,219 INFO L158 Benchmark]: Toolchain (without parser) took 61067.20ms. Allocated memory was 155.2MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 124.3MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-25 17:55:43,220 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 115.3MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:55:43,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 913.76ms. Allocated memory is still 155.2MB. Free memory was 124.0MB in the beginning and 96.1MB in the end (delta: 27.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-25 17:55:43,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 130.26ms. Allocated memory is still 155.2MB. Free memory was 96.1MB in the beginning and 93.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:55:43,221 INFO L158 Benchmark]: Boogie Preprocessor took 66.85ms. Allocated memory is still 155.2MB. Free memory was 93.4MB in the beginning and 91.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:55:43,222 INFO L158 Benchmark]: RCFGBuilder took 1310.28ms. Allocated memory is still 155.2MB. Free memory was 91.3MB in the beginning and 112.4MB in the end (delta: -21.1MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2022-11-25 17:55:43,222 INFO L158 Benchmark]: TraceAbstraction took 58632.17ms. Allocated memory was 155.2MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 111.7MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-11-25 17:55:43,223 INFO L158 Benchmark]: Witness Printer took 5.22ms. Allocated memory is still 3.7GB. Free memory is still 2.5GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:55:43,225 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.25ms. Allocated memory is still 115.3MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 913.76ms. Allocated memory is still 155.2MB. Free memory was 124.0MB in the beginning and 96.1MB in the end (delta: 27.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 130.26ms. Allocated memory is still 155.2MB. Free memory was 96.1MB in the beginning and 93.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.85ms. Allocated memory is still 155.2MB. Free memory was 93.4MB in the beginning and 91.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1310.28ms. Allocated memory is still 155.2MB. Free memory was 91.3MB in the beginning and 112.4MB in the end (delta: -21.1MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * TraceAbstraction took 58632.17ms. Allocated memory was 155.2MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 111.7MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 5.22ms. Allocated memory is still 3.7GB. Free memory is still 2.5GB. 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: 9.0s, 154 PlacesBefore, 51 PlacesAfterwards, 143 TransitionsBefore, 38 TransitionsAfterwards, 3644 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 145 TotalNumberOfCompositions, 10025 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4726, independent: 4496, independent conditional: 0, independent unconditional: 4496, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2494, independent: 2401, independent conditional: 0, independent unconditional: 2401, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2494, independent: 2389, independent conditional: 0, independent unconditional: 2389, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 105, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1121, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 1090, dependent conditional: 0, dependent unconditional: 1090, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4726, independent: 2095, independent conditional: 0, independent unconditional: 2095, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 2494, unknown conditional: 0, unknown unconditional: 2494] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 271, Positive conditional cache size: 0, Positive unconditional cache size: 271, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1457; [L860] FCALL, FORK 0 pthread_create(&t1457, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1457, ((void *)0), P0, ((void *)0))=-3, t1457={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1458; [L862] FCALL, FORK 0 pthread_create(&t1458, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1458, ((void *)0), P1, ((void *)0))=-2, t1457={5:0}, t1458={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1459; [L864] FCALL, FORK 0 pthread_create(&t1459, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1459, ((void *)0), P2, ((void *)0))=-1, t1457={5:0}, t1458={6:0}, t1459={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1460; [L866] FCALL, FORK 0 pthread_create(&t1460, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1460, ((void *)0), P3, ((void *)0))=0, t1457={5:0}, t1458={6:0}, t1459={7:0}, t1460={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=1, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1457={5:0}, t1458={6:0}, t1459={7:0}, t1460={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 183 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 58.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 40.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 945 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 791 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2093 IncrementalHoareTripleChecker+Invalid, 2251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 41 mSDtfsCounter, 2093 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=612occurred in iteration=11, InterpolantAutomatonStates: 74, 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.7s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 1826 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 17:55:43,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/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_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/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_8040ad72-63f3-4b88-98f9-b591f1dd6c25/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 b8efebf87dc67f98045ac231dc43d6a61f436e058244f16134f1d46d3b696c80 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:55:46,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:55:46,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:55:46,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:55:46,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:55:46,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:55:46,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:55:46,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:55:46,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:55:46,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:55:46,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:55:46,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:55:46,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:55:46,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:55:46,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:55:46,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:55:46,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:55:46,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:55:46,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:55:46,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:55:46,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:55:46,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:55:46,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:55:46,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:55:46,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:55:46,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:55:46,570 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:55:46,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:55:46,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:55:46,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:55:46,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:55:46,576 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:55:46,577 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:55:46,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:55:46,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:55:46,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:55:46,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:55:46,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:55:46,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:55:46,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:55:46,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:55:46,614 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 17:55:46,648 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:55:46,648 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:55:46,649 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:55:46,649 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:55:46,650 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:55:46,650 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:55:46,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:55:46,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:55:46,652 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:55:46,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:55:46,653 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:55:46,653 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:55:46,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:55:46,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:55:46,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:55:46,654 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:55:46,655 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:55:46,655 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:55:46,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:55:46,656 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:55:46,656 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 17:55:46,656 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 17:55:46,657 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:55:46,657 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:55:46,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:55:46,658 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:55:46,658 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:55:46,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:55:46,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:55:46,659 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:55:46,659 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 17:55:46,660 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 17:55:46,660 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:55:46,660 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:55:46,661 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:55:46,661 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 17:55:46,661 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_8040ad72-63f3-4b88-98f9-b591f1dd6c25/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_8040ad72-63f3-4b88-98f9-b591f1dd6c25/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 -> b8efebf87dc67f98045ac231dc43d6a61f436e058244f16134f1d46d3b696c80 [2022-11-25 17:55:47,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:55:47,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:55:47,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:55:47,230 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:55:47,231 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:55:47,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:55:51,229 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:55:51,669 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:55:51,683 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/sv-benchmarks/c/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:55:51,716 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/data/57feee39d/a398176450844a1396b7256fa43760a9/FLAG11a16165d [2022-11-25 17:55:51,741 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/data/57feee39d/a398176450844a1396b7256fa43760a9 [2022-11-25 17:55:51,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:55:51,750 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:55:51,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:55:51,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:55:51,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:55:51,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:55:51" (1/1) ... [2022-11-25 17:55:51,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a12d181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:51, skipping insertion in model container [2022-11-25 17:55:51,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:55:51" (1/1) ... [2022-11-25 17:55:51,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:55:51,862 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:55:52,177 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_8040ad72-63f3-4b88-98f9-b591f1dd6c25/sv-benchmarks/c/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 17:55:52,498 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:55:52,631 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:55:52,662 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_8040ad72-63f3-4b88-98f9-b591f1dd6c25/sv-benchmarks/c/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-25 17:55:52,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,727 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,757 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:55:52,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:55:52,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:55:52,854 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:55:52,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:52 WrapperNode [2022-11-25 17:55:52,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:55:52,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:55:52,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:55:52,858 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:55:52,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:52" (1/1) ... [2022-11-25 17:55:52,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:52" (1/1) ... [2022-11-25 17:55:52,971 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-11-25 17:55:52,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:55:52,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:55:52,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:55:52,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:55:52,990 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:52" (1/1) ... [2022-11-25 17:55:52,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:52" (1/1) ... [2022-11-25 17:55:52,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:52" (1/1) ... [2022-11-25 17:55:53,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:52" (1/1) ... [2022-11-25 17:55:53,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:52" (1/1) ... [2022-11-25 17:55:53,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:52" (1/1) ... [2022-11-25 17:55:53,048 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:52" (1/1) ... [2022-11-25 17:55:53,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:52" (1/1) ... [2022-11-25 17:55:53,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:55:53,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:55:53,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:55:53,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:55:53,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:52" (1/1) ... [2022-11-25 17:55:53,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:55:53,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:55:53,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:55:53,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:55:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:55:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:55:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:55:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:55:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 17:55:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 17:55:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:55:53,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:55:53,209 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:55:53,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:55:53,209 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:55:53,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:55:53,210 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-25 17:55:53,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-25 17:55:53,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:55:53,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:55:53,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:55:53,215 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:55:53,419 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:55:53,422 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:55:54,215 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:55:54,490 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:55:54,490 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:55:54,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:55:54 BoogieIcfgContainer [2022-11-25 17:55:54,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:55:54,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:55:54,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:55:54,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:55:54,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:55:51" (1/3) ... [2022-11-25 17:55:54,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a872d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:55:54, skipping insertion in model container [2022-11-25 17:55:54,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:55:52" (2/3) ... [2022-11-25 17:55:54,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a872d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:55:54, skipping insertion in model container [2022-11-25 17:55:54,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:55:54" (3/3) ... [2022-11-25 17:55:54,512 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_power.oepc_pso.oepc_rmo.oepc.i [2022-11-25 17:55:54,540 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:55:54,542 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-25 17:55:54,543 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:55:54,690 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:55:54,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 316 flow [2022-11-25 17:55:54,905 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-11-25 17:55:54,906 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:55:54,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 2/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-25 17:55:54,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 148 transitions, 316 flow [2022-11-25 17:55:54,927 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 144 transitions, 300 flow [2022-11-25 17:55:54,933 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:55:54,962 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 144 transitions, 300 flow [2022-11-25 17:55:54,975 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 144 transitions, 300 flow [2022-11-25 17:55:54,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 300 flow [2022-11-25 17:55:55,058 INFO L130 PetriNetUnfolder]: 2/144 cut-off events. [2022-11-25 17:55:55,061 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:55:55,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 2/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-25 17:55:55,069 INFO L119 LiptonReduction]: Number of co-enabled transitions 3644 [2022-11-25 17:56:09,620 INFO L134 LiptonReduction]: Checked pairs total: 10029 [2022-11-25 17:56:09,620 INFO L136 LiptonReduction]: Total number of compositions: 145 [2022-11-25 17:56:09,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:56:09,650 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;@9769546, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:56:09,651 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 17:56:09,655 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 17:56:09,655 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:56:09,655 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:09,656 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:56:09,657 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:56:09,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:09,664 INFO L85 PathProgramCache]: Analyzing trace with hash 627, now seen corresponding path program 1 times [2022-11-25 17:56:09,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:09,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179843818] [2022-11-25 17:56:09,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:09,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:09,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:09,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:09,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 17:56:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:09,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:56:09,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:09,846 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:09,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:09,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179843818] [2022-11-25 17:56:09,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179843818] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:09,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:09,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:56:09,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241686940] [2022-11-25 17:56:09,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:09,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:56:09,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:09,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:56:09,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:56:09,910 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 293 [2022-11-25 17:56:09,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:09,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:09,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 293 [2022-11-25 17:56:09,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:13,076 INFO L130 PetriNetUnfolder]: 8719/11751 cut-off events. [2022-11-25 17:56:13,076 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-11-25 17:56:13,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23699 conditions, 11751 events. 8719/11751 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 59471 event pairs, 8719 based on Foata normal form. 0/10324 useless extension candidates. Maximal degree in co-relation 23687. Up to 11731 conditions per place. [2022-11-25 17:56:13,179 INFO L137 encePairwiseOnDemand]: 284/293 looper letters, 28 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2022-11-25 17:56:13,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 130 flow [2022-11-25 17:56:13,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:56:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:56:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 303 transitions. [2022-11-25 17:56:13,206 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5170648464163823 [2022-11-25 17:56:13,207 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 303 transitions. [2022-11-25 17:56:13,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 303 transitions. [2022-11-25 17:56:13,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:13,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 303 transitions. [2022-11-25 17:56:13,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 151.5) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:13,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:13,232 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:13,235 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 303 transitions. [2022-11-25 17:56:13,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 130 flow [2022-11-25 17:56:13,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-25 17:56:13,246 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2022-11-25 17:56:13,249 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-11-25 17:56:13,253 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2022-11-25 17:56:13,253 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2022-11-25 17:56:13,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:13,254 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:13,254 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:56:13,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:13,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:13,471 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:56:13,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:13,481 INFO L85 PathProgramCache]: Analyzing trace with hash 615940, now seen corresponding path program 1 times [2022-11-25 17:56:13,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:13,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010216342] [2022-11-25 17:56:13,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:13,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:13,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:13,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:13,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 17:56:13,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:13,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:56:13,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:13,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:13,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:13,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010216342] [2022-11-25 17:56:13,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010216342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:13,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:13,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:56:13,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742867004] [2022-11-25 17:56:13,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:13,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:56:13,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:13,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:56:13,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:56:13,654 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 293 [2022-11-25 17:56:13,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:13,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:13,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 293 [2022-11-25 17:56:13,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:15,744 INFO L130 PetriNetUnfolder]: 6855/9870 cut-off events. [2022-11-25 17:56:15,745 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:56:15,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19307 conditions, 9870 events. 6855/9870 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 59376 event pairs, 1263 based on Foata normal form. 0/9225 useless extension candidates. Maximal degree in co-relation 19304. Up to 7399 conditions per place. [2022-11-25 17:56:15,841 INFO L137 encePairwiseOnDemand]: 290/293 looper letters, 45 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2022-11-25 17:56:15,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 216 flow [2022-11-25 17:56:15,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:56:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:56:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-11-25 17:56:15,850 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5073947667804323 [2022-11-25 17:56:15,851 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2022-11-25 17:56:15,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2022-11-25 17:56:15,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:15,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2022-11-25 17:56:15,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:15,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:15,864 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:15,866 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 446 transitions. [2022-11-25 17:56:15,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 216 flow [2022-11-25 17:56:15,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:56:15,870 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2022-11-25 17:56:15,875 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-11-25 17:56:15,876 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2022-11-25 17:56:15,877 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2022-11-25 17:56:15,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:15,886 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:15,886 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:15,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/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)] Ended with exit code 0 [2022-11-25 17:56:16,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:16,110 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:56:16,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:16,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1012165483, now seen corresponding path program 1 times [2022-11-25 17:56:16,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:16,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679025726] [2022-11-25 17:56:16,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:16,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:16,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:16,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:16,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 17:56:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:16,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:56:16,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:16,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:16,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:16,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679025726] [2022-11-25 17:56:16,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679025726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:16,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:16,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:56:16,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859094217] [2022-11-25 17:56:16,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:16,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:56:16,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:16,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:56:16,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:56:16,413 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 293 [2022-11-25 17:56:16,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:16,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:16,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 293 [2022-11-25 17:56:16,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:17,794 INFO L130 PetriNetUnfolder]: 4483/6366 cut-off events. [2022-11-25 17:56:17,794 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2022-11-25 17:56:17,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13315 conditions, 6366 events. 4483/6366 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 33593 event pairs, 818 based on Foata normal form. 320/6460 useless extension candidates. Maximal degree in co-relation 13311. Up to 4756 conditions per place. [2022-11-25 17:56:17,844 INFO L137 encePairwiseOnDemand]: 286/293 looper letters, 40 selfloop transitions, 5 changer transitions 27/75 dead transitions. [2022-11-25 17:56:17,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 75 transitions, 318 flow [2022-11-25 17:56:17,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:56:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:56:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 709 transitions. [2022-11-25 17:56:17,849 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48395904436860065 [2022-11-25 17:56:17,849 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 709 transitions. [2022-11-25 17:56:17,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 709 transitions. [2022-11-25 17:56:17,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:17,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 709 transitions. [2022-11-25 17:56:17,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:17,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:17,861 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:17,861 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 5 states and 709 transitions. [2022-11-25 17:56:17,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 75 transitions, 318 flow [2022-11-25 17:56:17,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 75 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:56:17,865 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 111 flow [2022-11-25 17:56:17,866 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-11-25 17:56:17,868 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2022-11-25 17:56:17,868 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 111 flow [2022-11-25 17:56:17,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:17,869 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:17,869 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:17,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:18,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:18,084 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:56:18,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:18,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1195780430, now seen corresponding path program 1 times [2022-11-25 17:56:18,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:18,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833945371] [2022-11-25 17:56:18,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:18,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:18,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:18,108 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:18,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 17:56:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:18,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:56:18,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:18,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:18,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:18,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833945371] [2022-11-25 17:56:18,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833945371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:18,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:18,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:56:18,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898236852] [2022-11-25 17:56:18,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:18,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:56:18,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:18,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:56:18,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:56:18,398 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 293 [2022-11-25 17:56:18,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:18,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:18,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 293 [2022-11-25 17:56:18,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:19,489 INFO L130 PetriNetUnfolder]: 2161/3261 cut-off events. [2022-11-25 17:56:19,489 INFO L131 PetriNetUnfolder]: For 1200/1200 co-relation queries the response was YES. [2022-11-25 17:56:19,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8656 conditions, 3261 events. 2161/3261 cut-off events. For 1200/1200 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16652 event pairs, 403 based on Foata normal form. 212/3382 useless extension candidates. Maximal degree in co-relation 8649. Up to 1426 conditions per place. [2022-11-25 17:56:19,516 INFO L137 encePairwiseOnDemand]: 286/293 looper letters, 53 selfloop transitions, 9 changer transitions 27/92 dead transitions. [2022-11-25 17:56:19,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 92 transitions, 467 flow [2022-11-25 17:56:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:56:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:56:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 853 transitions. [2022-11-25 17:56:19,522 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4852104664391354 [2022-11-25 17:56:19,522 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 853 transitions. [2022-11-25 17:56:19,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 853 transitions. [2022-11-25 17:56:19,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:19,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 853 transitions. [2022-11-25 17:56:19,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.16666666666666) internal successors, (853), 6 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:19,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:19,534 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:19,534 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 111 flow. Second operand 6 states and 853 transitions. [2022-11-25 17:56:19,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 92 transitions, 467 flow [2022-11-25 17:56:19,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 92 transitions, 460 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 17:56:19,552 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 176 flow [2022-11-25 17:56:19,552 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2022-11-25 17:56:19,554 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2022-11-25 17:56:19,555 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 176 flow [2022-11-25 17:56:19,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:19,557 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:19,557 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:19,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:19,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:19,778 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:56:19,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:19,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2142086605, now seen corresponding path program 1 times [2022-11-25 17:56:19,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:19,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728412762] [2022-11-25 17:56:19,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:19,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:19,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:19,786 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:19,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 17:56:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:19,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:56:19,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:20,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:20,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:20,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728412762] [2022-11-25 17:56:20,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728412762] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:20,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:20,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:56:20,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310142181] [2022-11-25 17:56:20,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:20,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:56:20,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:20,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:56:20,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:56:20,132 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 293 [2022-11-25 17:56:20,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:20,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:20,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 293 [2022-11-25 17:56:20,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:21,118 INFO L130 PetriNetUnfolder]: 1189/1839 cut-off events. [2022-11-25 17:56:21,118 INFO L131 PetriNetUnfolder]: For 1810/1810 co-relation queries the response was YES. [2022-11-25 17:56:21,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5559 conditions, 1839 events. 1189/1839 cut-off events. For 1810/1810 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8751 event pairs, 331 based on Foata normal form. 77/1888 useless extension candidates. Maximal degree in co-relation 5550. Up to 630 conditions per place. [2022-11-25 17:56:21,138 INFO L137 encePairwiseOnDemand]: 286/293 looper letters, 64 selfloop transitions, 13 changer transitions 27/107 dead transitions. [2022-11-25 17:56:21,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 107 transitions, 636 flow [2022-11-25 17:56:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:56:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:56:21,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 995 transitions. [2022-11-25 17:56:21,144 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48512920526572406 [2022-11-25 17:56:21,144 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 995 transitions. [2022-11-25 17:56:21,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 995 transitions. [2022-11-25 17:56:21,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:21,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 995 transitions. [2022-11-25 17:56:21,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.14285714285714) internal successors, (995), 7 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:21,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:21,159 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:21,159 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 176 flow. Second operand 7 states and 995 transitions. [2022-11-25 17:56:21,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 107 transitions, 636 flow [2022-11-25 17:56:21,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 107 transitions, 574 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-11-25 17:56:21,195 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 226 flow [2022-11-25 17:56:21,195 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2022-11-25 17:56:21,198 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2022-11-25 17:56:21,199 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 226 flow [2022-11-25 17:56:21,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:21,200 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:21,200 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:21,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:21,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:21,416 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:56:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1015861353, now seen corresponding path program 1 times [2022-11-25 17:56:21,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:21,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099079983] [2022-11-25 17:56:21,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:21,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:21,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:21,420 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:21,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 17:56:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:21,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 17:56:21,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:21,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:21,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:21,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099079983] [2022-11-25 17:56:21,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099079983] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:21,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:21,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:56:21,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61910852] [2022-11-25 17:56:21,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:21,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:56:21,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:21,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:56:21,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:56:21,815 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 293 [2022-11-25 17:56:21,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:21,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:21,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 293 [2022-11-25 17:56:21,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:22,834 INFO L130 PetriNetUnfolder]: 1011/1533 cut-off events. [2022-11-25 17:56:22,834 INFO L131 PetriNetUnfolder]: For 1455/1455 co-relation queries the response was YES. [2022-11-25 17:56:22,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4485 conditions, 1533 events. 1011/1533 cut-off events. For 1455/1455 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7111 event pairs, 326 based on Foata normal form. 14/1532 useless extension candidates. Maximal degree in co-relation 4475. Up to 630 conditions per place. [2022-11-25 17:56:22,851 INFO L137 encePairwiseOnDemand]: 286/293 looper letters, 60 selfloop transitions, 17 changer transitions 14/94 dead transitions. [2022-11-25 17:56:22,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 94 transitions, 572 flow [2022-11-25 17:56:22,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:56:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:56:22,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1109 transitions. [2022-11-25 17:56:22,858 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47312286689419797 [2022-11-25 17:56:22,858 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1109 transitions. [2022-11-25 17:56:22,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1109 transitions. [2022-11-25 17:56:22,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:22,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1109 transitions. [2022-11-25 17:56:22,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 138.625) internal successors, (1109), 8 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:22,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 293.0) internal successors, (2637), 9 states have internal predecessors, (2637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:22,871 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 293.0) internal successors, (2637), 9 states have internal predecessors, (2637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:22,871 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 226 flow. Second operand 8 states and 1109 transitions. [2022-11-25 17:56:22,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 94 transitions, 572 flow [2022-11-25 17:56:22,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 94 transitions, 510 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-11-25 17:56:22,906 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 220 flow [2022-11-25 17:56:22,906 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2022-11-25 17:56:22,910 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2022-11-25 17:56:22,911 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 220 flow [2022-11-25 17:56:22,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:22,914 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:22,914 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:22,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:23,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:23,123 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:56:23,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:23,124 INFO L85 PathProgramCache]: Analyzing trace with hash 200273508, now seen corresponding path program 1 times [2022-11-25 17:56:23,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:23,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501912268] [2022-11-25 17:56:23,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:23,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:23,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:23,127 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:23,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 17:56:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:23,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 17:56:23,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:23,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:23,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:23,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501912268] [2022-11-25 17:56:23,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501912268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:23,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:23,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:56:23,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517912248] [2022-11-25 17:56:23,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:23,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:56:23,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:23,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:56:23,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:56:24,111 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 293 [2022-11-25 17:56:24,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 220 flow. Second operand has 9 states, 9 states have (on average 127.77777777777777) internal successors, (1150), 9 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:24,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:24,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 293 [2022-11-25 17:56:24,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:25,075 INFO L130 PetriNetUnfolder]: 1159/1791 cut-off events. [2022-11-25 17:56:25,076 INFO L131 PetriNetUnfolder]: For 1960/1960 co-relation queries the response was YES. [2022-11-25 17:56:25,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5331 conditions, 1791 events. 1159/1791 cut-off events. For 1960/1960 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8578 event pairs, 166 based on Foata normal form. 0/1785 useless extension candidates. Maximal degree in co-relation 5320. Up to 773 conditions per place. [2022-11-25 17:56:25,092 INFO L137 encePairwiseOnDemand]: 286/293 looper letters, 100 selfloop transitions, 7 changer transitions 0/110 dead transitions. [2022-11-25 17:56:25,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 110 transitions, 812 flow [2022-11-25 17:56:25,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:56:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:56:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1072 transitions. [2022-11-25 17:56:25,097 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45733788395904434 [2022-11-25 17:56:25,097 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1072 transitions. [2022-11-25 17:56:25,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1072 transitions. [2022-11-25 17:56:25,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:25,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1072 transitions. [2022-11-25 17:56:25,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:25,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 293.0) internal successors, (2637), 9 states have internal predecessors, (2637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:25,108 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 293.0) internal successors, (2637), 9 states have internal predecessors, (2637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:25,108 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 220 flow. Second operand 8 states and 1072 transitions. [2022-11-25 17:56:25,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 110 transitions, 812 flow [2022-11-25 17:56:25,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 110 transitions, 656 flow, removed 38 selfloop flow, removed 7 redundant places. [2022-11-25 17:56:25,128 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 188 flow [2022-11-25 17:56:25,128 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=188, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2022-11-25 17:56:25,129 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2022-11-25 17:56:25,129 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 188 flow [2022-11-25 17:56:25,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 127.77777777777777) internal successors, (1150), 9 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:25,130 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:25,131 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:25,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/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)] Ended with exit code 0 [2022-11-25 17:56:25,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:25,346 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:56:25,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:25,347 INFO L85 PathProgramCache]: Analyzing trace with hash -378981882, now seen corresponding path program 2 times [2022-11-25 17:56:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:25,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279516794] [2022-11-25 17:56:25,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:56:25,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:25,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:25,353 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:25,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 17:56:25,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:56:25,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:56:25,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:56:25,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:25,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:25,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:25,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279516794] [2022-11-25 17:56:25,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279516794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:25,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:25,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:56:25,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259184139] [2022-11-25 17:56:25,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:25,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:56:25,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:25,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:56:25,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:56:25,629 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 293 [2022-11-25 17:56:25,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:25,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:25,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 293 [2022-11-25 17:56:25,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:26,206 INFO L130 PetriNetUnfolder]: 1951/2958 cut-off events. [2022-11-25 17:56:26,206 INFO L131 PetriNetUnfolder]: For 2687/2687 co-relation queries the response was YES. [2022-11-25 17:56:26,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8635 conditions, 2958 events. 1951/2958 cut-off events. For 2687/2687 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15189 event pairs, 767 based on Foata normal form. 1/2955 useless extension candidates. Maximal degree in co-relation 8624. Up to 1656 conditions per place. [2022-11-25 17:56:26,231 INFO L137 encePairwiseOnDemand]: 289/293 looper letters, 71 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2022-11-25 17:56:26,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 77 transitions, 492 flow [2022-11-25 17:56:26,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:56:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:56:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2022-11-25 17:56:26,234 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4761092150170648 [2022-11-25 17:56:26,235 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 558 transitions. [2022-11-25 17:56:26,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 558 transitions. [2022-11-25 17:56:26,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:26,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 558 transitions. [2022-11-25 17:56:26,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:26,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:26,241 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:26,241 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 188 flow. Second operand 4 states and 558 transitions. [2022-11-25 17:56:26,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 77 transitions, 492 flow [2022-11-25 17:56:26,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 77 transitions, 482 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:56:26,277 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 216 flow [2022-11-25 17:56:26,278 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2022-11-25 17:56:26,279 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2022-11-25 17:56:26,279 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 216 flow [2022-11-25 17:56:26,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:26,280 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:26,280 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:26,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:26,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:26,496 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:56:26,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:26,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1299380168, now seen corresponding path program 1 times [2022-11-25 17:56:26,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:26,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548628881] [2022-11-25 17:56:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:56:26,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:26,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:26,500 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:26,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 17:56:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:56:26,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 17:56:26,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:27,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:27,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:27,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548628881] [2022-11-25 17:56:27,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548628881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:27,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:27,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:56:27,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33384628] [2022-11-25 17:56:27,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:27,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:56:27,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:27,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:56:27,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:56:28,623 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 293 [2022-11-25 17:56:28,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:28,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:28,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 293 [2022-11-25 17:56:28,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:29,748 INFO L130 PetriNetUnfolder]: 1657/2556 cut-off events. [2022-11-25 17:56:29,749 INFO L131 PetriNetUnfolder]: For 1875/1875 co-relation queries the response was YES. [2022-11-25 17:56:29,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7487 conditions, 2556 events. 1657/2556 cut-off events. For 1875/1875 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13063 event pairs, 372 based on Foata normal form. 4/2560 useless extension candidates. Maximal degree in co-relation 7474. Up to 2279 conditions per place. [2022-11-25 17:56:29,765 INFO L137 encePairwiseOnDemand]: 288/293 looper letters, 47 selfloop transitions, 4 changer transitions 18/72 dead transitions. [2022-11-25 17:56:29,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 72 transitions, 466 flow [2022-11-25 17:56:29,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:56:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:56:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 722 transitions. [2022-11-25 17:56:29,769 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41069397042093286 [2022-11-25 17:56:29,769 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 722 transitions. [2022-11-25 17:56:29,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 722 transitions. [2022-11-25 17:56:29,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:29,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 722 transitions. [2022-11-25 17:56:29,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:29,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:29,778 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 293.0) internal successors, (2051), 7 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:29,778 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 216 flow. Second operand 6 states and 722 transitions. [2022-11-25 17:56:29,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 72 transitions, 466 flow [2022-11-25 17:56:29,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:56:29,810 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 180 flow [2022-11-25 17:56:29,811 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2022-11-25 17:56:29,811 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places. [2022-11-25 17:56:29,812 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 180 flow [2022-11-25 17:56:29,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:29,812 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:29,813 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:29,829 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/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 17:56:30,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:30,028 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:56:30,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:30,029 INFO L85 PathProgramCache]: Analyzing trace with hash -429307214, now seen corresponding path program 3 times [2022-11-25 17:56:30,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:30,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845186941] [2022-11-25 17:56:30,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:56:30,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:30,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:30,031 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:30,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/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 17:56:30,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 17:56:30,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:56:30,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:56:30,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:30,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:30,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:30,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845186941] [2022-11-25 17:56:30,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845186941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:30,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:30,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:56:30,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535326507] [2022-11-25 17:56:30,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:30,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:56:30,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:30,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:56:30,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:56:30,308 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 293 [2022-11-25 17:56:30,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:30,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:30,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 293 [2022-11-25 17:56:30,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:30,856 INFO L130 PetriNetUnfolder]: 1462/2272 cut-off events. [2022-11-25 17:56:30,856 INFO L131 PetriNetUnfolder]: For 1640/1659 co-relation queries the response was YES. [2022-11-25 17:56:30,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6685 conditions, 2272 events. 1462/2272 cut-off events. For 1640/1659 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11622 event pairs, 629 based on Foata normal form. 4/2251 useless extension candidates. Maximal degree in co-relation 6672. Up to 1308 conditions per place. [2022-11-25 17:56:30,872 INFO L137 encePairwiseOnDemand]: 289/293 looper letters, 57 selfloop transitions, 2 changer transitions 12/73 dead transitions. [2022-11-25 17:56:30,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 476 flow [2022-11-25 17:56:30,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:56:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:56:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2022-11-25 17:56:30,875 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4778156996587031 [2022-11-25 17:56:30,875 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2022-11-25 17:56:30,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2022-11-25 17:56:30,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:30,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2022-11-25 17:56:30,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:30,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:30,882 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:30,882 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 180 flow. Second operand 4 states and 560 transitions. [2022-11-25 17:56:30,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 476 flow [2022-11-25 17:56:30,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 73 transitions, 445 flow, removed 6 selfloop flow, removed 9 redundant places. [2022-11-25 17:56:30,904 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 171 flow [2022-11-25 17:56:30,905 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2022-11-25 17:56:30,905 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2022-11-25 17:56:30,906 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 171 flow [2022-11-25 17:56:30,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:30,906 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:30,907 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:30,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/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 17:56:31,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:31,133 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:56:31,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:31,134 INFO L85 PathProgramCache]: Analyzing trace with hash 476984712, now seen corresponding path program 4 times [2022-11-25 17:56:31,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:31,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602797438] [2022-11-25 17:56:31,135 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:56:31,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:31,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:31,137 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:31,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 17:56:31,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:56:31,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:56:31,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:56:31,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:56:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:56:31,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:56:31,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:56:31,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602797438] [2022-11-25 17:56:31,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602797438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:56:31,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:56:31,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:56:31,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568537807] [2022-11-25 17:56:31,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:56:31,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:56:31,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:56:31,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:56:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:56:31,454 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 293 [2022-11-25 17:56:31,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:56:31,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 293 [2022-11-25 17:56:31,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:56:31,939 INFO L130 PetriNetUnfolder]: 1116/1787 cut-off events. [2022-11-25 17:56:31,940 INFO L131 PetriNetUnfolder]: For 1459/1460 co-relation queries the response was YES. [2022-11-25 17:56:31,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5261 conditions, 1787 events. 1116/1787 cut-off events. For 1459/1460 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8341 event pairs, 248 based on Foata normal form. 1/1787 useless extension candidates. Maximal degree in co-relation 5250. Up to 954 conditions per place. [2022-11-25 17:56:31,946 INFO L137 encePairwiseOnDemand]: 289/293 looper letters, 41 selfloop transitions, 1 changer transitions 34/78 dead transitions. [2022-11-25 17:56:31,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 78 transitions, 496 flow [2022-11-25 17:56:31,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:56:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:56:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 686 transitions. [2022-11-25 17:56:31,961 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.468259385665529 [2022-11-25 17:56:31,963 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 686 transitions. [2022-11-25 17:56:31,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 686 transitions. [2022-11-25 17:56:31,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:56:31,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 686 transitions. [2022-11-25 17:56:31,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,975 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,976 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 171 flow. Second operand 5 states and 686 transitions. [2022-11-25 17:56:31,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 78 transitions, 496 flow [2022-11-25 17:56:31,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 78 transitions, 484 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 17:56:31,995 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 172 flow [2022-11-25 17:56:31,995 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2022-11-25 17:56:31,996 INFO L288 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2022-11-25 17:56:31,996 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 172 flow [2022-11-25 17:56:31,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:56:31,997 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:56:31,997 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:32,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:32,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:32,214 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-25 17:56:32,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:56:32,214 INFO L85 PathProgramCache]: Analyzing trace with hash -667963016, now seen corresponding path program 5 times [2022-11-25 17:56:32,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:56:32,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054942823] [2022-11-25 17:56:32,215 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:56:32,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:32,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:56:32,218 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 17:56:32,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 17:56:32,444 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:56:32,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 17:56:32,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:56:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:56:32,753 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 17:56:32,763 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:56:32,764 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-25 17:56:32,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-25 17:56:32,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-25 17:56:32,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-25 17:56:32,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-25 17:56:32,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-25 17:56:32,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-25 17:56:32,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-25 17:56:32,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-25 17:56:32,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-25 17:56:32,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-25 17:56:32,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-25 17:56:32,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-25 17:56:32,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-25 17:56:32,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-25 17:56:32,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-25 17:56:32,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 17:56:32,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 17:56:32,995 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:56:33,001 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:56:33,001 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:56:33,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:56:33 BasicIcfg [2022-11-25 17:56:33,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:56:33,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:56:33,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:56:33,160 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:56:33,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:55:54" (3/4) ... [2022-11-25 17:56:33,164 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:56:33,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:56:33,165 INFO L158 Benchmark]: Toolchain (without parser) took 41415.39ms. Allocated memory was 71.3MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 48.4MB in the beginning and 826.8MB in the end (delta: -778.4MB). Peak memory consumption was 250.4MB. Max. memory is 16.1GB. [2022-11-25 17:56:33,165 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 54.5MB. Free memory was 32.9MB in the beginning and 32.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:56:33,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1103.02ms. Allocated memory is still 71.3MB. Free memory was 48.2MB in the beginning and 36.6MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 17:56:33,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.71ms. Allocated memory is still 71.3MB. Free memory was 36.6MB in the beginning and 34.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:56:33,169 INFO L158 Benchmark]: Boogie Preprocessor took 96.49ms. Allocated memory is still 71.3MB. Free memory was 34.0MB in the beginning and 31.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:56:33,169 INFO L158 Benchmark]: RCFGBuilder took 1423.61ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 31.6MB in the beginning and 58.6MB in the end (delta: -27.0MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-11-25 17:56:33,170 INFO L158 Benchmark]: TraceAbstraction took 38659.86ms. Allocated memory was 86.0MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 58.2MB in the beginning and 826.8MB in the end (delta: -768.7MB). Peak memory consumption was 243.1MB. Max. memory is 16.1GB. [2022-11-25 17:56:33,170 INFO L158 Benchmark]: Witness Printer took 5.05ms. Allocated memory is still 1.1GB. Free memory is still 826.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:56:33,172 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 54.5MB. Free memory was 32.9MB in the beginning and 32.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1103.02ms. Allocated memory is still 71.3MB. Free memory was 48.2MB in the beginning and 36.6MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.71ms. Allocated memory is still 71.3MB. Free memory was 36.6MB in the beginning and 34.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.49ms. Allocated memory is still 71.3MB. Free memory was 34.0MB in the beginning and 31.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1423.61ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 31.6MB in the beginning and 58.6MB in the end (delta: -27.0MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * TraceAbstraction took 38659.86ms. Allocated memory was 86.0MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 58.2MB in the beginning and 826.8MB in the end (delta: -768.7MB). Peak memory consumption was 243.1MB. Max. memory is 16.1GB. * Witness Printer took 5.05ms. Allocated memory is still 1.1GB. Free memory is still 826.8MB. 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: 14.6s, 155 PlacesBefore, 52 PlacesAfterwards, 144 TransitionsBefore, 40 TransitionsAfterwards, 3644 CoEnabledTransitionPairs, 7 FixpointIterations, 58 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 145 TotalNumberOfCompositions, 10029 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5006, independent: 4785, independent conditional: 0, independent unconditional: 4785, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2494, independent: 2420, independent conditional: 0, independent unconditional: 2420, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2494, independent: 2401, independent conditional: 0, independent unconditional: 2401, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 803, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 747, dependent conditional: 0, dependent unconditional: 747, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5006, independent: 2365, independent conditional: 0, independent unconditional: 2365, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 2494, unknown conditional: 0, unknown unconditional: 2494] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 315, Positive conditional cache size: 0, Positive unconditional cache size: 315, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1457; [L860] FCALL, FORK 0 pthread_create(&t1457, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1457, ((void *)0), P0, ((void *)0))=-1, t1457={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1458; [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L862] FCALL, FORK 0 pthread_create(&t1458, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1458, ((void *)0), P1, ((void *)0))=0, t1457={3:0}, t1458={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=0, z=0] [L863] 0 pthread_t t1459; [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L864] FCALL, FORK 0 pthread_create(&t1459, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1459, ((void *)0), P2, ((void *)0))=1, t1457={3:0}, t1458={7:0}, t1459={11:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L865] 0 pthread_t t1460; [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t1460, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1460, ((void *)0), P3, ((void *)0))=2, t1457={3:0}, t1458={7:0}, t1459={11:0}, t1460={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=0, z=0] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L798] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=1, z=0] [L801] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=1, z=1] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, y=1, z=1] [L818] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1457={3:0}, t1458={7:0}, t1459={11:0}, t1460={15:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 38.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 586 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 495 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 180 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2371 IncrementalHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 18 mSDtfsCounter, 2371 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=5, InterpolantAutomatonStates: 58, 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.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 205 ConstructedInterpolants, 19 QuantifiedInterpolants, 1887 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1708 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:56:33,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8040ad72-63f3-4b88-98f9-b591f1dd6c25/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample