./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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_5e1c9494-609e-47c4-8437-868cbb5be021/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 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf --- 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:53:34,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:53:34,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:53:34,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:53:34,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:53:34,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:53:34,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:53:34,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:53:34,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:53:34,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:53:34,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:53:34,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:53:34,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:53:34,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:53:34,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:53:34,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:53:34,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:53:34,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:53:34,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:53:34,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:53:34,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:53:34,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:53:34,646 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:53:34,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:53:34,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:53:34,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:53:34,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:53:34,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:53:34,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:53:34,661 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:53:34,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:53:34,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:53:34,664 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:53:34,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:53:34,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:53:34,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:53:34,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:53:34,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:53:34,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:53:34,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:53:34,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:53:34,672 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:53:34,713 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:53:34,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:53:34,714 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:53:34,715 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:53:34,716 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:53:34,716 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:53:34,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:53:34,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:53:34,717 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:53:34,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:53:34,719 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:53:34,719 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:53:34,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:53:34,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:53:34,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:53:34,720 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:53:34,720 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:53:34,720 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:53:34,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:53:34,721 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:53:34,721 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:53:34,721 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:53:34,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:53:34,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:53:34,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:53:34,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:53:34,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:53:34,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:53:34,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:53:34,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:53:34,723 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:53:34,723 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:53:34,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:53:34,724 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_5e1c9494-609e-47c4-8437-868cbb5be021/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_5e1c9494-609e-47c4-8437-868cbb5be021/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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf [2022-11-25 17:53:35,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:53:35,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:53:35,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:53:35,089 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:53:35,090 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:53:35,091 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-25 17:53:38,171 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:53:38,498 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:53:38,498 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-25 17:53:38,513 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/data/828310f44/f616a51585e945de88e82bb7c4879a1a/FLAGdc4f652ce [2022-11-25 17:53:38,528 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/data/828310f44/f616a51585e945de88e82bb7c4879a1a [2022-11-25 17:53:38,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:53:38,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:53:38,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:53:38,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:53:38,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:53:38,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:53:38" (1/1) ... [2022-11-25 17:53:38,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@569541e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:38, skipping insertion in model container [2022-11-25 17:53:38,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:53:38" (1/1) ... [2022-11-25 17:53:38,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:53:38,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:53:38,820 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_5e1c9494-609e-47c4-8437-868cbb5be021/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-11-25 17:53:39,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,043 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,140 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:53:39,176 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:53:39,192 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_5e1c9494-609e-47c4-8437-868cbb5be021/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-11-25 17:53:39,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,238 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:53:39,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:53:39,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:53:39,365 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:53:39,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:39 WrapperNode [2022-11-25 17:53:39,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:53:39,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:53:39,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:53:39,368 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:53:39,377 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:53:39" (1/1) ... [2022-11-25 17:53:39,419 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:53:39" (1/1) ... [2022-11-25 17:53:39,471 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-25 17:53:39,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:53:39,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:53:39,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:53:39,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:53:39,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:39" (1/1) ... [2022-11-25 17:53:39,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:39" (1/1) ... [2022-11-25 17:53:39,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:39" (1/1) ... [2022-11-25 17:53:39,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:39" (1/1) ... [2022-11-25 17:53:39,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:39" (1/1) ... [2022-11-25 17:53:39,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:39" (1/1) ... [2022-11-25 17:53:39,552 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:39" (1/1) ... [2022-11-25 17:53:39,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:39" (1/1) ... [2022-11-25 17:53:39,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:53:39,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:53:39,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:53:39,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:53:39,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:39" (1/1) ... [2022-11-25 17:53:39,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:53:39,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:53:39,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:53:39,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:53:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:53:39,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:53:39,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:53:39,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:53:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:53:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:53:39,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:53:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:53:39,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:53:39,665 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:53:39,666 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:53:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:53:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:53:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:53:39,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:53:39,669 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:53:39,899 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:53:39,901 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:53:40,323 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:53:40,550 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:53:40,551 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:53:40,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:53:40 BoogieIcfgContainer [2022-11-25 17:53:40,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:53:40,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:53:40,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:53:40,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:53:40,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:53:38" (1/3) ... [2022-11-25 17:53:40,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ff8f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:53:40, skipping insertion in model container [2022-11-25 17:53:40,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:53:39" (2/3) ... [2022-11-25 17:53:40,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ff8f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:53:40, skipping insertion in model container [2022-11-25 17:53:40,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:53:40" (3/3) ... [2022-11-25 17:53:40,563 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-25 17:53:40,583 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:53:40,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-25 17:53:40,584 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:53:40,639 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:53:40,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-11-25 17:53:40,775 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-11-25 17:53:40,776 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:53:40,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-25 17:53:40,783 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-11-25 17:53:40,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2022-11-25 17:53:40,800 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:53:40,835 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2022-11-25 17:53:40,838 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2022-11-25 17:53:40,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2022-11-25 17:53:40,891 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-11-25 17:53:40,891 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:53:40,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-25 17:53:40,897 INFO L119 LiptonReduction]: Number of co-enabled transitions 2320 [2022-11-25 17:53:47,179 INFO L134 LiptonReduction]: Checked pairs total: 6079 [2022-11-25 17:53:47,179 INFO L136 LiptonReduction]: Total number of compositions: 123 [2022-11-25 17:53:47,197 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:53:47,204 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;@4c088050, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:53:47,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-25 17:53:47,206 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 17:53:47,206 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:53:47,207 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:53:47,207 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:53:47,208 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:53:47,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:47,214 INFO L85 PathProgramCache]: Analyzing trace with hash 601, now seen corresponding path program 1 times [2022-11-25 17:53:47,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:47,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879379128] [2022-11-25 17:53:47,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:47,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:47,339 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:53:47,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:47,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879379128] [2022-11-25 17:53:47,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879379128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:47,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:47,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:53:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394205683] [2022-11-25 17:53:47,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:47,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:53:47,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:47,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:53:47,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:53:47,380 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 248 [2022-11-25 17:53:47,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:47,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:53:47,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 248 [2022-11-25 17:53:47,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:53:47,978 INFO L130 PetriNetUnfolder]: 1616/2377 cut-off events. [2022-11-25 17:53:47,979 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-25 17:53:47,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4801 conditions, 2377 events. 1616/2377 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11020 event pairs, 1616 based on Foata normal form. 0/2022 useless extension candidates. Maximal degree in co-relation 4790. Up to 2368 conditions per place. [2022-11-25 17:53:48,000 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2022-11-25 17:53:48,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2022-11-25 17:53:48,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:53:48,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:53:48,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 250 transitions. [2022-11-25 17:53:48,024 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5040322580645161 [2022-11-25 17:53:48,025 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 250 transitions. [2022-11-25 17:53:48,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 250 transitions. [2022-11-25 17:53:48,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:53:48,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 250 transitions. [2022-11-25 17:53:48,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.0) internal successors, (250), 2 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:48,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:48,045 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:48,047 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 250 transitions. [2022-11-25 17:53:48,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2022-11-25 17:53:48,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:53:48,053 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2022-11-25 17:53:48,056 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-11-25 17:53:48,062 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2022-11-25 17:53:48,062 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2022-11-25 17:53:48,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:48,063 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:53:48,063 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:53:48,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:53:48,065 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:53:48,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:48,077 INFO L85 PathProgramCache]: Analyzing trace with hash 590854, now seen corresponding path program 1 times [2022-11-25 17:53:48,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:48,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89560043] [2022-11-25 17:53:48,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:48,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:48,456 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:53:48,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:48,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89560043] [2022-11-25 17:53:48,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89560043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:48,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:48,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:53:48,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798730945] [2022-11-25 17:53:48,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:48,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:53:48,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:48,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:53:48,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:53:48,470 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 248 [2022-11-25 17:53:48,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:48,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:53:48,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 248 [2022-11-25 17:53:48,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:53:48,950 INFO L130 PetriNetUnfolder]: 1263/1942 cut-off events. [2022-11-25 17:53:48,950 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:53:48,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3851 conditions, 1942 events. 1263/1942 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9443 event pairs, 352 based on Foata normal form. 0/1781 useless extension candidates. Maximal degree in co-relation 3848. Up to 1510 conditions per place. [2022-11-25 17:53:48,963 INFO L137 encePairwiseOnDemand]: 245/248 looper letters, 35 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2022-11-25 17:53:48,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 170 flow [2022-11-25 17:53:48,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:53:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:53:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2022-11-25 17:53:48,969 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4932795698924731 [2022-11-25 17:53:48,970 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2022-11-25 17:53:48,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2022-11-25 17:53:48,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:53:48,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2022-11-25 17:53:48,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:48,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:48,979 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:48,979 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 367 transitions. [2022-11-25 17:53:48,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 170 flow [2022-11-25 17:53:48,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:53:48,982 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2022-11-25 17:53:48,982 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-11-25 17:53:48,983 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2022-11-25 17:53:48,983 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2022-11-25 17:53:48,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:48,985 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:53:48,985 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:53:48,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:53:48,985 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:53:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:48,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1559922947, now seen corresponding path program 1 times [2022-11-25 17:53:48,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:48,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400203116] [2022-11-25 17:53:48,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:48,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:49,358 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:53:49,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:49,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400203116] [2022-11-25 17:53:49,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400203116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:49,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:49,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:53:49,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098902340] [2022-11-25 17:53:49,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:49,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:53:49,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:49,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:53:49,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:53:49,369 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 248 [2022-11-25 17:53:49,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:49,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:53:49,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 248 [2022-11-25 17:53:49,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:53:49,879 INFO L130 PetriNetUnfolder]: 1159/1751 cut-off events. [2022-11-25 17:53:49,880 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2022-11-25 17:53:49,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3688 conditions, 1751 events. 1159/1751 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8125 event pairs, 311 based on Foata normal form. 0/1697 useless extension candidates. Maximal degree in co-relation 3684. Up to 913 conditions per place. [2022-11-25 17:53:49,894 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 44 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2022-11-25 17:53:49,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 212 flow [2022-11-25 17:53:49,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:53:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:53:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-11-25 17:53:49,902 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47580645161290325 [2022-11-25 17:53:49,902 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2022-11-25 17:53:49,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2022-11-25 17:53:49,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:53:49,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2022-11-25 17:53:49,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:49,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:49,908 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:49,909 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 590 transitions. [2022-11-25 17:53:49,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 212 flow [2022-11-25 17:53:49,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 50 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:53:49,911 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 76 flow [2022-11-25 17:53:49,911 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-11-25 17:53:49,913 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-11-25 17:53:49,913 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 76 flow [2022-11-25 17:53:49,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:49,914 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:53:49,914 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:53:49,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:53:49,914 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:53:49,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:49,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1559922986, now seen corresponding path program 1 times [2022-11-25 17:53:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:49,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702769475] [2022-11-25 17:53:49,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:49,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:50,489 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:53:50,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:50,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702769475] [2022-11-25 17:53:50,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702769475] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:50,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:50,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:53:50,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216837447] [2022-11-25 17:53:50,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:50,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:53:50,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:50,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:53:50,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:53:50,630 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 248 [2022-11-25 17:53:50,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:50,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:53:50,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 248 [2022-11-25 17:53:50,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:53:51,021 INFO L130 PetriNetUnfolder]: 871/1332 cut-off events. [2022-11-25 17:53:51,022 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2022-11-25 17:53:51,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3046 conditions, 1332 events. 871/1332 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6020 event pairs, 216 based on Foata normal form. 128/1460 useless extension candidates. Maximal degree in co-relation 3039. Up to 1288 conditions per place. [2022-11-25 17:53:51,031 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 26 selfloop transitions, 3 changer transitions 2/33 dead transitions. [2022-11-25 17:53:51,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 154 flow [2022-11-25 17:53:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:53:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:53:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 505 transitions. [2022-11-25 17:53:51,034 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40725806451612906 [2022-11-25 17:53:51,034 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 505 transitions. [2022-11-25 17:53:51,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 505 transitions. [2022-11-25 17:53:51,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:53:51,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 505 transitions. [2022-11-25 17:53:51,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:51,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:51,040 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:51,040 INFO L175 Difference]: Start difference. First operand has 38 places, 25 transitions, 76 flow. Second operand 5 states and 505 transitions. [2022-11-25 17:53:51,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 154 flow [2022-11-25 17:53:51,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:53:51,045 INFO L231 Difference]: Finished difference. Result has 40 places, 22 transitions, 66 flow [2022-11-25 17:53:51,045 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2022-11-25 17:53:51,046 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2022-11-25 17:53:51,046 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 66 flow [2022-11-25 17:53:51,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:51,047 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:53:51,047 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:53:51,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:53:51,047 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:53:51,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash 67612299, now seen corresponding path program 1 times [2022-11-25 17:53:51,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:51,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202685431] [2022-11-25 17:53:51,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:51,994 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:53:51,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:51,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202685431] [2022-11-25 17:53:51,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202685431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:51,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:51,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:53:51,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531122647] [2022-11-25 17:53:51,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:51,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:53:51,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:51,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:53:51,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:53:52,058 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 248 [2022-11-25 17:53:52,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 22 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 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:53:52,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:53:52,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 248 [2022-11-25 17:53:52,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:53:52,451 INFO L130 PetriNetUnfolder]: 745/1228 cut-off events. [2022-11-25 17:53:52,451 INFO L131 PetriNetUnfolder]: For 256/256 co-relation queries the response was YES. [2022-11-25 17:53:52,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2613 conditions, 1228 events. 745/1228 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5940 event pairs, 134 based on Foata normal form. 48/1275 useless extension candidates. Maximal degree in co-relation 2606. Up to 868 conditions per place. [2022-11-25 17:53:52,461 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 29 selfloop transitions, 2 changer transitions 14/47 dead transitions. [2022-11-25 17:53:52,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 214 flow [2022-11-25 17:53:52,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:53:52,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:53:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 552 transitions. [2022-11-25 17:53:52,464 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44516129032258067 [2022-11-25 17:53:52,464 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 552 transitions. [2022-11-25 17:53:52,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 552 transitions. [2022-11-25 17:53:52,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:53:52,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 552 transitions. [2022-11-25 17:53:52,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:52,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:52,470 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:52,470 INFO L175 Difference]: Start difference. First operand has 40 places, 22 transitions, 66 flow. Second operand 5 states and 552 transitions. [2022-11-25 17:53:52,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 214 flow [2022-11-25 17:53:52,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 201 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-11-25 17:53:52,475 INFO L231 Difference]: Finished difference. Result has 39 places, 22 transitions, 67 flow [2022-11-25 17:53:52,475 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2022-11-25 17:53:52,476 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2022-11-25 17:53:52,476 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 67 flow [2022-11-25 17:53:52,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 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:53:52,477 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:53:52,477 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:53:52,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:53:52,478 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:53:52,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:52,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2095955227, now seen corresponding path program 1 times [2022-11-25 17:53:52,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:52,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541653261] [2022-11-25 17:53:52,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:52,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:53,004 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:53:53,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:53,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541653261] [2022-11-25 17:53:53,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541653261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:53,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:53,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:53:53,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73420678] [2022-11-25 17:53:53,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:53,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:53:53,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:53,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:53:53,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:53:53,036 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 248 [2022-11-25 17:53:53,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:53,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:53:53,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 248 [2022-11-25 17:53:53,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:53:53,574 INFO L130 PetriNetUnfolder]: 1414/2149 cut-off events. [2022-11-25 17:53:53,574 INFO L131 PetriNetUnfolder]: For 427/427 co-relation queries the response was YES. [2022-11-25 17:53:53,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4979 conditions, 2149 events. 1414/2149 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10135 event pairs, 348 based on Foata normal form. 48/2197 useless extension candidates. Maximal degree in co-relation 4971. Up to 1013 conditions per place. [2022-11-25 17:53:53,588 INFO L137 encePairwiseOnDemand]: 240/248 looper letters, 34 selfloop transitions, 5 changer transitions 15/55 dead transitions. [2022-11-25 17:53:53,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 258 flow [2022-11-25 17:53:53,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:53:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:53:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2022-11-25 17:53:53,592 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47580645161290325 [2022-11-25 17:53:53,592 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2022-11-25 17:53:53,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2022-11-25 17:53:53,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:53:53,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2022-11-25 17:53:53,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:53,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:53,597 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:53,597 INFO L175 Difference]: Start difference. First operand has 39 places, 22 transitions, 67 flow. Second operand 5 states and 590 transitions. [2022-11-25 17:53:53,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 258 flow [2022-11-25 17:53:53,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 55 transitions, 246 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-25 17:53:53,610 INFO L231 Difference]: Finished difference. Result has 40 places, 25 transitions, 95 flow [2022-11-25 17:53:53,610 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=40, PETRI_TRANSITIONS=25} [2022-11-25 17:53:53,612 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2022-11-25 17:53:53,613 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 95 flow [2022-11-25 17:53:53,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:53,613 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:53:53,614 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:53:53,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:53:53,614 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:53:53,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:53,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1468952541, now seen corresponding path program 2 times [2022-11-25 17:53:53,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:53,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843518042] [2022-11-25 17:53:53,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:53,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:53,917 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:53:53,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:53,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843518042] [2022-11-25 17:53:53,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843518042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:53,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:53,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:53:53,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128830752] [2022-11-25 17:53:53,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:53,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:53:53,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:53,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:53:53,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:53:53,938 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 248 [2022-11-25 17:53:53,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 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:53:53,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:53:53,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 248 [2022-11-25 17:53:53,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:53:54,556 INFO L130 PetriNetUnfolder]: 1374/2116 cut-off events. [2022-11-25 17:53:54,557 INFO L131 PetriNetUnfolder]: For 962/963 co-relation queries the response was YES. [2022-11-25 17:53:54,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5460 conditions, 2116 events. 1374/2116 cut-off events. For 962/963 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10673 event pairs, 230 based on Foata normal form. 60/2133 useless extension candidates. Maximal degree in co-relation 5451. Up to 781 conditions per place. [2022-11-25 17:53:54,568 INFO L137 encePairwiseOnDemand]: 243/248 looper letters, 40 selfloop transitions, 3 changer transitions 20/64 dead transitions. [2022-11-25 17:53:54,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 64 transitions, 340 flow [2022-11-25 17:53:54,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:53:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:53:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 692 transitions. [2022-11-25 17:53:54,571 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4650537634408602 [2022-11-25 17:53:54,571 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 692 transitions. [2022-11-25 17:53:54,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 692 transitions. [2022-11-25 17:53:54,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:53:54,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 692 transitions. [2022-11-25 17:53:54,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:54,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:54,577 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:54,578 INFO L175 Difference]: Start difference. First operand has 40 places, 25 transitions, 95 flow. Second operand 6 states and 692 transitions. [2022-11-25 17:53:54,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 64 transitions, 340 flow [2022-11-25 17:53:54,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 322 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-11-25 17:53:54,583 INFO L231 Difference]: Finished difference. Result has 45 places, 24 transitions, 98 flow [2022-11-25 17:53:54,583 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=98, PETRI_PLACES=45, PETRI_TRANSITIONS=24} [2022-11-25 17:53:54,586 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2022-11-25 17:53:54,586 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 24 transitions, 98 flow [2022-11-25 17:53:54,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.6) internal successors, (538), 5 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:53:54,587 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:53:54,587 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:53:54,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:53:54,587 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:53:54,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:54,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1000272756, now seen corresponding path program 1 times [2022-11-25 17:53:54,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:54,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69798278] [2022-11-25 17:53:54,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:54,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:55,793 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:53:55,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:55,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69798278] [2022-11-25 17:53:55,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69798278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:55,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:55,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:53:55,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119858807] [2022-11-25 17:53:55,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:55,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:53:55,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:55,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:53:55,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:53:55,884 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 248 [2022-11-25 17:53:55,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 24 transitions, 98 flow. Second operand has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:55,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:53:55,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 248 [2022-11-25 17:53:55,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:53:56,400 INFO L130 PetriNetUnfolder]: 1014/1560 cut-off events. [2022-11-25 17:53:56,400 INFO L131 PetriNetUnfolder]: For 961/961 co-relation queries the response was YES. [2022-11-25 17:53:56,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4251 conditions, 1560 events. 1014/1560 cut-off events. For 961/961 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6865 event pairs, 173 based on Foata normal form. 36/1595 useless extension candidates. Maximal degree in co-relation 4240. Up to 731 conditions per place. [2022-11-25 17:53:56,410 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 35 selfloop transitions, 6 changer transitions 15/57 dead transitions. [2022-11-25 17:53:56,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 318 flow [2022-11-25 17:53:56,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:53:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:53:56,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2022-11-25 17:53:56,413 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4443548387096774 [2022-11-25 17:53:56,414 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2022-11-25 17:53:56,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2022-11-25 17:53:56,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:53:56,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2022-11-25 17:53:56,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:56,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:56,420 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:56,420 INFO L175 Difference]: Start difference. First operand has 45 places, 24 transitions, 98 flow. Second operand 5 states and 551 transitions. [2022-11-25 17:53:56,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 318 flow [2022-11-25 17:53:56,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 294 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-11-25 17:53:56,429 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 124 flow [2022-11-25 17:53:56,429 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2022-11-25 17:53:56,431 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2022-11-25 17:53:56,432 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 27 transitions, 124 flow [2022-11-25 17:53:56,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:56,432 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:53:56,433 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:53:56,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:53:56,433 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:53:56,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:56,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1722325972, now seen corresponding path program 2 times [2022-11-25 17:53:56,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:56,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144586307] [2022-11-25 17:53:56,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:56,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:57,175 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:53:57,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:57,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144586307] [2022-11-25 17:53:57,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144586307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:57,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:57,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:53:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451076127] [2022-11-25 17:53:57,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:57,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:53:57,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:57,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:53:57,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:53:57,218 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 248 [2022-11-25 17:53:57,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 27 transitions, 124 flow. Second operand has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:57,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:53:57,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 248 [2022-11-25 17:53:57,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:53:57,668 INFO L130 PetriNetUnfolder]: 714/1126 cut-off events. [2022-11-25 17:53:57,669 INFO L131 PetriNetUnfolder]: For 1055/1055 co-relation queries the response was YES. [2022-11-25 17:53:57,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3269 conditions, 1126 events. 714/1126 cut-off events. For 1055/1055 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4594 event pairs, 94 based on Foata normal form. 36/1161 useless extension candidates. Maximal degree in co-relation 3259. Up to 677 conditions per place. [2022-11-25 17:53:57,677 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 36 selfloop transitions, 6 changer transitions 20/63 dead transitions. [2022-11-25 17:53:57,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 383 flow [2022-11-25 17:53:57,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:53:57,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:53:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 690 transitions. [2022-11-25 17:53:57,681 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4637096774193548 [2022-11-25 17:53:57,681 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 690 transitions. [2022-11-25 17:53:57,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 690 transitions. [2022-11-25 17:53:57,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:53:57,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 690 transitions. [2022-11-25 17:53:57,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:57,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:57,687 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:57,687 INFO L175 Difference]: Start difference. First operand has 44 places, 27 transitions, 124 flow. Second operand 6 states and 690 transitions. [2022-11-25 17:53:57,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 383 flow [2022-11-25 17:53:57,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 362 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-11-25 17:53:57,691 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 158 flow [2022-11-25 17:53:57,691 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2022-11-25 17:53:57,692 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2022-11-25 17:53:57,692 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 158 flow [2022-11-25 17:53:57,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:57,693 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:53:57,693 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:53:57,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:53:57,694 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:53:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:57,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1607578499, now seen corresponding path program 1 times [2022-11-25 17:53:57,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:57,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361910952] [2022-11-25 17:53:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:57,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:53:58,511 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:53:58,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:53:58,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361910952] [2022-11-25 17:53:58,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361910952] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:53:58,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:53:58,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:53:58,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240951984] [2022-11-25 17:53:58,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:53:58,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:53:58,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:53:58,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:53:58,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:53:58,552 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 248 [2022-11-25 17:53:58,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 29 transitions, 158 flow. Second operand has 8 states, 8 states have (on average 103.875) internal successors, (831), 8 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:58,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:53:58,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 248 [2022-11-25 17:53:58,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:53:59,194 INFO L130 PetriNetUnfolder]: 744/1169 cut-off events. [2022-11-25 17:53:59,194 INFO L131 PetriNetUnfolder]: For 1685/1685 co-relation queries the response was YES. [2022-11-25 17:53:59,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3609 conditions, 1169 events. 744/1169 cut-off events. For 1685/1685 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4716 event pairs, 214 based on Foata normal form. 26/1195 useless extension candidates. Maximal degree in co-relation 3597. Up to 601 conditions per place. [2022-11-25 17:53:59,203 INFO L137 encePairwiseOnDemand]: 239/248 looper letters, 36 selfloop transitions, 10 changer transitions 31/78 dead transitions. [2022-11-25 17:53:59,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 78 transitions, 514 flow [2022-11-25 17:53:59,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:53:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 17:53:59,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 991 transitions. [2022-11-25 17:53:59,207 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44399641577060933 [2022-11-25 17:53:59,208 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 991 transitions. [2022-11-25 17:53:59,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 991 transitions. [2022-11-25 17:53:59,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:53:59,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 991 transitions. [2022-11-25 17:53:59,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:59,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 248.0) internal successors, (2480), 10 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:59,218 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 248.0) internal successors, (2480), 10 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:59,218 INFO L175 Difference]: Start difference. First operand has 48 places, 29 transitions, 158 flow. Second operand 9 states and 991 transitions. [2022-11-25 17:53:59,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 78 transitions, 514 flow [2022-11-25 17:53:59,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 78 transitions, 478 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-11-25 17:53:59,225 INFO L231 Difference]: Finished difference. Result has 56 places, 33 transitions, 207 flow [2022-11-25 17:53:59,226 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=207, PETRI_PLACES=56, PETRI_TRANSITIONS=33} [2022-11-25 17:53:59,227 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2022-11-25 17:53:59,227 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 33 transitions, 207 flow [2022-11-25 17:53:59,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.875) internal successors, (831), 8 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:53:59,228 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:53:59,228 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:53:59,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:53:59,229 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:53:59,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:53:59,230 INFO L85 PathProgramCache]: Analyzing trace with hash 374230337, now seen corresponding path program 1 times [2022-11-25 17:53:59,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:53:59,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454790524] [2022-11-25 17:53:59,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:53:59,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:53:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:01,372 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:01,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:01,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454790524] [2022-11-25 17:54:01,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454790524] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:01,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:01,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:54:01,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62237073] [2022-11-25 17:54:01,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:01,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:54:01,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:01,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:54:01,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:54:01,487 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 248 [2022-11-25 17:54:01,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 33 transitions, 207 flow. Second operand has 9 states, 9 states have (on average 99.66666666666667) internal successors, (897), 9 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:01,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:01,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 248 [2022-11-25 17:54:01,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:02,544 INFO L130 PetriNetUnfolder]: 710/1144 cut-off events. [2022-11-25 17:54:02,544 INFO L131 PetriNetUnfolder]: For 2823/2823 co-relation queries the response was YES. [2022-11-25 17:54:02,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4023 conditions, 1144 events. 710/1144 cut-off events. For 2823/2823 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4847 event pairs, 108 based on Foata normal form. 57/1201 useless extension candidates. Maximal degree in co-relation 4007. Up to 630 conditions per place. [2022-11-25 17:54:02,553 INFO L137 encePairwiseOnDemand]: 237/248 looper letters, 47 selfloop transitions, 19 changer transitions 22/89 dead transitions. [2022-11-25 17:54:02,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 89 transitions, 653 flow [2022-11-25 17:54:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:54:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 17:54:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1158 transitions. [2022-11-25 17:54:02,558 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4244868035190616 [2022-11-25 17:54:02,558 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1158 transitions. [2022-11-25 17:54:02,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1158 transitions. [2022-11-25 17:54:02,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:02,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1158 transitions. [2022-11-25 17:54:02,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 105.27272727272727) internal successors, (1158), 11 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call 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:02,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 248.0) internal successors, (2976), 12 states have internal predecessors, (2976), 0 states have call successors, (0), 0 states have call 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:02,567 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 248.0) internal successors, (2976), 12 states have internal predecessors, (2976), 0 states have call successors, (0), 0 states have call 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:02,567 INFO L175 Difference]: Start difference. First operand has 56 places, 33 transitions, 207 flow. Second operand 11 states and 1158 transitions. [2022-11-25 17:54:02,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 89 transitions, 653 flow [2022-11-25 17:54:02,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 89 transitions, 631 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-11-25 17:54:02,574 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 328 flow [2022-11-25 17:54:02,574 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=328, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2022-11-25 17:54:02,574 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2022-11-25 17:54:02,575 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 328 flow [2022-11-25 17:54:02,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 99.66666666666667) internal successors, (897), 9 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:02,575 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:02,576 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:02,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:54:02,576 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:54:02,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:02,577 INFO L85 PathProgramCache]: Analyzing trace with hash 644999847, now seen corresponding path program 1 times [2022-11-25 17:54:02,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:02,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013789253] [2022-11-25 17:54:02,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:02,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:04,288 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:04,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:04,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013789253] [2022-11-25 17:54:04,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013789253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:04,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:04,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:54:04,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811126261] [2022-11-25 17:54:04,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:04,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:54:04,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:04,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:54:04,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:54:04,474 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 248 [2022-11-25 17:54:04,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 328 flow. Second operand has 10 states, 10 states have (on average 100.6) internal successors, (1006), 10 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call 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:04,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:04,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 248 [2022-11-25 17:54:04,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:05,399 INFO L130 PetriNetUnfolder]: 792/1305 cut-off events. [2022-11-25 17:54:05,399 INFO L131 PetriNetUnfolder]: For 4194/4195 co-relation queries the response was YES. [2022-11-25 17:54:05,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4783 conditions, 1305 events. 792/1305 cut-off events. For 4194/4195 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6030 event pairs, 201 based on Foata normal form. 42/1346 useless extension candidates. Maximal degree in co-relation 4764. Up to 463 conditions per place. [2022-11-25 17:54:05,409 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 34 selfloop transitions, 6 changer transitions 36/77 dead transitions. [2022-11-25 17:54:05,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 77 transitions, 650 flow [2022-11-25 17:54:05,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:54:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:54:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 856 transitions. [2022-11-25 17:54:05,412 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4314516129032258 [2022-11-25 17:54:05,413 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 856 transitions. [2022-11-25 17:54:05,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 856 transitions. [2022-11-25 17:54:05,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:05,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 856 transitions. [2022-11-25 17:54:05,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.0) internal successors, (856), 8 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call 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:05,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call 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:05,420 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call 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:05,420 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 328 flow. Second operand 8 states and 856 transitions. [2022-11-25 17:54:05,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 77 transitions, 650 flow [2022-11-25 17:54:05,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 622 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-11-25 17:54:05,428 INFO L231 Difference]: Finished difference. Result has 69 places, 33 transitions, 255 flow [2022-11-25 17:54:05,428 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=255, PETRI_PLACES=69, PETRI_TRANSITIONS=33} [2022-11-25 17:54:05,429 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2022-11-25 17:54:05,429 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 33 transitions, 255 flow [2022-11-25 17:54:05,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 100.6) internal successors, (1006), 10 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call 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:05,430 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:05,430 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:05,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:54:05,430 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:54:05,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:05,431 INFO L85 PathProgramCache]: Analyzing trace with hash -745538710, now seen corresponding path program 1 times [2022-11-25 17:54:05,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:05,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812452126] [2022-11-25 17:54:05,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:05,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:05,654 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:05,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:05,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812452126] [2022-11-25 17:54:05,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812452126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:05,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:05,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:54:05,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505164740] [2022-11-25 17:54:05,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:05,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:54:05,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:05,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:54:05,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:54:05,665 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 248 [2022-11-25 17:54:05,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 33 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:05,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:05,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 248 [2022-11-25 17:54:05,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:05,862 INFO L130 PetriNetUnfolder]: 294/535 cut-off events. [2022-11-25 17:54:05,862 INFO L131 PetriNetUnfolder]: For 2796/2800 co-relation queries the response was YES. [2022-11-25 17:54:05,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 535 events. 294/535 cut-off events. For 2796/2800 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2207 event pairs, 38 based on Foata normal form. 58/592 useless extension candidates. Maximal degree in co-relation 2196. Up to 249 conditions per place. [2022-11-25 17:54:05,867 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 47 selfloop transitions, 5 changer transitions 1/55 dead transitions. [2022-11-25 17:54:05,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 55 transitions, 518 flow [2022-11-25 17:54:05,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:54:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:54:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 457 transitions. [2022-11-25 17:54:05,869 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46068548387096775 [2022-11-25 17:54:05,869 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 457 transitions. [2022-11-25 17:54:05,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 457 transitions. [2022-11-25 17:54:05,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:05,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 457 transitions. [2022-11-25 17:54:05,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:05,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call 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:05,873 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call 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:05,873 INFO L175 Difference]: Start difference. First operand has 69 places, 33 transitions, 255 flow. Second operand 4 states and 457 transitions. [2022-11-25 17:54:05,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 55 transitions, 518 flow [2022-11-25 17:54:05,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 55 transitions, 455 flow, removed 16 selfloop flow, removed 14 redundant places. [2022-11-25 17:54:05,878 INFO L231 Difference]: Finished difference. Result has 55 places, 31 transitions, 206 flow [2022-11-25 17:54:05,878 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=55, PETRI_TRANSITIONS=31} [2022-11-25 17:54:05,880 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2022-11-25 17:54:05,880 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 31 transitions, 206 flow [2022-11-25 17:54:05,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:05,881 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:05,881 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:05,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:54:05,881 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:54:05,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:05,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1165444294, now seen corresponding path program 1 times [2022-11-25 17:54:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:05,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649597334] [2022-11-25 17:54:05,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:05,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:06,209 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:06,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:06,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649597334] [2022-11-25 17:54:06,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649597334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:06,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:06,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:54:06,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343428643] [2022-11-25 17:54:06,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:06,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:54:06,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:06,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:54:06,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:54:06,222 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 248 [2022-11-25 17:54:06,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 31 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call 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:06,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:06,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 248 [2022-11-25 17:54:06,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:06,418 INFO L130 PetriNetUnfolder]: 142/296 cut-off events. [2022-11-25 17:54:06,418 INFO L131 PetriNetUnfolder]: For 1113/1115 co-relation queries the response was YES. [2022-11-25 17:54:06,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 296 events. 142/296 cut-off events. For 1113/1115 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1114 event pairs, 13 based on Foata normal form. 36/331 useless extension candidates. Maximal degree in co-relation 1321. Up to 114 conditions per place. [2022-11-25 17:54:06,421 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 46 selfloop transitions, 8 changer transitions 5/61 dead transitions. [2022-11-25 17:54:06,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 539 flow [2022-11-25 17:54:06,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:54:06,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:54:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-11-25 17:54:06,424 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4588709677419355 [2022-11-25 17:54:06,424 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 569 transitions. [2022-11-25 17:54:06,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 569 transitions. [2022-11-25 17:54:06,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:06,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 569 transitions. [2022-11-25 17:54:06,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call 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:06,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call 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:06,429 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call 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:06,429 INFO L175 Difference]: Start difference. First operand has 55 places, 31 transitions, 206 flow. Second operand 5 states and 569 transitions. [2022-11-25 17:54:06,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 539 flow [2022-11-25 17:54:06,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 61 transitions, 521 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-11-25 17:54:06,434 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 240 flow [2022-11-25 17:54:06,434 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2022-11-25 17:54:06,435 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2022-11-25 17:54:06,435 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 34 transitions, 240 flow [2022-11-25 17:54:06,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.2) internal successors, (536), 5 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call 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:06,436 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:06,436 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:54:06,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:54:06,437 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:54:06,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash -98714028, now seen corresponding path program 1 times [2022-11-25 17:54:06,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:06,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545555589] [2022-11-25 17:54:06,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:06,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:06,762 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:06,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:54:06,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545555589] [2022-11-25 17:54:06,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545555589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:06,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:06,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:54:06,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671621377] [2022-11-25 17:54:06,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:06,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:54:06,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:54:06,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:54:06,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:54:06,776 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 248 [2022-11-25 17:54:06,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 34 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:06,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:06,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 248 [2022-11-25 17:54:06,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:06,942 INFO L130 PetriNetUnfolder]: 81/180 cut-off events. [2022-11-25 17:54:06,943 INFO L131 PetriNetUnfolder]: For 735/737 co-relation queries the response was YES. [2022-11-25 17:54:06,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 893 conditions, 180 events. 81/180 cut-off events. For 735/737 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 583 event pairs, 13 based on Foata normal form. 11/190 useless extension candidates. Maximal degree in co-relation 876. Up to 64 conditions per place. [2022-11-25 17:54:06,944 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 36 selfloop transitions, 11 changer transitions 4/53 dead transitions. [2022-11-25 17:54:06,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 485 flow [2022-11-25 17:54:06,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:54:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:54:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 666 transitions. [2022-11-25 17:54:06,947 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4475806451612903 [2022-11-25 17:54:06,947 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 666 transitions. [2022-11-25 17:54:06,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 666 transitions. [2022-11-25 17:54:06,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:06,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 666 transitions. [2022-11-25 17:54:06,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call 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:06,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call 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:06,953 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call 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:06,953 INFO L175 Difference]: Start difference. First operand has 58 places, 34 transitions, 240 flow. Second operand 6 states and 666 transitions. [2022-11-25 17:54:06,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 485 flow [2022-11-25 17:54:06,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 406 flow, removed 24 selfloop flow, removed 8 redundant places. [2022-11-25 17:54:06,957 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 227 flow [2022-11-25 17:54:06,957 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=227, PETRI_PLACES=57, PETRI_TRANSITIONS=34} [2022-11-25 17:54:06,958 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2022-11-25 17:54:06,958 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 227 flow [2022-11-25 17:54:06,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:06,958 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:06,959 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:06,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:54:06,959 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:54:06,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:06,960 INFO L85 PathProgramCache]: Analyzing trace with hash -817757467, now seen corresponding path program 1 times [2022-11-25 17:54:06,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:54:06,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392367815] [2022-11-25 17:54:06,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:06,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:54:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:54:07,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:54:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:54:07,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:54:07,192 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:54:07,195 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-25 17:54:07,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-25 17:54:07,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-25 17:54:07,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-25 17:54:07,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-25 17:54:07,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-25 17:54:07,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-25 17:54:07,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-25 17:54:07,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-25 17:54:07,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-25 17:54:07,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-25 17:54:07,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-25 17:54:07,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-25 17:54:07,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:54:07,204 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:07,211 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:54:07,211 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:54:07,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:54:07 BasicIcfg [2022-11-25 17:54:07,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:54:07,313 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:54:07,313 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:54:07,313 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:54:07,314 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:53:40" (3/4) ... [2022-11-25 17:54:07,317 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:54:07,317 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:54:07,318 INFO L158 Benchmark]: Toolchain (without parser) took 28785.36ms. Allocated memory was 163.6MB in the beginning and 536.9MB in the end (delta: 373.3MB). Free memory was 117.1MB in the beginning and 243.0MB in the end (delta: -125.9MB). Peak memory consumption was 246.7MB. Max. memory is 16.1GB. [2022-11-25 17:54:07,318 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 127.9MB. Free memory was 89.7MB in the beginning and 89.7MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:54:07,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 830.37ms. Allocated memory is still 163.6MB. Free memory was 117.1MB in the beginning and 88.4MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-25 17:54:07,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.84ms. Allocated memory is still 163.6MB. Free memory was 88.4MB in the beginning and 85.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:54:07,319 INFO L158 Benchmark]: Boogie Preprocessor took 96.28ms. Allocated memory is still 163.6MB. Free memory was 85.7MB in the beginning and 82.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:54:07,320 INFO L158 Benchmark]: RCFGBuilder took 982.63ms. Allocated memory is still 163.6MB. Free memory was 82.9MB in the beginning and 108.9MB in the end (delta: -26.0MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2022-11-25 17:54:07,320 INFO L158 Benchmark]: TraceAbstraction took 26756.54ms. Allocated memory was 163.6MB in the beginning and 536.9MB in the end (delta: 373.3MB). Free memory was 107.7MB in the beginning and 244.0MB in the end (delta: -136.3MB). Peak memory consumption was 236.9MB. Max. memory is 16.1GB. [2022-11-25 17:54:07,321 INFO L158 Benchmark]: Witness Printer took 4.48ms. Allocated memory is still 536.9MB. Free memory was 244.0MB in the beginning and 243.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:54:07,322 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.29ms. Allocated memory is still 127.9MB. Free memory was 89.7MB in the beginning and 89.7MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 830.37ms. Allocated memory is still 163.6MB. Free memory was 117.1MB in the beginning and 88.4MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.84ms. Allocated memory is still 163.6MB. Free memory was 88.4MB in the beginning and 85.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.28ms. Allocated memory is still 163.6MB. Free memory was 85.7MB in the beginning and 82.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 982.63ms. Allocated memory is still 163.6MB. Free memory was 82.9MB in the beginning and 108.9MB in the end (delta: -26.0MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * TraceAbstraction took 26756.54ms. Allocated memory was 163.6MB in the beginning and 536.9MB in the end (delta: 373.3MB). Free memory was 107.7MB in the beginning and 244.0MB in the end (delta: -136.3MB). Peak memory consumption was 236.9MB. Max. memory is 16.1GB. * Witness Printer took 4.48ms. Allocated memory is still 536.9MB. Free memory was 244.0MB in the beginning and 243.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 130 PlacesBefore, 41 PlacesAfterwards, 122 TransitionsBefore, 32 TransitionsAfterwards, 2320 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 123 TotalNumberOfCompositions, 6079 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2839, independent: 2667, independent conditional: 0, independent unconditional: 2667, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1585, independent: 1538, independent conditional: 0, independent unconditional: 1538, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1585, independent: 1523, independent conditional: 0, independent unconditional: 1523, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 569, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 538, dependent conditional: 0, dependent unconditional: 538, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2839, independent: 1129, independent conditional: 0, independent unconditional: 1129, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 1585, unknown conditional: 0, unknown unconditional: 1585] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1849; [L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849, ((void *)0), P0, ((void *)0))=-3, t1849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1850; [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1850, ((void *)0), P1, ((void *)0))=-2, t1849={5:0}, t1850={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L850] 0 pthread_t t1851; [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1851, ((void *)0), P2, ((void *)0))=-1, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=57, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EBX = y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=56, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=56, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=58, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 851]: 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: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1007 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 857 mSDsluCounter, 528 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 480 mSDsCounter, 266 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1924 IncrementalHoareTripleChecker+Invalid, 2190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 266 mSolverCounterUnsat, 48 mSDtfsCounter, 1924 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=328occurred in iteration=11, InterpolantAutomatonStates: 85, 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.8s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 2153 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:54:07,351 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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_5e1c9494-609e-47c4-8437-868cbb5be021/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 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf --- 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:09,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:54:09,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:54:09,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:54:09,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:54:09,848 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:54:09,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:54:09,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:54:09,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:54:09,866 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:54:09,867 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:54:09,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:54:09,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:54:09,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:54:09,875 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:54:09,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:54:09,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:54:09,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:54:09,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:54:09,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:54:09,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:54:09,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:54:09,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:54:09,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:54:09,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:54:09,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:54:09,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:54:09,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:54:09,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:54:09,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:54:09,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:54:09,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:54:09,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:54:09,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:54:09,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:54:09,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:54:09,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:54:09,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:54:09,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:54:09,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:54:09,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:54:09,946 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 17:54:09,989 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:54:09,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:54:09,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:54:09,991 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:54:09,992 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:54:09,992 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:54:09,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:54:09,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:54:09,993 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:54:09,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:54:09,995 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:54:09,995 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:54:09,995 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:54:09,995 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:54:09,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:54:09,996 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:54:09,996 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:54:09,996 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:54:09,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:54:09,997 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:54:09,997 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 17:54:09,997 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 17:54:09,997 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:54:09,998 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:54:09,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:54:09,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:54:09,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:54:09,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:54:09,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:54:09,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:54:09,999 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 17:54:10,000 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 17:54:10,001 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:54:10,001 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:54:10,001 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:54:10,002 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 17:54:10,002 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_5e1c9494-609e-47c4-8437-868cbb5be021/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_5e1c9494-609e-47c4-8437-868cbb5be021/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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf [2022-11-25 17:54:10,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:54:10,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:54:10,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:54:10,395 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:54:10,395 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:54:10,397 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-25 17:54:13,436 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:54:13,858 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:54:13,859 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-25 17:54:13,873 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/data/c14705ba4/316c43f5586d43eb9759f8b9c199ecde/FLAGc7fc07cb1 [2022-11-25 17:54:13,891 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/data/c14705ba4/316c43f5586d43eb9759f8b9c199ecde [2022-11-25 17:54:13,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:54:13,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:54:13,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:54:13,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:54:13,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:54:13,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:54:13" (1/1) ... [2022-11-25 17:54:13,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eac992d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:13, skipping insertion in model container [2022-11-25 17:54:13,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:54:13" (1/1) ... [2022-11-25 17:54:13,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:54:13,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:54:14,132 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_5e1c9494-609e-47c4-8437-868cbb5be021/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-11-25 17:54:14,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:54:14,449 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:54:14,461 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_5e1c9494-609e-47c4-8437-868cbb5be021/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999] [2022-11-25 17:54:14,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:54:14,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:54:14,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:54:14,552 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:54:14,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:14 WrapperNode [2022-11-25 17:54:14,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:54:14,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:54:14,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:54:14,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:54:14,563 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:14" (1/1) ... [2022-11-25 17:54:14,586 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:14" (1/1) ... [2022-11-25 17:54:14,612 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-11-25 17:54:14,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:54:14,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:54:14,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:54:14,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:54:14,623 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:14" (1/1) ... [2022-11-25 17:54:14,624 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:14" (1/1) ... [2022-11-25 17:54:14,627 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:14" (1/1) ... [2022-11-25 17:54:14,628 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:14" (1/1) ... [2022-11-25 17:54:14,640 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:14" (1/1) ... [2022-11-25 17:54:14,642 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:14" (1/1) ... [2022-11-25 17:54:14,645 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:14" (1/1) ... [2022-11-25 17:54:14,647 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:14" (1/1) ... [2022-11-25 17:54:14,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:54:14,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:54:14,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:54:14,652 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:54:14,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:14" (1/1) ... [2022-11-25 17:54:14,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:54:14,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:54:14,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:14,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:14,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:54:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:54:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:54:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:54:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 17:54:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 17:54:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:54:14,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:54:14,756 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:54:14,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:54:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:54:14,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:54:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:54:14,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:54:14,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:54:14,759 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:14,941 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:54:14,944 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:54:15,591 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:54:15,844 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:54:15,845 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:54:15,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:54:15 BoogieIcfgContainer [2022-11-25 17:54:15,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:54:15,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:54:15,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:54:15,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:54:15,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:54:13" (1/3) ... [2022-11-25 17:54:15,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2416ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:54:15, skipping insertion in model container [2022-11-25 17:54:15,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:54:14" (2/3) ... [2022-11-25 17:54:15,858 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2416ea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:54:15, skipping insertion in model container [2022-11-25 17:54:15,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:54:15" (3/3) ... [2022-11-25 17:54:15,860 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-25 17:54:15,880 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:54:15,881 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-25 17:54:15,882 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:54:15,985 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:54:16,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 267 flow [2022-11-25 17:54:16,143 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-11-25 17:54:16,144 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:54:16,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-25 17:54:16,153 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 126 transitions, 267 flow [2022-11-25 17:54:16,165 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 123 transitions, 255 flow [2022-11-25 17:54:16,174 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:54:16,202 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 123 transitions, 255 flow [2022-11-25 17:54:16,208 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 123 transitions, 255 flow [2022-11-25 17:54:16,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 255 flow [2022-11-25 17:54:16,270 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-11-25 17:54:16,270 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:54:16,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-25 17:54:16,276 INFO L119 LiptonReduction]: Number of co-enabled transitions 2320 [2022-11-25 17:54:28,964 INFO L134 LiptonReduction]: Checked pairs total: 6687 [2022-11-25 17:54:28,964 INFO L136 LiptonReduction]: Total number of compositions: 116 [2022-11-25 17:54:28,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:54:29,000 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;@46340594, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:54:29,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-25 17:54:29,002 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 17:54:29,002 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:54:29,003 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:29,004 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:54:29,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:54:29,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:29,011 INFO L85 PathProgramCache]: Analyzing trace with hash 597, now seen corresponding path program 1 times [2022-11-25 17:54:29,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:54:29,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525117936] [2022-11-25 17:54:29,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:29,031 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:54:29,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:54:29,039 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:29,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:29,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:54:29,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:54:29,199 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:29,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:54:29,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:54:29,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525117936] [2022-11-25 17:54:29,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525117936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:29,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:29,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:54:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78306635] [2022-11-25 17:54:29,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:29,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:54:29,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:54:29,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:54:29,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:54:29,236 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242 [2022-11-25 17:54:29,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call 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:29,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:29,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242 [2022-11-25 17:54:29,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:30,006 INFO L130 PetriNetUnfolder]: 1616/2377 cut-off events. [2022-11-25 17:54:30,007 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-25 17:54:30,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4801 conditions, 2377 events. 1616/2377 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11039 event pairs, 1616 based on Foata normal form. 0/2022 useless extension candidates. Maximal degree in co-relation 4790. Up to 2368 conditions per place. [2022-11-25 17:54:30,030 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2022-11-25 17:54:30,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2022-11-25 17:54:30,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:54:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:54:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 252 transitions. [2022-11-25 17:54:30,045 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5206611570247934 [2022-11-25 17:54:30,046 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 252 transitions. [2022-11-25 17:54:30,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 252 transitions. [2022-11-25 17:54:30,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:30,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 252 transitions. [2022-11-25 17:54:30,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call 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:30,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call 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:30,060 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call 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:30,062 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 252 transitions. [2022-11-25 17:54:30,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2022-11-25 17:54:30,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:54:30,067 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2022-11-25 17:54:30,069 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-11-25 17:54:30,073 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2022-11-25 17:54:30,073 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2022-11-25 17:54:30,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call 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:30,074 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:30,074 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-11-25 17:54:30,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:30,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:30,289 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:54:30,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:30,289 INFO L85 PathProgramCache]: Analyzing trace with hash 586112, now seen corresponding path program 1 times [2022-11-25 17:54:30,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:54:30,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358446442] [2022-11-25 17:54:30,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:30,291 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:54:30,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:54:30,294 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:30,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:30,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:54:30,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:54:30,432 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:30,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:54:30,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:54:30,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358446442] [2022-11-25 17:54:30,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358446442] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:30,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:30,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:54:30,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006352009] [2022-11-25 17:54:30,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:30,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:54:30,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:54:30,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:54:30,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:54:30,440 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 242 [2022-11-25 17:54:30,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call 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:30,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:30,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 242 [2022-11-25 17:54:30,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:30,874 INFO L130 PetriNetUnfolder]: 1263/1942 cut-off events. [2022-11-25 17:54:30,874 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:54:30,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3851 conditions, 1942 events. 1263/1942 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9477 event pairs, 352 based on Foata normal form. 0/1781 useless extension candidates. Maximal degree in co-relation 3848. Up to 1510 conditions per place. [2022-11-25 17:54:30,885 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 35 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2022-11-25 17:54:30,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 170 flow [2022-11-25 17:54:30,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:54:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:54:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2022-11-25 17:54:30,889 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.509641873278237 [2022-11-25 17:54:30,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2022-11-25 17:54:30,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2022-11-25 17:54:30,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:30,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2022-11-25 17:54:30,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call 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:30,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call 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:30,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call 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:30,895 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 370 transitions. [2022-11-25 17:54:30,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 170 flow [2022-11-25 17:54:30,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:54:30,896 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2022-11-25 17:54:30,897 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-11-25 17:54:30,897 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2022-11-25 17:54:30,898 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2022-11-25 17:54:30,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call 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:30,898 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:30,898 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:30,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:54:31,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:31,110 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:54:31,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:31,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1094230025, now seen corresponding path program 1 times [2022-11-25 17:54:31,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:54:31,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051043199] [2022-11-25 17:54:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:31,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:54:31,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:54:31,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:31,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:31,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:54:31,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:54:31,300 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:31,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:54:31,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:54:31,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051043199] [2022-11-25 17:54:31,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051043199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:31,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:31,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:54:31,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529000394] [2022-11-25 17:54:31,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:31,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:54:31,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:54:31,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:54:31,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:54:31,327 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 242 [2022-11-25 17:54:31,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 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:54:31,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:31,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 242 [2022-11-25 17:54:31,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:31,714 INFO L130 PetriNetUnfolder]: 679/1108 cut-off events. [2022-11-25 17:54:31,714 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2022-11-25 17:54:31,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2345 conditions, 1108 events. 679/1108 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5242 event pairs, 130 based on Foata normal form. 80/1140 useless extension candidates. Maximal degree in co-relation 2341. Up to 752 conditions per place. [2022-11-25 17:54:31,720 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 31 selfloop transitions, 4 changer transitions 21/58 dead transitions. [2022-11-25 17:54:31,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 58 transitions, 248 flow [2022-11-25 17:54:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:54:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:54:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions. [2022-11-25 17:54:31,723 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4735537190082645 [2022-11-25 17:54:31,724 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 573 transitions. [2022-11-25 17:54:31,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 573 transitions. [2022-11-25 17:54:31,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:31,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 573 transitions. [2022-11-25 17:54:31,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call 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:31,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call 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:31,730 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call 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:31,730 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 573 transitions. [2022-11-25 17:54:31,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 58 transitions, 248 flow [2022-11-25 17:54:31,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 58 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:54:31,732 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 88 flow [2022-11-25 17:54:31,733 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-11-25 17:54:31,733 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-11-25 17:54:31,734 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 88 flow [2022-11-25 17:54:31,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 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:54:31,734 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:31,735 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:31,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:31,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:31,946 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:54:31,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash 535037212, now seen corresponding path program 1 times [2022-11-25 17:54:31,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:54:31,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274040549] [2022-11-25 17:54:31,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:31,948 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:54:31,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:54:31,949 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:31,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:54:32,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:54:32,158 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:32,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:54:32,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:54:32,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274040549] [2022-11-25 17:54:32,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274040549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:32,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:32,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:54:32,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101567020] [2022-11-25 17:54:32,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:32,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:54:32,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:54:32,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:54:32,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:54:32,190 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 242 [2022-11-25 17:54:32,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call 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:32,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:32,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 242 [2022-11-25 17:54:32,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:32,564 INFO L130 PetriNetUnfolder]: 274/502 cut-off events. [2022-11-25 17:54:32,565 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2022-11-25 17:54:32,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 502 events. 274/502 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2099 event pairs, 73 based on Foata normal form. 44/531 useless extension candidates. Maximal degree in co-relation 1329. Up to 157 conditions per place. [2022-11-25 17:54:32,568 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 40 selfloop transitions, 7 changer transitions 21/70 dead transitions. [2022-11-25 17:54:32,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 70 transitions, 356 flow [2022-11-25 17:54:32,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:54:32,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:54:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 688 transitions. [2022-11-25 17:54:32,571 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4738292011019284 [2022-11-25 17:54:32,571 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 688 transitions. [2022-11-25 17:54:32,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 688 transitions. [2022-11-25 17:54:32,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:32,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 688 transitions. [2022-11-25 17:54:32,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call 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:32,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call 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:32,578 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call 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:32,578 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 88 flow. Second operand 6 states and 688 transitions. [2022-11-25 17:54:32,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 70 transitions, 356 flow [2022-11-25 17:54:32,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 70 transitions, 350 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 17:54:32,582 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow [2022-11-25 17:54:32,583 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-11-25 17:54:32,583 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2022-11-25 17:54:32,584 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow [2022-11-25 17:54:32,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call 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:32,584 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:32,584 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:54:32,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:32,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:32,797 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:54:32,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:32,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1487337687, now seen corresponding path program 1 times [2022-11-25 17:54:32,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:54:32,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614673062] [2022-11-25 17:54:32,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:32,798 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:54:32,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:54:32,800 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:32,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:32,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:54:32,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:54:33,015 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:33,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:54:33,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:54:33,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614673062] [2022-11-25 17:54:33,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614673062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:33,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:33,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:54:33,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917538775] [2022-11-25 17:54:33,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:33,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:54:33,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:54:33,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:54:33,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:54:33,060 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 242 [2022-11-25 17:54:33,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:33,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:33,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 242 [2022-11-25 17:54:33,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:33,480 INFO L130 PetriNetUnfolder]: 168/313 cut-off events. [2022-11-25 17:54:33,480 INFO L131 PetriNetUnfolder]: For 301/301 co-relation queries the response was YES. [2022-11-25 17:54:33,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 313 events. 168/313 cut-off events. For 301/301 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1196 event pairs, 68 based on Foata normal form. 11/319 useless extension candidates. Maximal degree in co-relation 901. Up to 129 conditions per place. [2022-11-25 17:54:33,483 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 37 selfloop transitions, 10 changer transitions 11/60 dead transitions. [2022-11-25 17:54:33,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 350 flow [2022-11-25 17:54:33,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:54:33,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:54:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 781 transitions. [2022-11-25 17:54:33,486 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.461038961038961 [2022-11-25 17:54:33,486 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 781 transitions. [2022-11-25 17:54:33,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 781 transitions. [2022-11-25 17:54:33,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:33,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 781 transitions. [2022-11-25 17:54:33,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.57142857142857) internal successors, (781), 7 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call 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:33,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call 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:33,494 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call 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:33,494 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 7 states and 781 transitions. [2022-11-25 17:54:33,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 350 flow [2022-11-25 17:54:33,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 314 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-11-25 17:54:33,504 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow [2022-11-25 17:54:33,506 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2022-11-25 17:54:33,508 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2022-11-25 17:54:33,508 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow [2022-11-25 17:54:33,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:33,509 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:33,509 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:54:33,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:33,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:33,721 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:54:33,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:33,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2004398237, now seen corresponding path program 1 times [2022-11-25 17:54:33,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:54:33,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399811900] [2022-11-25 17:54:33,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:54:33,723 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:54:33,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:54:33,724 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:33,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:54:33,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-25 17:54:33,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:54:35,071 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:35,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:54:35,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:54:35,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399811900] [2022-11-25 17:54:35,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399811900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:35,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:35,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:54:35,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277138461] [2022-11-25 17:54:35,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:35,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:54:35,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:54:35,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:54:35,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:54:35,281 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 242 [2022-11-25 17:54:35,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 140 flow. Second operand has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call 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:35,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:35,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 242 [2022-11-25 17:54:35,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:35,935 INFO L130 PetriNetUnfolder]: 303/583 cut-off events. [2022-11-25 17:54:35,935 INFO L131 PetriNetUnfolder]: For 717/717 co-relation queries the response was YES. [2022-11-25 17:54:35,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1686 conditions, 583 events. 303/583 cut-off events. For 717/717 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2667 event pairs, 78 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 1676. Up to 220 conditions per place. [2022-11-25 17:54:35,940 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 79 selfloop transitions, 8 changer transitions 0/88 dead transitions. [2022-11-25 17:54:35,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 626 flow [2022-11-25 17:54:35,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:54:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:54:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 795 transitions. [2022-11-25 17:54:35,944 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4693034238488784 [2022-11-25 17:54:35,944 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 795 transitions. [2022-11-25 17:54:35,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 795 transitions. [2022-11-25 17:54:35,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:35,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 795 transitions. [2022-11-25 17:54:35,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.57142857142857) internal successors, (795), 7 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call 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:35,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call 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:35,951 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call 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:35,951 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 7 states and 795 transitions. [2022-11-25 17:54:35,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 626 flow [2022-11-25 17:54:35,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 88 transitions, 504 flow, removed 36 selfloop flow, removed 6 redundant places. [2022-11-25 17:54:35,957 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 146 flow [2022-11-25 17:54:35,957 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2022-11-25 17:54:35,958 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2022-11-25 17:54:35,958 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 146 flow [2022-11-25 17:54:35,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call 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:35,959 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:35,959 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:54:35,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:36,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:36,173 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:54:36,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:36,173 INFO L85 PathProgramCache]: Analyzing trace with hash 126544477, now seen corresponding path program 2 times [2022-11-25 17:54:36,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:54:36,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611305135] [2022-11-25 17:54:36,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:54:36,174 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:54:36,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:54:36,176 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:36,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:36,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:54:36,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:54:36,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:54:36,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:54:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:54:36,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:54:36,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:54:36,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611305135] [2022-11-25 17:54:36,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611305135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:36,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:36,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:54:36,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171851837] [2022-11-25 17:54:36,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:36,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:54:36,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:54:36,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:54:36,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:54:36,444 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242 [2022-11-25 17:54:36,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call 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:36,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:36,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242 [2022-11-25 17:54:36,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:36,767 INFO L130 PetriNetUnfolder]: 506/956 cut-off events. [2022-11-25 17:54:36,767 INFO L131 PetriNetUnfolder]: For 815/819 co-relation queries the response was YES. [2022-11-25 17:54:36,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 956 events. 506/956 cut-off events. For 815/819 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5009 event pairs, 137 based on Foata normal form. 3/944 useless extension candidates. Maximal degree in co-relation 2863. Up to 422 conditions per place. [2022-11-25 17:54:36,775 INFO L137 encePairwiseOnDemand]: 238/242 looper letters, 64 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2022-11-25 17:54:36,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 423 flow [2022-11-25 17:54:36,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:54:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:54:36,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2022-11-25 17:54:36,778 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49173553719008267 [2022-11-25 17:54:36,778 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2022-11-25 17:54:36,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2022-11-25 17:54:36,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:36,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2022-11-25 17:54:36,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call 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:36,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call 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:36,783 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call 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:36,783 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 146 flow. Second operand 4 states and 476 transitions. [2022-11-25 17:54:36,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 423 flow [2022-11-25 17:54:36,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:54:36,794 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 159 flow [2022-11-25 17:54:36,794 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2022-11-25 17:54:36,795 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2022-11-25 17:54:36,795 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 159 flow [2022-11-25 17:54:36,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call 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:36,795 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:36,796 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:54:36,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:54:37,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:37,010 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:54:37,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:37,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1170373391, now seen corresponding path program 3 times [2022-11-25 17:54:37,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:54:37,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741008342] [2022-11-25 17:54:37,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:54:37,011 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:54:37,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:54:37,016 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:37,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:37,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 17:54:37,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:54:37,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 17:54:37,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:54:37,294 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:37,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:54:37,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:54:37,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741008342] [2022-11-25 17:54:37,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741008342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:37,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:37,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:54:37,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624541577] [2022-11-25 17:54:37,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:37,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:54:37,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:54:37,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:54:37,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:54:37,313 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 242 [2022-11-25 17:54:37,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 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:54:37,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:37,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 242 [2022-11-25 17:54:37,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:37,679 INFO L130 PetriNetUnfolder]: 634/1214 cut-off events. [2022-11-25 17:54:37,680 INFO L131 PetriNetUnfolder]: For 1303/1303 co-relation queries the response was YES. [2022-11-25 17:54:37,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3849 conditions, 1214 events. 634/1214 cut-off events. For 1303/1303 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6757 event pairs, 144 based on Foata normal form. 1/1214 useless extension candidates. Maximal degree in co-relation 3838. Up to 625 conditions per place. [2022-11-25 17:54:37,690 INFO L137 encePairwiseOnDemand]: 237/242 looper letters, 58 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2022-11-25 17:54:37,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 413 flow [2022-11-25 17:54:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:54:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 17:54:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2022-11-25 17:54:37,693 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.496900826446281 [2022-11-25 17:54:37,693 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2022-11-25 17:54:37,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2022-11-25 17:54:37,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:37,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2022-11-25 17:54:37,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call 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:37,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call 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:37,698 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call 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:37,698 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 159 flow. Second operand 4 states and 481 transitions. [2022-11-25 17:54:37,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 413 flow [2022-11-25 17:54:37,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:54:37,708 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 199 flow [2022-11-25 17:54:37,708 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2022-11-25 17:54:37,709 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2022-11-25 17:54:37,709 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 199 flow [2022-11-25 17:54:37,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 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:54:37,710 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:37,710 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:54:37,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:37,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:37,924 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:54:37,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:37,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1168803483, now seen corresponding path program 4 times [2022-11-25 17:54:37,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:54:37,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280721964] [2022-11-25 17:54:37,925 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:54:37,925 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:54:37,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:54:37,927 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:37,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:38,103 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:54:38,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:54:38,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 17:54:38,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:54:38,399 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:38,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:54:38,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:54:38,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280721964] [2022-11-25 17:54:38,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280721964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:54:38,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:54:38,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:54:38,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76364161] [2022-11-25 17:54:38,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:54:38,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:54:38,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:54:38,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:54:38,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:54:38,453 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 242 [2022-11-25 17:54:38,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 199 flow. Second operand has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:38,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:54:38,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 242 [2022-11-25 17:54:38,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:54:39,153 INFO L130 PetriNetUnfolder]: 780/1564 cut-off events. [2022-11-25 17:54:39,153 INFO L131 PetriNetUnfolder]: For 2244/2244 co-relation queries the response was YES. [2022-11-25 17:54:39,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5236 conditions, 1564 events. 780/1564 cut-off events. For 2244/2244 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9733 event pairs, 163 based on Foata normal form. 1/1565 useless extension candidates. Maximal degree in co-relation 5223. Up to 610 conditions per place. [2022-11-25 17:54:39,167 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 89 selfloop transitions, 14 changer transitions 0/104 dead transitions. [2022-11-25 17:54:39,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 104 transitions, 695 flow [2022-11-25 17:54:39,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:54:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:54:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 798 transitions. [2022-11-25 17:54:39,171 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47107438016528924 [2022-11-25 17:54:39,171 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 798 transitions. [2022-11-25 17:54:39,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 798 transitions. [2022-11-25 17:54:39,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:54:39,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 798 transitions. [2022-11-25 17:54:39,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call 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:39,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call 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:39,179 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call 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:39,179 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 199 flow. Second operand 7 states and 798 transitions. [2022-11-25 17:54:39,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 104 transitions, 695 flow [2022-11-25 17:54:39,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 104 transitions, 690 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:54:39,197 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 272 flow [2022-11-25 17:54:39,197 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=272, PETRI_PLACES=60, PETRI_TRANSITIONS=44} [2022-11-25 17:54:39,198 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2022-11-25 17:54:39,199 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 272 flow [2022-11-25 17:54:39,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:54:39,199 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:54:39,199 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:54:39,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:39,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:39,422 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:54:39,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:54:39,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1488995259, now seen corresponding path program 5 times [2022-11-25 17:54:39,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:54:39,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569820467] [2022-11-25 17:54:39,423 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:54:39,424 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:54:39,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:54:39,425 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:39,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:39,631 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:54:39,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 17:54:39,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:54:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:54:39,795 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 17:54:39,795 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:54:39,796 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-25 17:54:39,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-25 17:54:39,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-25 17:54:39,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-25 17:54:39,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-25 17:54:39,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-25 17:54:39,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-25 17:54:39,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-25 17:54:39,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-25 17:54:39,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-25 17:54:39,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-25 17:54:39,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-25 17:54:39,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-25 17:54:39,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:40,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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:54:40,009 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2022-11-25 17:54:40,014 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:54:40,014 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:54:40,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:54:40 BasicIcfg [2022-11-25 17:54:40,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:54:40,112 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:54:40,112 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:54:40,112 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:54:40,112 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:15" (3/4) ... [2022-11-25 17:54:40,115 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:54:40,115 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:54:40,116 INFO L158 Benchmark]: Toolchain (without parser) took 26217.88ms. Allocated memory was 73.4MB in the beginning and 163.6MB in the end (delta: 90.2MB). Free memory was 49.2MB in the beginning and 106.5MB in the end (delta: -57.3MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2022-11-25 17:54:40,116 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 73.4MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:54:40,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 654.07ms. Allocated memory is still 73.4MB. Free memory was 49.0MB in the beginning and 38.6MB in the end (delta: 10.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 17:54:40,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.70ms. Allocated memory is still 73.4MB. Free memory was 38.6MB in the beginning and 35.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:54:40,118 INFO L158 Benchmark]: Boogie Preprocessor took 37.25ms. Allocated memory is still 73.4MB. Free memory was 35.7MB in the beginning and 33.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:54:40,118 INFO L158 Benchmark]: RCFGBuilder took 1196.63ms. Allocated memory was 73.4MB in the beginning and 94.4MB in the end (delta: 21.0MB). Free memory was 33.3MB in the beginning and 43.2MB in the end (delta: -9.9MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2022-11-25 17:54:40,119 INFO L158 Benchmark]: TraceAbstraction took 24260.68ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 42.2MB in the beginning and 106.5MB in the end (delta: -64.3MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2022-11-25 17:54:40,119 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 163.6MB. Free memory is still 106.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:54:40,121 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 73.4MB. Free memory is still 50.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 654.07ms. Allocated memory is still 73.4MB. Free memory was 49.0MB in the beginning and 38.6MB in the end (delta: 10.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.70ms. Allocated memory is still 73.4MB. Free memory was 38.6MB in the beginning and 35.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.25ms. Allocated memory is still 73.4MB. Free memory was 35.7MB in the beginning and 33.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1196.63ms. Allocated memory was 73.4MB in the beginning and 94.4MB in the end (delta: 21.0MB). Free memory was 33.3MB in the beginning and 43.2MB in the end (delta: -9.9MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * TraceAbstraction took 24260.68ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 42.2MB in the beginning and 106.5MB in the end (delta: -64.3MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 163.6MB. Free memory is still 106.5MB. 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: 12.8s, 131 PlacesBefore, 41 PlacesAfterwards, 123 TransitionsBefore, 32 TransitionsAfterwards, 2320 CoEnabledTransitionPairs, 8 FixpointIterations, 45 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 6687 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3205, independent: 3001, independent conditional: 0, independent unconditional: 3001, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1630, independent: 1564, independent conditional: 0, independent unconditional: 1564, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1630, independent: 1533, independent conditional: 0, independent unconditional: 1533, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 97, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 646, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 579, dependent conditional: 0, dependent unconditional: 579, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3205, independent: 1437, independent conditional: 0, independent unconditional: 1437, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 1630, unknown conditional: 0, unknown unconditional: 1630] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1849; [L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849, ((void *)0), P0, ((void *)0))=-1, t1849={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1850; [L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1850, ((void *)0), P1, ((void *)0))=0, t1849={3:0}, t1850={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L850] 0 pthread_t t1851; [L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1851, ((void *)0), P2, ((void *)0))=1, t1849={3:0}, t1850={7:0}, t1851={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] 3 y$mem_tmp = y [L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = y [L804] 3 y = y$flush_delayed ? y$mem_tmp : y [L805] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 y$flush_delayed = weak$$choice2 [L811] 3 y$mem_tmp = y [L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EBX = y [L820] 3 y = y$flush_delayed ? y$mem_tmp : y [L821] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={3:0}, t1850={7:0}, t1851={11:0}, weak$$choice0=4, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: 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: 851]: 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: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 359 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 298 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1413 IncrementalHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 23 mSDtfsCounter, 1413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=9, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 935 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1223 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 17:54:40,161 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e1c9494-609e-47c4-8437-868cbb5be021/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