./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe016_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe016_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b69d29db6700923687b32c5d8fab6e8f05fe2198d87348098263d957793e472 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 13:52:33,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:52:33,547 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:52:33,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:52:33,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:52:33,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:52:33,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:52:33,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:52:33,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:52:33,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:52:33,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:52:33,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:52:33,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:52:33,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:52:33,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:52:33,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:52:33,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:52:33,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:52:33,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:52:33,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:52:33,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:52:33,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:52:33,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:52:33,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:52:33,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:52:33,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:52:33,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:52:33,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:52:33,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:52:33,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:52:33,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:52:33,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:52:33,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:52:33,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:52:33,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:52:33,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:52:33,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:52:33,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:52:33,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:52:33,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:52:33,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:52:33,605 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 13:52:33,636 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:52:33,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:52:33,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:52:33,637 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:52:33,637 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:52:33,638 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:52:33,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:52:33,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:52:33,639 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:52:33,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:52:33,639 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:52:33,639 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:52:33,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:52:33,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:52:33,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:52:33,640 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 13:52:33,640 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 13:52:33,640 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 13:52:33,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:52:33,641 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 13:52:33,641 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:52:33,641 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:52:33,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:52:33,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:52:33,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:52:33,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:52:33,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:52:33,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:52:33,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:52:33,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:52:33,643 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:52:33,643 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:52:33,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:52:33,643 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:52:33,643 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_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b69d29db6700923687b32c5d8fab6e8f05fe2198d87348098263d957793e472 [2022-12-13 13:52:33,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:52:33,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:52:33,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:52:33,849 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:52:33,850 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:52:33,851 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe016_power.opt.i [2022-12-13 13:52:36,336 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:52:36,550 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:52:36,550 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/sv-benchmarks/c/pthread-wmm/safe016_power.opt.i [2022-12-13 13:52:36,562 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/data/81914965d/cb71a5ebc0aa439c8f04534571195023/FLAGdb4ed032a [2022-12-13 13:52:36,913 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/data/81914965d/cb71a5ebc0aa439c8f04534571195023 [2022-12-13 13:52:36,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:52:36,917 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:52:36,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:52:36,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:52:36,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:52:36,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:52:36" (1/1) ... [2022-12-13 13:52:36,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@680cb5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:52:36, skipping insertion in model container [2022-12-13 13:52:36,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:52:36" (1/1) ... [2022-12-13 13:52:36,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:52:36,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:52:37,076 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_57def950-6891-4320-9380-06041b2d4b53/sv-benchmarks/c/pthread-wmm/safe016_power.opt.i[951,964] [2022-12-13 13:52:37,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,220 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:52:37,239 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:52:37,247 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_57def950-6891-4320-9380-06041b2d4b53/sv-benchmarks/c/pthread-wmm/safe016_power.opt.i[951,964] [2022-12-13 13:52:37,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,267 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,279 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:52:37,290 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:52:37,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:52:37,334 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:52:37,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:52:37 WrapperNode [2022-12-13 13:52:37,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:52:37,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:52:37,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:52:37,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:52:37,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:52:37" (1/1) ... [2022-12-13 13:52:37,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:52:37" (1/1) ... [2022-12-13 13:52:37,371 INFO L138 Inliner]: procedures = 177, calls = 91, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 181 [2022-12-13 13:52:37,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:52:37,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:52:37,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:52:37,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:52:37,379 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:52:37" (1/1) ... [2022-12-13 13:52:37,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:52:37" (1/1) ... [2022-12-13 13:52:37,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:52:37" (1/1) ... [2022-12-13 13:52:37,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:52:37" (1/1) ... [2022-12-13 13:52:37,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:52:37" (1/1) ... [2022-12-13 13:52:37,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:52:37" (1/1) ... [2022-12-13 13:52:37,394 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:52:37" (1/1) ... [2022-12-13 13:52:37,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:52:37" (1/1) ... [2022-12-13 13:52:37,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:52:37,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:52:37,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:52:37,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:52:37,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:52:37" (1/1) ... [2022-12-13 13:52:37,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:52:37,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:52:37,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:52:37,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:52:37,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:52:37,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:52:37,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:52:37,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:52:37,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:52:37,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:52:37,450 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 13:52:37,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 13:52:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 13:52:37,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 13:52:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 13:52:37,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 13:52:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 13:52:37,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 13:52:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:52:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:52:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:52:37,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:52:37,453 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 13:52:37,576 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:52:37,577 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:52:38,026 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:52:38,645 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:52:38,645 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 13:52:38,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:52:38 BoogieIcfgContainer [2022-12-13 13:52:38,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:52:38,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:52:38,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:52:38,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:52:38,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:52:36" (1/3) ... [2022-12-13 13:52:38,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c40ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:52:38, skipping insertion in model container [2022-12-13 13:52:38,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:52:37" (2/3) ... [2022-12-13 13:52:38,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c40ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:52:38, skipping insertion in model container [2022-12-13 13:52:38,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:52:38" (3/3) ... [2022-12-13 13:52:38,655 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_power.opt.i [2022-12-13 13:52:38,669 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:52:38,669 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-12-13 13:52:38,669 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:52:38,818 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 13:52:38,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 217 transitions, 454 flow [2022-12-13 13:52:38,943 INFO L130 PetriNetUnfolder]: 2/213 cut-off events. [2022-12-13 13:52:38,943 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:52:38,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 213 events. 2/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 372 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 151. Up to 2 conditions per place. [2022-12-13 13:52:38,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 228 places, 217 transitions, 454 flow [2022-12-13 13:52:38,956 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 224 places, 213 transitions, 438 flow [2022-12-13 13:52:38,960 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 13:52:38,968 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 213 transitions, 438 flow [2022-12-13 13:52:38,971 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 224 places, 213 transitions, 438 flow [2022-12-13 13:52:38,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 224 places, 213 transitions, 438 flow [2022-12-13 13:52:39,010 INFO L130 PetriNetUnfolder]: 2/213 cut-off events. [2022-12-13 13:52:39,010 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:52:39,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 213 events. 2/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 374 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 151. Up to 2 conditions per place. [2022-12-13 13:52:39,014 INFO L119 LiptonReduction]: Number of co-enabled transitions 11266 [2022-12-13 13:52:50,251 WARN L233 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 231 DAG size of output: 229 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 13:53:08,865 INFO L134 LiptonReduction]: Checked pairs total: 70395 [2022-12-13 13:53:08,865 INFO L136 LiptonReduction]: Total number of compositions: 167 [2022-12-13 13:53:08,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:53:08,878 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;@7642eb2b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:53:08,878 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-12-13 13:53:08,879 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 13:53:08,880 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:53:08,880 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:53:08,880 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 13:53:08,880 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 13:53:08,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:53:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1437, now seen corresponding path program 1 times [2022-12-13 13:53:08,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:53:08,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799572630] [2022-12-13 13:53:08,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:53:08,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:53:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:53:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:53:08,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:53:08,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799572630] [2022-12-13 13:53:08,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799572630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:53:08,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:53:08,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 13:53:08,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299576403] [2022-12-13 13:53:08,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:53:08,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 13:53:08,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:53:09,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 13:53:09,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 13:53:09,003 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 384 [2022-12-13 13:53:09,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 98 transitions, 208 flow. Second operand has 2 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:53:09,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:53:09,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 384 [2022-12-13 13:53:09,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:54:16,165 INFO L130 PetriNetUnfolder]: 407288/525156 cut-off events. [2022-12-13 13:54:16,166 INFO L131 PetriNetUnfolder]: For 809/809 co-relation queries the response was YES. [2022-12-13 13:54:16,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1051293 conditions, 525156 events. 407288/525156 cut-off events. For 809/809 co-relation queries the response was YES. Maximal size of possible extension queue 30993. Compared 3841529 event pairs, 407288 based on Foata normal form. 0/204637 useless extension candidates. Maximal degree in co-relation 1051281. Up to 524354 conditions per place. [2022-12-13 13:54:18,664 INFO L137 encePairwiseOnDemand]: 351/384 looper letters, 59 selfloop transitions, 0 changer transitions 0/64 dead transitions. [2022-12-13 13:54:18,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 64 transitions, 258 flow [2022-12-13 13:54:18,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 13:54:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 13:54:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 398 transitions. [2022-12-13 13:54:18,676 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5182291666666666 [2022-12-13 13:54:18,677 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 398 transitions. [2022-12-13 13:54:18,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 398 transitions. [2022-12-13 13:54:18,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:54:18,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 398 transitions. [2022-12-13 13:54:18,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 199.0) internal successors, (398), 2 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:54:18,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 384.0) internal successors, (1152), 3 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:54:18,689 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 384.0) internal successors, (1152), 3 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:54:18,691 INFO L175 Difference]: Start difference. First operand has 110 places, 98 transitions, 208 flow. Second operand 2 states and 398 transitions. [2022-12-13 13:54:18,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 64 transitions, 258 flow [2022-12-13 13:54:18,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 64 transitions, 254 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 13:54:18,839 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 136 flow [2022-12-13 13:54:18,841 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=136, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2022-12-13 13:54:18,844 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -36 predicate places. [2022-12-13 13:54:18,844 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 136 flow [2022-12-13 13:54:18,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:54:18,844 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:54:18,844 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 13:54:18,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:54:18,845 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 13:54:18,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:54:18,845 INFO L85 PathProgramCache]: Analyzing trace with hash 44098148, now seen corresponding path program 1 times [2022-12-13 13:54:18,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:54:18,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123692706] [2022-12-13 13:54:18,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:54:18,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:54:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:54:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:54:18,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:54:18,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123692706] [2022-12-13 13:54:18,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123692706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:54:18,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:54:18,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:54:18,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036526563] [2022-12-13 13:54:18,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:54:18,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:54:18,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:54:18,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:54:18,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:54:19,037 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 384 [2022-12-13 13:54:19,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:54:19,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:54:19,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 384 [2022-12-13 13:54:19,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:55:02,416 INFO L130 PetriNetUnfolder]: 289855/390884 cut-off events. [2022-12-13 13:55:02,417 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:55:02,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 779227 conditions, 390884 events. 289855/390884 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19776. Compared 2985210 event pairs, 166730 based on Foata normal form. 0/204712 useless extension candidates. Maximal degree in co-relation 779224. Up to 210482 conditions per place. [2022-12-13 13:55:04,248 INFO L137 encePairwiseOnDemand]: 357/384 looper letters, 72 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2022-12-13 13:55:04,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 354 flow [2022-12-13 13:55:04,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:55:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:55:04,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2022-12-13 13:55:04,254 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4609375 [2022-12-13 13:55:04,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 531 transitions. [2022-12-13 13:55:04,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions. [2022-12-13 13:55:04,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:55:04,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions. [2022-12-13 13:55:04,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:04,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:04,258 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:04,259 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 136 flow. Second operand 3 states and 531 transitions. [2022-12-13 13:55:04,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 354 flow [2022-12-13 13:55:04,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 88 transitions, 354 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 13:55:04,260 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 248 flow [2022-12-13 13:55:04,261 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2022-12-13 13:55:04,261 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -35 predicate places. [2022-12-13 13:55:04,261 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 248 flow [2022-12-13 13:55:04,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:04,262 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:55:04,262 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 13:55:04,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:55:04,262 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 13:55:04,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:55:04,263 INFO L85 PathProgramCache]: Analyzing trace with hash 44098149, now seen corresponding path program 1 times [2022-12-13 13:55:04,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:55:04,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225250252] [2022-12-13 13:55:04,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:55:04,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:55:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:55:04,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:55:04,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225250252] [2022-12-13 13:55:04,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225250252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:55:04,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:55:04,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:55:04,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265744652] [2022-12-13 13:55:04,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:55:04,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:55:04,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:55:04,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:55:04,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:55:04,388 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 384 [2022-12-13 13:55:04,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:04,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:55:04,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 384 [2022-12-13 13:55:04,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:55:15,560 INFO L130 PetriNetUnfolder]: 62426/87843 cut-off events. [2022-12-13 13:55:15,560 INFO L131 PetriNetUnfolder]: For 29534/30107 co-relation queries the response was YES. [2022-12-13 13:55:15,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254034 conditions, 87843 events. 62426/87843 cut-off events. For 29534/30107 co-relation queries the response was YES. Maximal size of possible extension queue 4972. Compared 632808 event pairs, 43789 based on Foata normal form. 25060/99763 useless extension candidates. Maximal degree in co-relation 254029. Up to 83112 conditions per place. [2022-12-13 13:55:15,951 INFO L137 encePairwiseOnDemand]: 369/384 looper letters, 52 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2022-12-13 13:55:15,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 326 flow [2022-12-13 13:55:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:55:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:55:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2022-12-13 13:55:15,953 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4401041666666667 [2022-12-13 13:55:15,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 507 transitions. [2022-12-13 13:55:15,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions. [2022-12-13 13:55:15,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:55:15,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions. [2022-12-13 13:55:15,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:15,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:15,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:15,957 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 248 flow. Second operand 3 states and 507 transitions. [2022-12-13 13:55:15,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 326 flow [2022-12-13 13:55:16,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:55:16,236 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 196 flow [2022-12-13 13:55:16,237 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2022-12-13 13:55:16,237 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -49 predicate places. [2022-12-13 13:55:16,237 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 196 flow [2022-12-13 13:55:16,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:16,238 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:55:16,238 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:55:16,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:55:16,238 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 13:55:16,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:55:16,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1431609550, now seen corresponding path program 1 times [2022-12-13 13:55:16,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:55:16,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626152729] [2022-12-13 13:55:16,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:55:16,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:55:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:55:16,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:55:16,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626152729] [2022-12-13 13:55:16,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626152729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:55:16,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:55:16,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:55:16,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827721263] [2022-12-13 13:55:16,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:55:16,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:55:16,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:55:16,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:55:16,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:55:16,786 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 384 [2022-12-13 13:55:16,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 155.25) internal successors, (621), 4 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:16,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:55:16,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 384 [2022-12-13 13:55:16,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:55:27,995 INFO L130 PetriNetUnfolder]: 62095/87457 cut-off events. [2022-12-13 13:55:27,995 INFO L131 PetriNetUnfolder]: For 11327/11842 co-relation queries the response was YES. [2022-12-13 13:55:28,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232651 conditions, 87457 events. 62095/87457 cut-off events. For 11327/11842 co-relation queries the response was YES. Maximal size of possible extension queue 4982. Compared 631262 event pairs, 33218 based on Foata normal form. 0/62821 useless extension candidates. Maximal degree in co-relation 232646. Up to 73749 conditions per place. [2022-12-13 13:55:28,416 INFO L137 encePairwiseOnDemand]: 381/384 looper letters, 95 selfloop transitions, 2 changer transitions 0/102 dead transitions. [2022-12-13 13:55:28,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 102 transitions, 538 flow [2022-12-13 13:55:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:55:28,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:55:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2022-12-13 13:55:28,418 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4644097222222222 [2022-12-13 13:55:28,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2022-12-13 13:55:28,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2022-12-13 13:55:28,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:55:28,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2022-12-13 13:55:28,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:28,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:28,421 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:28,421 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 196 flow. Second operand 3 states and 535 transitions. [2022-12-13 13:55:28,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 102 transitions, 538 flow [2022-12-13 13:55:28,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 102 transitions, 537 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:55:28,426 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 203 flow [2022-12-13 13:55:28,426 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2022-12-13 13:55:28,427 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -47 predicate places. [2022-12-13 13:55:28,427 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 203 flow [2022-12-13 13:55:28,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.25) internal successors, (621), 4 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:28,427 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:55:28,427 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:55:28,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:55:28,428 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 13:55:28,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:55:28,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1431609898, now seen corresponding path program 1 times [2022-12-13 13:55:28,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:55:28,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155887721] [2022-12-13 13:55:28,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:55:28,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:55:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:55:28,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:55:28,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155887721] [2022-12-13 13:55:28,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155887721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:55:28,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:55:28,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:55:28,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592193878] [2022-12-13 13:55:28,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:55:28,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:55:28,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:55:28,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:55:28,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:55:28,519 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 384 [2022-12-13 13:55:28,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:28,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:55:28,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 384 [2022-12-13 13:55:28,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:55:39,540 INFO L130 PetriNetUnfolder]: 61754/87030 cut-off events. [2022-12-13 13:55:39,540 INFO L131 PetriNetUnfolder]: For 14328/14881 co-relation queries the response was YES. [2022-12-13 13:55:39,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237779 conditions, 87030 events. 61754/87030 cut-off events. For 14328/14881 co-relation queries the response was YES. Maximal size of possible extension queue 4988. Compared 629336 event pairs, 30406 based on Foata normal form. 0/62785 useless extension candidates. Maximal degree in co-relation 237773. Up to 62954 conditions per place. [2022-12-13 13:55:39,987 INFO L137 encePairwiseOnDemand]: 380/384 looper letters, 85 selfloop transitions, 3 changer transitions 0/93 dead transitions. [2022-12-13 13:55:39,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 93 transitions, 504 flow [2022-12-13 13:55:39,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:55:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:55:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2022-12-13 13:55:39,989 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-13 13:55:39,989 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2022-12-13 13:55:39,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2022-12-13 13:55:39,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:55:39,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2022-12-13 13:55:39,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:39,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:39,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:39,993 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 203 flow. Second operand 3 states and 528 transitions. [2022-12-13 13:55:39,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 93 transitions, 504 flow [2022-12-13 13:55:39,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:55:39,997 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 212 flow [2022-12-13 13:55:39,998 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2022-12-13 13:55:39,998 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -46 predicate places. [2022-12-13 13:55:39,998 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 212 flow [2022-12-13 13:55:39,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:39,999 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:55:39,999 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:55:39,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:55:39,999 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 13:55:39,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:55:40,000 INFO L85 PathProgramCache]: Analyzing trace with hash 155654705, now seen corresponding path program 1 times [2022-12-13 13:55:40,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:55:40,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108608000] [2022-12-13 13:55:40,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:55:40,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:55:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:55:40,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:55:40,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108608000] [2022-12-13 13:55:40,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108608000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:55:40,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:55:40,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:55:40,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421462958] [2022-12-13 13:55:40,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:55:40,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:55:40,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:55:40,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:55:40,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:55:40,297 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 384 [2022-12-13 13:55:40,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 151.5) internal successors, (606), 4 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:40,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:55:40,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 384 [2022-12-13 13:55:40,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:55:55,859 INFO L130 PetriNetUnfolder]: 84523/117172 cut-off events. [2022-12-13 13:55:55,859 INFO L131 PetriNetUnfolder]: For 24832/25362 co-relation queries the response was YES. [2022-12-13 13:55:56,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328970 conditions, 117172 events. 84523/117172 cut-off events. For 24832/25362 co-relation queries the response was YES. Maximal size of possible extension queue 5373. Compared 819570 event pairs, 31782 based on Foata normal form. 129/88478 useless extension candidates. Maximal degree in co-relation 328963. Up to 93518 conditions per place. [2022-12-13 13:55:56,409 INFO L137 encePairwiseOnDemand]: 379/384 looper letters, 113 selfloop transitions, 7 changer transitions 0/124 dead transitions. [2022-12-13 13:55:56,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 124 transitions, 700 flow [2022-12-13 13:55:56,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:55:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:55:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 687 transitions. [2022-12-13 13:55:56,413 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.447265625 [2022-12-13 13:55:56,413 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 687 transitions. [2022-12-13 13:55:56,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 687 transitions. [2022-12-13 13:55:56,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:55:56,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 687 transitions. [2022-12-13 13:55:56,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:56,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 384.0) internal successors, (1920), 5 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:56,420 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 384.0) internal successors, (1920), 5 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:56,420 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 212 flow. Second operand 4 states and 687 transitions. [2022-12-13 13:55:56,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 124 transitions, 700 flow [2022-12-13 13:55:56,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 124 transitions, 686 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:55:56,464 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 265 flow [2022-12-13 13:55:56,464 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=265, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2022-12-13 13:55:56,464 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -43 predicate places. [2022-12-13 13:55:56,465 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 265 flow [2022-12-13 13:55:56,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.5) internal successors, (606), 4 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:56,465 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:55:56,465 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:55:56,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:55:56,466 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 13:55:56,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:55:56,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1430224161, now seen corresponding path program 1 times [2022-12-13 13:55:56,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:55:56,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886422731] [2022-12-13 13:55:56,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:55:56,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:55:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:55:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:55:56,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:55:56,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886422731] [2022-12-13 13:55:56,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886422731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:55:56,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:55:56,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:55:56,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270827612] [2022-12-13 13:55:56,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:55:56,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:55:56,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:55:56,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:55:56,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:55:56,758 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 384 [2022-12-13 13:55:56,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 265 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:55:56,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:55:56,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 384 [2022-12-13 13:55:56,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:56:12,709 INFO L130 PetriNetUnfolder]: 82039/117027 cut-off events. [2022-12-13 13:56:12,709 INFO L131 PetriNetUnfolder]: For 32125/32125 co-relation queries the response was YES. [2022-12-13 13:56:12,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344969 conditions, 117027 events. 82039/117027 cut-off events. For 32125/32125 co-relation queries the response was YES. Maximal size of possible extension queue 6697. Compared 889447 event pairs, 31019 based on Foata normal form. 0/91021 useless extension candidates. Maximal degree in co-relation 344960. Up to 59277 conditions per place. [2022-12-13 13:56:13,272 INFO L137 encePairwiseOnDemand]: 370/384 looper letters, 69 selfloop transitions, 23 changer transitions 0/94 dead transitions. [2022-12-13 13:56:13,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 94 transitions, 555 flow [2022-12-13 13:56:13,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:56:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:56:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 795 transitions. [2022-12-13 13:56:13,275 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4140625 [2022-12-13 13:56:13,275 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 795 transitions. [2022-12-13 13:56:13,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 795 transitions. [2022-12-13 13:56:13,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:56:13,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 795 transitions. [2022-12-13 13:56:13,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.0) internal successors, (795), 5 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-12-13 13:56:13,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 384.0) internal successors, (2304), 6 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:56:13,279 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 384.0) internal successors, (2304), 6 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:56:13,279 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 265 flow. Second operand 5 states and 795 transitions. [2022-12-13 13:56:13,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 94 transitions, 555 flow [2022-12-13 13:56:13,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 94 transitions, 555 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 13:56:13,287 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 327 flow [2022-12-13 13:56:13,287 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=327, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2022-12-13 13:56:13,288 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -40 predicate places. [2022-12-13 13:56:13,288 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 327 flow [2022-12-13 13:56:13,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:56:13,288 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:56:13,289 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:56:13,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:56:13,289 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 13:56:13,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:56:13,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1430224160, now seen corresponding path program 1 times [2022-12-13 13:56:13,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:56:13,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023272163] [2022-12-13 13:56:13,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:56:13,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:56:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:56:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:56:13,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:56:13,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023272163] [2022-12-13 13:56:13,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023272163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:56:13,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:56:13,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:56:13,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490425538] [2022-12-13 13:56:13,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:56:13,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:56:13,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:56:13,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:56:13,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:56:13,854 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 384 [2022-12-13 13:56:13,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 327 flow. Second operand has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:56:13,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:56:13,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 384 [2022-12-13 13:56:13,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:56:29,482 INFO L130 PetriNetUnfolder]: 80800/115225 cut-off events. [2022-12-13 13:56:29,483 INFO L131 PetriNetUnfolder]: For 67420/68195 co-relation queries the response was YES. [2022-12-13 13:56:29,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368398 conditions, 115225 events. 80800/115225 cut-off events. For 67420/68195 co-relation queries the response was YES. Maximal size of possible extension queue 6797. Compared 884029 event pairs, 36516 based on Foata normal form. 234/99930 useless extension candidates. Maximal degree in co-relation 368388. Up to 76263 conditions per place. [2022-12-13 13:56:30,157 INFO L137 encePairwiseOnDemand]: 381/384 looper letters, 88 selfloop transitions, 7 changer transitions 0/100 dead transitions. [2022-12-13 13:56:30,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 652 flow [2022-12-13 13:56:30,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:56:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:56:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 665 transitions. [2022-12-13 13:56:30,160 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4329427083333333 [2022-12-13 13:56:30,160 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 665 transitions. [2022-12-13 13:56:30,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 665 transitions. [2022-12-13 13:56:30,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:56:30,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 665 transitions. [2022-12-13 13:56:30,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:56:30,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 384.0) internal successors, (1920), 5 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:56:30,163 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 384.0) internal successors, (1920), 5 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:56:30,163 INFO L175 Difference]: Start difference. First operand has 70 places, 68 transitions, 327 flow. Second operand 4 states and 665 transitions. [2022-12-13 13:56:30,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 652 flow [2022-12-13 13:56:30,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:56:30,172 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 329 flow [2022-12-13 13:56:30,173 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=329, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2022-12-13 13:56:30,173 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -40 predicate places. [2022-12-13 13:56:30,173 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 329 flow [2022-12-13 13:56:30,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:56:30,174 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:56:30,174 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:56:30,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:56:30,175 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 13:56:30,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:56:30,175 INFO L85 PathProgramCache]: Analyzing trace with hash 68770874, now seen corresponding path program 1 times [2022-12-13 13:56:30,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:56:30,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691487299] [2022-12-13 13:56:30,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:56:30,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:56:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:56:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:56:30,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:56:30,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691487299] [2022-12-13 13:56:30,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691487299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:56:30,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:56:30,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:56:30,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039937719] [2022-12-13 13:56:30,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:56:30,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:56:30,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:56:30,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:56:30,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:56:30,481 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 384 [2022-12-13 13:56:30,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:56:30,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:56:30,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 384 [2022-12-13 13:56:30,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:56:47,501 INFO L130 PetriNetUnfolder]: 94267/131997 cut-off events. [2022-12-13 13:56:47,502 INFO L131 PetriNetUnfolder]: For 99942/101320 co-relation queries the response was YES. [2022-12-13 13:56:47,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418642 conditions, 131997 events. 94267/131997 cut-off events. For 99942/101320 co-relation queries the response was YES. Maximal size of possible extension queue 6519. Compared 971921 event pairs, 25548 based on Foata normal form. 316/114650 useless extension candidates. Maximal degree in co-relation 418633. Up to 122036 conditions per place. [2022-12-13 13:56:48,273 INFO L137 encePairwiseOnDemand]: 380/384 looper letters, 95 selfloop transitions, 4 changer transitions 0/103 dead transitions. [2022-12-13 13:56:48,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 103 transitions, 684 flow [2022-12-13 13:56:48,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:56:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:56:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2022-12-13 13:56:48,275 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4496527777777778 [2022-12-13 13:56:48,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2022-12-13 13:56:48,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2022-12-13 13:56:48,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:56:48,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2022-12-13 13:56:48,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:56:48,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:56:48,279 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:56:48,279 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 329 flow. Second operand 3 states and 518 transitions. [2022-12-13 13:56:48,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 103 transitions, 684 flow [2022-12-13 13:56:48,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 103 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:56:48,316 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 345 flow [2022-12-13 13:56:48,316 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=345, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2022-12-13 13:56:48,317 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -39 predicate places. [2022-12-13 13:56:48,317 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 345 flow [2022-12-13 13:56:48,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:56:48,317 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:56:48,318 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:56:48,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:56:48,318 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 13:56:48,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:56:48,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1387296656, now seen corresponding path program 1 times [2022-12-13 13:56:48,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:56:48,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18340901] [2022-12-13 13:56:48,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:56:48,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:56:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:56:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:56:48,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:56:48,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18340901] [2022-12-13 13:56:48,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18340901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:56:48,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:56:48,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:56:48,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34614066] [2022-12-13 13:56:48,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:56:48,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:56:48,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:56:48,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:56:48,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:56:48,563 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 384 [2022-12-13 13:56:48,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 345 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:56:48,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:56:48,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 384 [2022-12-13 13:56:48,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:57:05,409 INFO L130 PetriNetUnfolder]: 88759/125974 cut-off events. [2022-12-13 13:57:05,409 INFO L131 PetriNetUnfolder]: For 83987/84897 co-relation queries the response was YES. [2022-12-13 13:57:05,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409862 conditions, 125974 events. 88759/125974 cut-off events. For 83987/84897 co-relation queries the response was YES. Maximal size of possible extension queue 6573. Compared 944520 event pairs, 40458 based on Foata normal form. 44/108978 useless extension candidates. Maximal degree in co-relation 409852. Up to 86641 conditions per place. [2022-12-13 13:57:06,185 INFO L137 encePairwiseOnDemand]: 381/384 looper letters, 88 selfloop transitions, 7 changer transitions 0/101 dead transitions. [2022-12-13 13:57:06,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 101 transitions, 666 flow [2022-12-13 13:57:06,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:57:06,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:57:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-12-13 13:57:06,187 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4574652777777778 [2022-12-13 13:57:06,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2022-12-13 13:57:06,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2022-12-13 13:57:06,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:57:06,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2022-12-13 13:57:06,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 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-12-13 13:57:06,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:57:06,191 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 384.0) internal successors, (1536), 4 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:57:06,191 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 345 flow. Second operand 3 states and 527 transitions. [2022-12-13 13:57:06,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 101 transitions, 666 flow [2022-12-13 13:57:06,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 101 transitions, 658 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 13:57:06,224 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 360 flow [2022-12-13 13:57:06,224 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2022-12-13 13:57:06,225 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -37 predicate places. [2022-12-13 13:57:06,225 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 360 flow [2022-12-13 13:57:06,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:57:06,225 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:57:06,225 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:06,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:57:06,226 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 13:57:06,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:06,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1387225731, now seen corresponding path program 1 times [2022-12-13 13:57:06,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:06,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656229796] [2022-12-13 13:57:06,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:06,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:06,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-12-13 13:57:06,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:06,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656229796] [2022-12-13 13:57:06,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656229796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:06,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:57:06,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:57:06,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098452603] [2022-12-13 13:57:06,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:06,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:57:06,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:06,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:57:06,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:57:06,397 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 384 [2022-12-13 13:57:06,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 360 flow. Second operand has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:57:06,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:57:06,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 384 [2022-12-13 13:57:06,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:57:20,800 INFO L130 PetriNetUnfolder]: 74813/106374 cut-off events. [2022-12-13 13:57:20,800 INFO L131 PetriNetUnfolder]: For 75919/75919 co-relation queries the response was YES. [2022-12-13 13:57:21,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353758 conditions, 106374 events. 74813/106374 cut-off events. For 75919/75919 co-relation queries the response was YES. Maximal size of possible extension queue 5640. Compared 774877 event pairs, 25489 based on Foata normal form. 714/93296 useless extension candidates. Maximal degree in co-relation 353747. Up to 51274 conditions per place. [2022-12-13 13:57:21,422 INFO L137 encePairwiseOnDemand]: 361/384 looper letters, 83 selfloop transitions, 19 changer transitions 0/105 dead transitions. [2022-12-13 13:57:21,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 105 transitions, 774 flow [2022-12-13 13:57:21,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:57:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:57:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions. [2022-12-13 13:57:21,425 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4186197916666667 [2022-12-13 13:57:21,425 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 643 transitions. [2022-12-13 13:57:21,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions. [2022-12-13 13:57:21,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:57:21,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions. [2022-12-13 13:57:21,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:57:21,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 384.0) internal successors, (1920), 5 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:57:21,428 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 384.0) internal successors, (1920), 5 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:57:21,428 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 360 flow. Second operand 4 states and 643 transitions. [2022-12-13 13:57:21,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 105 transitions, 774 flow [2022-12-13 13:57:21,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 105 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:57:21,480 INFO L231 Difference]: Finished difference. Result has 76 places, 78 transitions, 515 flow [2022-12-13 13:57:21,480 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=515, PETRI_PLACES=76, PETRI_TRANSITIONS=78} [2022-12-13 13:57:21,480 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -34 predicate places. [2022-12-13 13:57:21,480 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 78 transitions, 515 flow [2022-12-13 13:57:21,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:57:21,481 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:57:21,481 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:21,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:57:21,481 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 13:57:21,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:21,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1898798485, now seen corresponding path program 1 times [2022-12-13 13:57:21,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:21,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053863501] [2022-12-13 13:57:21,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:21,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:21,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:21,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053863501] [2022-12-13 13:57:21,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053863501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:21,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:57:21,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:57:21,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874483112] [2022-12-13 13:57:21,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:21,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:57:21,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:21,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:57:21,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:57:21,843 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 384 [2022-12-13 13:57:21,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 78 transitions, 515 flow. Second operand has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:57:21,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:57:21,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 384 [2022-12-13 13:57:21,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:57:43,363 INFO L130 PetriNetUnfolder]: 119567/170133 cut-off events. [2022-12-13 13:57:43,363 INFO L131 PetriNetUnfolder]: For 228383/229293 co-relation queries the response was YES. [2022-12-13 13:57:43,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630024 conditions, 170133 events. 119567/170133 cut-off events. For 228383/229293 co-relation queries the response was YES. Maximal size of possible extension queue 8705. Compared 1341149 event pairs, 26226 based on Foata normal form. 509/146936 useless extension candidates. Maximal degree in co-relation 630012. Up to 73206 conditions per place. [2022-12-13 13:57:44,403 INFO L137 encePairwiseOnDemand]: 378/384 looper letters, 211 selfloop transitions, 12 changer transitions 0/228 dead transitions. [2022-12-13 13:57:44,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 228 transitions, 1852 flow [2022-12-13 13:57:44,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:57:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:57:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1021 transitions. [2022-12-13 13:57:44,406 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4431423611111111 [2022-12-13 13:57:44,406 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1021 transitions. [2022-12-13 13:57:44,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1021 transitions. [2022-12-13 13:57:44,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:57:44,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1021 transitions. [2022-12-13 13:57:44,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 170.16666666666666) internal successors, (1021), 6 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:57:44,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 384.0) internal successors, (2688), 7 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:57:44,411 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 384.0) internal successors, (2688), 7 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:57:44,411 INFO L175 Difference]: Start difference. First operand has 76 places, 78 transitions, 515 flow. Second operand 6 states and 1021 transitions. [2022-12-13 13:57:44,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 228 transitions, 1852 flow [2022-12-13 13:57:44,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 228 transitions, 1838 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:57:44,698 INFO L231 Difference]: Finished difference. Result has 81 places, 79 transitions, 550 flow [2022-12-13 13:57:44,698 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2022-12-13 13:57:44,699 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -29 predicate places. [2022-12-13 13:57:44,699 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 550 flow [2022-12-13 13:57:44,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:57:44,699 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:57:44,699 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:57:44,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:57:44,699 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 13:57:44,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:57:44,700 INFO L85 PathProgramCache]: Analyzing trace with hash -55670669, now seen corresponding path program 2 times [2022-12-13 13:57:44,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:57:44,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510450917] [2022-12-13 13:57:44,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:57:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:57:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:57:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:57:45,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:57:45,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510450917] [2022-12-13 13:57:45,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510450917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:57:45,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:57:45,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:57:45,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549484172] [2022-12-13 13:57:45,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:57:45,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:57:45,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:57:45,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:57:45,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:57:45,134 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 384 [2022-12-13 13:57:45,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 550 flow. Second operand has 5 states, 5 states have (on average 150.2) internal successors, (751), 5 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:57:45,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:57:45,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 384 [2022-12-13 13:57:45,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:58:25,830 INFO L130 PetriNetUnfolder]: 234246/332717 cut-off events. [2022-12-13 13:58:25,830 INFO L131 PetriNetUnfolder]: For 447413/451236 co-relation queries the response was YES. [2022-12-13 13:58:26,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228341 conditions, 332717 events. 234246/332717 cut-off events. For 447413/451236 co-relation queries the response was YES. Maximal size of possible extension queue 19022. Compared 2829143 event pairs, 57336 based on Foata normal form. 989/280841 useless extension candidates. Maximal degree in co-relation 1228327. Up to 137738 conditions per place. [2022-12-13 13:58:28,029 INFO L137 encePairwiseOnDemand]: 379/384 looper letters, 234 selfloop transitions, 14 changer transitions 0/253 dead transitions. [2022-12-13 13:58:28,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 253 transitions, 2086 flow [2022-12-13 13:58:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:58:28,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:58:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1038 transitions. [2022-12-13 13:58:28,033 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4505208333333333 [2022-12-13 13:58:28,034 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1038 transitions. [2022-12-13 13:58:28,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1038 transitions. [2022-12-13 13:58:28,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:58:28,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1038 transitions. [2022-12-13 13:58:28,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:28,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 384.0) internal successors, (2688), 7 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:28,043 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 384.0) internal successors, (2688), 7 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:28,043 INFO L175 Difference]: Start difference. First operand has 81 places, 79 transitions, 550 flow. Second operand 6 states and 1038 transitions. [2022-12-13 13:58:28,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 253 transitions, 2086 flow [2022-12-13 13:58:28,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 253 transitions, 2057 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 13:58:28,609 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 576 flow [2022-12-13 13:58:28,609 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2022-12-13 13:58:28,610 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -26 predicate places. [2022-12-13 13:58:28,610 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 576 flow [2022-12-13 13:58:28,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 150.2) internal successors, (751), 5 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:28,611 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:58:28,611 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:58:28,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:58:28,611 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 13:58:28,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:58:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1233239543, now seen corresponding path program 1 times [2022-12-13 13:58:28,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:58:28,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859044031] [2022-12-13 13:58:28,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:58:28,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:58:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:58:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:58:29,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:58:29,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859044031] [2022-12-13 13:58:29,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859044031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:58:29,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:58:29,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:58:29,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574864217] [2022-12-13 13:58:29,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:58:29,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:58:29,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:58:29,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:58:29,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:58:30,256 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 384 [2022-12-13 13:58:30,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 576 flow. Second operand has 10 states, 10 states have (on average 129.7) internal successors, (1297), 10 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:58:30,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:58:30,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 384 [2022-12-13 13:58:30,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:59:11,886 INFO L130 PetriNetUnfolder]: 226200/323343 cut-off events. [2022-12-13 13:59:11,887 INFO L131 PetriNetUnfolder]: For 407437/407749 co-relation queries the response was YES. [2022-12-13 13:59:12,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217357 conditions, 323343 events. 226200/323343 cut-off events. For 407437/407749 co-relation queries the response was YES. Maximal size of possible extension queue 19442. Compared 2753730 event pairs, 128332 based on Foata normal form. 104/278348 useless extension candidates. Maximal degree in co-relation 1217341. Up to 301100 conditions per place. [2022-12-13 13:59:14,073 INFO L137 encePairwiseOnDemand]: 370/384 looper letters, 187 selfloop transitions, 54 changer transitions 0/243 dead transitions. [2022-12-13 13:59:14,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 243 transitions, 2141 flow [2022-12-13 13:59:14,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:59:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:59:14,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1420 transitions. [2022-12-13 13:59:14,077 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3697916666666667 [2022-12-13 13:59:14,077 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1420 transitions. [2022-12-13 13:59:14,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1420 transitions. [2022-12-13 13:59:14,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:59:14,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1420 transitions. [2022-12-13 13:59:14,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 142.0) internal successors, (1420), 10 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:59:14,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 384.0) internal successors, (4224), 11 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:59:14,084 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 384.0) internal successors, (4224), 11 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:59:14,084 INFO L175 Difference]: Start difference. First operand has 84 places, 81 transitions, 576 flow. Second operand 10 states and 1420 transitions. [2022-12-13 13:59:14,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 243 transitions, 2141 flow [2022-12-13 13:59:15,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 243 transitions, 2061 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 13:59:15,339 INFO L231 Difference]: Finished difference. Result has 98 places, 134 transitions, 1177 flow [2022-12-13 13:59:15,339 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1177, PETRI_PLACES=98, PETRI_TRANSITIONS=134} [2022-12-13 13:59:15,339 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -12 predicate places. [2022-12-13 13:59:15,340 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 134 transitions, 1177 flow [2022-12-13 13:59:15,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 129.7) internal successors, (1297), 10 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:59:15,340 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:59:15,340 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:59:15,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:59:15,340 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 13:59:15,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:59:15,341 INFO L85 PathProgramCache]: Analyzing trace with hash -54324392, now seen corresponding path program 1 times [2022-12-13 13:59:15,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:59:15,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744409767] [2022-12-13 13:59:15,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:59:15,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:59:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:59:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:59:15,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:59:15,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744409767] [2022-12-13 13:59:15,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744409767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:59:15,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:59:15,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:59:15,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745556789] [2022-12-13 13:59:15,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:59:15,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:59:15,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:59:15,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:59:15,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:59:15,606 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 384 [2022-12-13 13:59:15,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 134 transitions, 1177 flow. Second operand has 7 states, 7 states have (on average 139.28571428571428) internal successors, (975), 7 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:59:15,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:59:15,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 384 [2022-12-13 13:59:15,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:59:50,934 INFO L130 PetriNetUnfolder]: 182026/261513 cut-off events. [2022-12-13 13:59:50,935 INFO L131 PetriNetUnfolder]: For 426864/427126 co-relation queries the response was YES. [2022-12-13 13:59:52,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1073522 conditions, 261513 events. 182026/261513 cut-off events. For 426864/427126 co-relation queries the response was YES. Maximal size of possible extension queue 15964. Compared 2184310 event pairs, 60880 based on Foata normal form. 2863/235443 useless extension candidates. Maximal degree in co-relation 1073499. Up to 116537 conditions per place. [2022-12-13 13:59:53,185 INFO L137 encePairwiseOnDemand]: 360/384 looper letters, 179 selfloop transitions, 37 changer transitions 0/219 dead transitions. [2022-12-13 13:59:53,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 219 transitions, 2271 flow [2022-12-13 13:59:53,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:59:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:59:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 921 transitions. [2022-12-13 13:59:53,188 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3997395833333333 [2022-12-13 13:59:53,188 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 921 transitions. [2022-12-13 13:59:53,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 921 transitions. [2022-12-13 13:59:53,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:59:53,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 921 transitions. [2022-12-13 13:59:53,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 153.5) internal successors, (921), 6 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:59:53,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 384.0) internal successors, (2688), 7 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:59:53,193 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 384.0) internal successors, (2688), 7 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:59:53,193 INFO L175 Difference]: Start difference. First operand has 98 places, 134 transitions, 1177 flow. Second operand 6 states and 921 transitions. [2022-12-13 13:59:53,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 219 transitions, 2271 flow [2022-12-13 13:59:58,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 219 transitions, 2265 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-13 13:59:58,798 INFO L231 Difference]: Finished difference. Result has 105 places, 150 transitions, 1547 flow [2022-12-13 13:59:58,798 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1547, PETRI_PLACES=105, PETRI_TRANSITIONS=150} [2022-12-13 13:59:58,799 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -5 predicate places. [2022-12-13 13:59:58,799 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 150 transitions, 1547 flow [2022-12-13 13:59:58,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 139.28571428571428) internal successors, (975), 7 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:59:58,800 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:59:58,800 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:59:58,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:59:58,800 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 13:59:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:59:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1506997691, now seen corresponding path program 1 times [2022-12-13 13:59:58,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:59:58,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516768788] [2022-12-13 13:59:58,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:59:58,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:59:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:59:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:59:58,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:59:58,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516768788] [2022-12-13 13:59:58,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516768788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:59:58,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:59:58,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:59:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664185887] [2022-12-13 13:59:58,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:59:58,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:59:58,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:59:58,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:59:58,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:59:58,990 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 384 [2022-12-13 13:59:58,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 150 transitions, 1547 flow. Second operand has 4 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:59:58,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:59:58,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 384 [2022-12-13 13:59:58,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:00:16,720 INFO L130 PetriNetUnfolder]: 72575/110518 cut-off events. [2022-12-13 14:00:16,720 INFO L131 PetriNetUnfolder]: For 257638/258029 co-relation queries the response was YES. [2022-12-13 14:00:17,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499004 conditions, 110518 events. 72575/110518 cut-off events. For 257638/258029 co-relation queries the response was YES. Maximal size of possible extension queue 8118. Compared 942974 event pairs, 24305 based on Foata normal form. 1193/99115 useless extension candidates. Maximal degree in co-relation 498979. Up to 99780 conditions per place. [2022-12-13 14:00:17,629 INFO L137 encePairwiseOnDemand]: 377/384 looper letters, 180 selfloop transitions, 9 changer transitions 6/218 dead transitions. [2022-12-13 14:00:17,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 218 transitions, 2274 flow [2022-12-13 14:00:17,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:00:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 14:00:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 808 transitions. [2022-12-13 14:00:17,632 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42083333333333334 [2022-12-13 14:00:17,632 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 808 transitions. [2022-12-13 14:00:17,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 808 transitions. [2022-12-13 14:00:17,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:00:17,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 808 transitions. [2022-12-13 14:00:17,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.6) internal successors, (808), 5 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:17,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 384.0) internal successors, (2304), 6 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:17,637 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 384.0) internal successors, (2304), 6 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:17,637 INFO L175 Difference]: Start difference. First operand has 105 places, 150 transitions, 1547 flow. Second operand 5 states and 808 transitions. [2022-12-13 14:00:17,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 218 transitions, 2274 flow [2022-12-13 14:00:19,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 218 transitions, 2252 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 14:00:19,481 INFO L231 Difference]: Finished difference. Result has 109 places, 152 transitions, 1492 flow [2022-12-13 14:00:19,481 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1492, PETRI_PLACES=109, PETRI_TRANSITIONS=152} [2022-12-13 14:00:19,482 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -1 predicate places. [2022-12-13 14:00:19,482 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 152 transitions, 1492 flow [2022-12-13 14:00:19,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:19,483 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:00:19,483 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-12-13 14:00:19,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 14:00:19,483 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 14:00:19,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:00:19,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1806897399, now seen corresponding path program 1 times [2022-12-13 14:00:19,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:00:19,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029257550] [2022-12-13 14:00:19,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:00:19,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:00:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:00:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:00:21,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:00:21,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029257550] [2022-12-13 14:00:21,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029257550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:00:21,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:00:21,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:00:21,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910112549] [2022-12-13 14:00:21,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:00:21,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 14:00:21,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:00:21,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 14:00:21,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:00:21,873 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 384 [2022-12-13 14:00:21,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 152 transitions, 1492 flow. Second operand has 9 states, 9 states have (on average 137.22222222222223) internal successors, (1235), 9 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:21,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:00:21,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 384 [2022-12-13 14:00:21,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:00:44,101 INFO L130 PetriNetUnfolder]: 93263/139283 cut-off events. [2022-12-13 14:00:44,101 INFO L131 PetriNetUnfolder]: For 407136/407271 co-relation queries the response was YES. [2022-12-13 14:00:44,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695369 conditions, 139283 events. 93263/139283 cut-off events. For 407136/407271 co-relation queries the response was YES. Maximal size of possible extension queue 8832. Compared 1167105 event pairs, 26925 based on Foata normal form. 297/123896 useless extension candidates. Maximal degree in co-relation 695340. Up to 59955 conditions per place. [2022-12-13 14:00:45,390 INFO L137 encePairwiseOnDemand]: 371/384 looper letters, 415 selfloop transitions, 76 changer transitions 23/515 dead transitions. [2022-12-13 14:00:45,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 515 transitions, 5790 flow [2022-12-13 14:00:45,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:00:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 14:00:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1268 transitions. [2022-12-13 14:00:45,393 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4127604166666667 [2022-12-13 14:00:45,394 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1268 transitions. [2022-12-13 14:00:45,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1268 transitions. [2022-12-13 14:00:45,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:00:45,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1268 transitions. [2022-12-13 14:00:45,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 158.5) internal successors, (1268), 8 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:45,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 384.0) internal successors, (3456), 9 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:45,399 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 384.0) internal successors, (3456), 9 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:45,399 INFO L175 Difference]: Start difference. First operand has 109 places, 152 transitions, 1492 flow. Second operand 8 states and 1268 transitions. [2022-12-13 14:00:45,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 515 transitions, 5790 flow [2022-12-13 14:00:47,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 515 transitions, 5767 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 14:00:47,712 INFO L231 Difference]: Finished difference. Result has 119 places, 218 transitions, 2587 flow [2022-12-13 14:00:47,712 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2587, PETRI_PLACES=119, PETRI_TRANSITIONS=218} [2022-12-13 14:00:47,713 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, 9 predicate places. [2022-12-13 14:00:47,713 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 218 transitions, 2587 flow [2022-12-13 14:00:47,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 137.22222222222223) internal successors, (1235), 9 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:47,713 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:00:47,713 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:00:47,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 14:00:47,713 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 14:00:47,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:00:47,714 INFO L85 PathProgramCache]: Analyzing trace with hash -12351695, now seen corresponding path program 1 times [2022-12-13 14:00:47,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:00:47,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472736503] [2022-12-13 14:00:47,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:00:47,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:00:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:00:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:00:47,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:00:47,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472736503] [2022-12-13 14:00:47,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472736503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:00:47,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:00:47,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:00:47,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499677996] [2022-12-13 14:00:47,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:00:47,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:00:47,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:00:47,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:00:47,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:00:47,914 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 384 [2022-12-13 14:00:47,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 218 transitions, 2587 flow. Second operand has 5 states, 5 states have (on average 147.8) internal successors, (739), 5 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:47,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:00:47,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 384 [2022-12-13 14:00:47,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:00:54,246 INFO L130 PetriNetUnfolder]: 18953/31608 cut-off events. [2022-12-13 14:00:54,246 INFO L131 PetriNetUnfolder]: For 122963/123449 co-relation queries the response was YES. [2022-12-13 14:00:54,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166775 conditions, 31608 events. 18953/31608 cut-off events. For 122963/123449 co-relation queries the response was YES. Maximal size of possible extension queue 2220. Compared 257385 event pairs, 4552 based on Foata normal form. 1080/29632 useless extension candidates. Maximal degree in co-relation 166742. Up to 24096 conditions per place. [2022-12-13 14:00:54,487 INFO L137 encePairwiseOnDemand]: 377/384 looper letters, 269 selfloop transitions, 14 changer transitions 10/322 dead transitions. [2022-12-13 14:00:54,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 322 transitions, 3896 flow [2022-12-13 14:00:54,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:00:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 14:00:54,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 969 transitions. [2022-12-13 14:00:54,490 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4205729166666667 [2022-12-13 14:00:54,490 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 969 transitions. [2022-12-13 14:00:54,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 969 transitions. [2022-12-13 14:00:54,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:00:54,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 969 transitions. [2022-12-13 14:00:54,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:54,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 384.0) internal successors, (2688), 7 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:54,493 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 384.0) internal successors, (2688), 7 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:54,493 INFO L175 Difference]: Start difference. First operand has 119 places, 218 transitions, 2587 flow. Second operand 6 states and 969 transitions. [2022-12-13 14:00:54,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 322 transitions, 3896 flow [2022-12-13 14:00:56,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 322 transitions, 3697 flow, removed 88 selfloop flow, removed 4 redundant places. [2022-12-13 14:00:56,280 INFO L231 Difference]: Finished difference. Result has 119 places, 189 transitions, 2098 flow [2022-12-13 14:00:56,281 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=1978, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2098, PETRI_PLACES=119, PETRI_TRANSITIONS=189} [2022-12-13 14:00:56,281 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, 9 predicate places. [2022-12-13 14:00:56,281 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 189 transitions, 2098 flow [2022-12-13 14:00:56,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 147.8) internal successors, (739), 5 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:56,281 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:00:56,282 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:00:56,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 14:00:56,282 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 14:00:56,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:00:56,282 INFO L85 PathProgramCache]: Analyzing trace with hash 827298479, now seen corresponding path program 1 times [2022-12-13 14:00:56,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:00:56,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045970659] [2022-12-13 14:00:56,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:00:56,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:00:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:00:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:00:56,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:00:56,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045970659] [2022-12-13 14:00:56,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045970659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:00:56,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:00:56,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:00:56,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313339763] [2022-12-13 14:00:56,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:00:56,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:00:56,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:00:56,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:00:56,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:00:56,531 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 384 [2022-12-13 14:00:56,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 189 transitions, 2098 flow. Second operand has 6 states, 6 states have (on average 147.5) internal successors, (885), 6 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:56,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:00:56,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 384 [2022-12-13 14:00:56,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:00:59,019 INFO L130 PetriNetUnfolder]: 6562/10959 cut-off events. [2022-12-13 14:00:59,019 INFO L131 PetriNetUnfolder]: For 43607/44002 co-relation queries the response was YES. [2022-12-13 14:00:59,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57426 conditions, 10959 events. 6562/10959 cut-off events. For 43607/44002 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 74589 event pairs, 808 based on Foata normal form. 480/11125 useless extension candidates. Maximal degree in co-relation 57393. Up to 4533 conditions per place. [2022-12-13 14:00:59,080 INFO L137 encePairwiseOnDemand]: 377/384 looper letters, 246 selfloop transitions, 23 changer transitions 25/315 dead transitions. [2022-12-13 14:00:59,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 315 transitions, 3484 flow [2022-12-13 14:00:59,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:00:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 14:00:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1284 transitions. [2022-12-13 14:00:59,083 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2022-12-13 14:00:59,083 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1284 transitions. [2022-12-13 14:00:59,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1284 transitions. [2022-12-13 14:00:59,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:00:59,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1284 transitions. [2022-12-13 14:00:59,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 160.5) internal successors, (1284), 8 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:59,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 384.0) internal successors, (3456), 9 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:59,088 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 384.0) internal successors, (3456), 9 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:59,088 INFO L175 Difference]: Start difference. First operand has 119 places, 189 transitions, 2098 flow. Second operand 8 states and 1284 transitions. [2022-12-13 14:00:59,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 315 transitions, 3484 flow [2022-12-13 14:00:59,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 315 transitions, 3369 flow, removed 48 selfloop flow, removed 4 redundant places. [2022-12-13 14:00:59,675 INFO L231 Difference]: Finished difference. Result has 123 places, 152 transitions, 1513 flow [2022-12-13 14:00:59,675 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1513, PETRI_PLACES=123, PETRI_TRANSITIONS=152} [2022-12-13 14:00:59,675 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, 13 predicate places. [2022-12-13 14:00:59,675 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 152 transitions, 1513 flow [2022-12-13 14:00:59,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.5) internal successors, (885), 6 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:59,675 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:00:59,675 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:00:59,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 14:00:59,676 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 14:00:59,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:00:59,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1565830610, now seen corresponding path program 1 times [2022-12-13 14:00:59,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:00:59,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648194628] [2022-12-13 14:00:59,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:00:59,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:00:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:00:59,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:00:59,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:00:59,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648194628] [2022-12-13 14:00:59,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648194628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:00:59,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:00:59,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 14:00:59,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360520852] [2022-12-13 14:00:59,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:00:59,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:00:59,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:00:59,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:00:59,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:00:59,941 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 384 [2022-12-13 14:00:59,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 152 transitions, 1513 flow. Second operand has 7 states, 7 states have (on average 147.28571428571428) internal successors, (1031), 7 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:00:59,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:00:59,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 384 [2022-12-13 14:00:59,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:01:01,821 INFO L130 PetriNetUnfolder]: 5667/8991 cut-off events. [2022-12-13 14:01:01,821 INFO L131 PetriNetUnfolder]: For 40073/40460 co-relation queries the response was YES. [2022-12-13 14:01:01,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46795 conditions, 8991 events. 5667/8991 cut-off events. For 40073/40460 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 58101 event pairs, 605 based on Foata normal form. 157/9086 useless extension candidates. Maximal degree in co-relation 46761. Up to 4160 conditions per place. [2022-12-13 14:01:01,861 INFO L137 encePairwiseOnDemand]: 377/384 looper letters, 189 selfloop transitions, 28 changer transitions 26/257 dead transitions. [2022-12-13 14:01:01,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 257 transitions, 2636 flow [2022-12-13 14:01:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 14:01:01,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 14:01:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1563 transitions. [2022-12-13 14:01:01,864 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40703125 [2022-12-13 14:01:01,864 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1563 transitions. [2022-12-13 14:01:01,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1563 transitions. [2022-12-13 14:01:01,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:01:01,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1563 transitions. [2022-12-13 14:01:01,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 156.3) internal successors, (1563), 10 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:01:01,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 384.0) internal successors, (4224), 11 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:01:01,869 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 384.0) internal successors, (4224), 11 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:01:01,869 INFO L175 Difference]: Start difference. First operand has 123 places, 152 transitions, 1513 flow. Second operand 10 states and 1563 transitions. [2022-12-13 14:01:01,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 257 transitions, 2636 flow [2022-12-13 14:01:02,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 257 transitions, 2220 flow, removed 117 selfloop flow, removed 16 redundant places. [2022-12-13 14:01:02,702 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 674 flow [2022-12-13 14:01:02,702 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=674, PETRI_PLACES=106, PETRI_TRANSITIONS=93} [2022-12-13 14:01:02,702 INFO L288 CegarLoopForPetriNet]: 110 programPoint places, -4 predicate places. [2022-12-13 14:01:02,702 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 674 flow [2022-12-13 14:01:02,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 147.28571428571428) internal successors, (1031), 7 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:01:02,702 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:01:02,702 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:01:02,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 14:01:02,703 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 14:01:02,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:01:02,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1577946523, now seen corresponding path program 1 times [2022-12-13 14:01:02,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:01:02,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714699892] [2022-12-13 14:01:02,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:01:02,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:01:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:01:02,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:01:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:01:02,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:01:02,944 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 14:01:02,944 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (103 of 104 remaining) [2022-12-13 14:01:02,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 104 remaining) [2022-12-13 14:01:02,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 104 remaining) [2022-12-13 14:01:02,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 104 remaining) [2022-12-13 14:01:02,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 104 remaining) [2022-12-13 14:01:02,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 104 remaining) [2022-12-13 14:01:02,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 104 remaining) [2022-12-13 14:01:02,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 104 remaining) [2022-12-13 14:01:02,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 104 remaining) [2022-12-13 14:01:02,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 104 remaining) [2022-12-13 14:01:02,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 104 remaining) [2022-12-13 14:01:02,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 104 remaining) [2022-12-13 14:01:02,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 104 remaining) [2022-12-13 14:01:02,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 104 remaining) [2022-12-13 14:01:02,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 104 remaining) [2022-12-13 14:01:02,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 104 remaining) [2022-12-13 14:01:02,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 104 remaining) [2022-12-13 14:01:02,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 104 remaining) [2022-12-13 14:01:02,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 104 remaining) [2022-12-13 14:01:02,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 104 remaining) [2022-12-13 14:01:02,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 104 remaining) [2022-12-13 14:01:02,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 104 remaining) [2022-12-13 14:01:02,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 104 remaining) [2022-12-13 14:01:02,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 104 remaining) [2022-12-13 14:01:02,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 104 remaining) [2022-12-13 14:01:02,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 104 remaining) [2022-12-13 14:01:02,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 104 remaining) [2022-12-13 14:01:02,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 104 remaining) [2022-12-13 14:01:02,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 104 remaining) [2022-12-13 14:01:02,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 104 remaining) [2022-12-13 14:01:02,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 104 remaining) [2022-12-13 14:01:02,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 104 remaining) [2022-12-13 14:01:02,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 104 remaining) [2022-12-13 14:01:02,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 104 remaining) [2022-12-13 14:01:02,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 104 remaining) [2022-12-13 14:01:02,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 104 remaining) [2022-12-13 14:01:02,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 104 remaining) [2022-12-13 14:01:02,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 104 remaining) [2022-12-13 14:01:02,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 104 remaining) [2022-12-13 14:01:02,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 104 remaining) [2022-12-13 14:01:02,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 104 remaining) [2022-12-13 14:01:02,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 104 remaining) [2022-12-13 14:01:02,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 104 remaining) [2022-12-13 14:01:02,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 104 remaining) [2022-12-13 14:01:02,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 104 remaining) [2022-12-13 14:01:02,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 104 remaining) [2022-12-13 14:01:02,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 104 remaining) [2022-12-13 14:01:02,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 104 remaining) [2022-12-13 14:01:02,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 104 remaining) [2022-12-13 14:01:02,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 104 remaining) [2022-12-13 14:01:02,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 104 remaining) [2022-12-13 14:01:02,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 104 remaining) [2022-12-13 14:01:02,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 104 remaining) [2022-12-13 14:01:02,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 104 remaining) [2022-12-13 14:01:02,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 104 remaining) [2022-12-13 14:01:02,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 104 remaining) [2022-12-13 14:01:02,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 104 remaining) [2022-12-13 14:01:02,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 104 remaining) [2022-12-13 14:01:02,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 104 remaining) [2022-12-13 14:01:02,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 104 remaining) [2022-12-13 14:01:02,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 104 remaining) [2022-12-13 14:01:02,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 104 remaining) [2022-12-13 14:01:02,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 104 remaining) [2022-12-13 14:01:02,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK (40 of 104 remaining) [2022-12-13 14:01:02,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 104 remaining) [2022-12-13 14:01:02,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 104 remaining) [2022-12-13 14:01:02,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 104 remaining) [2022-12-13 14:01:02,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 104 remaining) [2022-12-13 14:01:02,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 104 remaining) [2022-12-13 14:01:02,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 104 remaining) [2022-12-13 14:01:02,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 104 remaining) [2022-12-13 14:01:02,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 104 remaining) [2022-12-13 14:01:02,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 104 remaining) [2022-12-13 14:01:02,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 104 remaining) [2022-12-13 14:01:02,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 104 remaining) [2022-12-13 14:01:02,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 104 remaining) [2022-12-13 14:01:02,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 104 remaining) [2022-12-13 14:01:02,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 104 remaining) [2022-12-13 14:01:02,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 104 remaining) [2022-12-13 14:01:02,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 104 remaining) [2022-12-13 14:01:02,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 104 remaining) [2022-12-13 14:01:02,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 104 remaining) [2022-12-13 14:01:02,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 104 remaining) [2022-12-13 14:01:02,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 104 remaining) [2022-12-13 14:01:02,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 104 remaining) [2022-12-13 14:01:02,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 104 remaining) [2022-12-13 14:01:02,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 104 remaining) [2022-12-13 14:01:02,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 104 remaining) [2022-12-13 14:01:02,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 104 remaining) [2022-12-13 14:01:02,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 104 remaining) [2022-12-13 14:01:02,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 104 remaining) [2022-12-13 14:01:02,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 104 remaining) [2022-12-13 14:01:02,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 104 remaining) [2022-12-13 14:01:02,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 104 remaining) [2022-12-13 14:01:02,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 104 remaining) [2022-12-13 14:01:02,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 104 remaining) [2022-12-13 14:01:02,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 104 remaining) [2022-12-13 14:01:02,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 104 remaining) [2022-12-13 14:01:02,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 104 remaining) [2022-12-13 14:01:02,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 104 remaining) [2022-12-13 14:01:02,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 104 remaining) [2022-12-13 14:01:02,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 104 remaining) [2022-12-13 14:01:02,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 104 remaining) [2022-12-13 14:01:02,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 104 remaining) [2022-12-13 14:01:02,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 14:01:02,955 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:01:02,960 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 14:01:02,960 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 14:01:03,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:01:03 BasicIcfg [2022-12-13 14:01:03,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 14:01:03,021 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 14:01:03,021 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 14:01:03,022 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 14:01:03,022 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:52:38" (3/4) ... [2022-12-13 14:01:03,024 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 14:01:03,024 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 14:01:03,024 INFO L158 Benchmark]: Toolchain (without parser) took 506107.60ms. Allocated memory was 113.2MB in the beginning and 11.0GB in the end (delta: 10.9GB). Free memory was 76.8MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 8.1GB. Max. memory is 16.1GB. [2022-12-13 14:01:03,024 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:01:03,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.32ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 76.8MB in the beginning and 123.4MB in the end (delta: -46.6MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2022-12-13 14:01:03,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.28ms. Allocated memory is still 153.1MB. Free memory was 123.4MB in the beginning and 120.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:01:03,025 INFO L158 Benchmark]: Boogie Preprocessor took 26.77ms. Allocated memory is still 153.1MB. Free memory was 120.4MB in the beginning and 118.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:01:03,025 INFO L158 Benchmark]: RCFGBuilder took 1249.05ms. Allocated memory is still 153.1MB. Free memory was 118.0MB in the beginning and 52.6MB in the end (delta: 65.4MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2022-12-13 14:01:03,025 INFO L158 Benchmark]: TraceAbstraction took 504370.80ms. Allocated memory was 153.1MB in the beginning and 11.0GB in the end (delta: 10.9GB). Free memory was 51.5MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 8.1GB. Max. memory is 16.1GB. [2022-12-13 14:01:03,025 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 11.0GB. Free memory is still 2.9GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:01:03,026 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.32ms. Allocated memory was 113.2MB in the beginning and 153.1MB in the end (delta: 39.8MB). Free memory was 76.8MB in the beginning and 123.4MB in the end (delta: -46.6MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.28ms. Allocated memory is still 153.1MB. Free memory was 123.4MB in the beginning and 120.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.77ms. Allocated memory is still 153.1MB. Free memory was 120.4MB in the beginning and 118.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1249.05ms. Allocated memory is still 153.1MB. Free memory was 118.0MB in the beginning and 52.6MB in the end (delta: 65.4MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. * TraceAbstraction took 504370.80ms. Allocated memory was 153.1MB in the beginning and 11.0GB in the end (delta: 10.9GB). Free memory was 51.5MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 8.1GB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 11.0GB. Free memory is still 2.9GB. 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: 29.9s, 224 PlacesBefore, 110 PlacesAfterwards, 213 TransitionsBefore, 98 TransitionsAfterwards, 11266 CoEnabledTransitionPairs, 8 FixpointIterations, 72 TrivialSequentialCompositions, 89 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 167 TotalNumberOfCompositions, 70395 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13580, independent: 12574, independent conditional: 0, independent unconditional: 12574, dependent: 1006, dependent conditional: 0, dependent unconditional: 1006, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4213, independent: 4086, independent conditional: 0, independent unconditional: 4086, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 13580, independent: 8488, independent conditional: 0, independent unconditional: 8488, dependent: 879, dependent conditional: 0, dependent unconditional: 879, unknown: 4213, unknown conditional: 0, unknown unconditional: 4213] , Statistics on independence cache: Total cache size (in pairs): 707, Positive cache size: 633, Positive conditional cache size: 0, Positive unconditional cache size: 633, Negative cache size: 74, Negative conditional cache size: 0, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff0_thd4; [L744] 0 _Bool x$r_buff1_thd0; [L745] 0 _Bool x$r_buff1_thd1; [L746] 0 _Bool x$r_buff1_thd2; [L747] 0 _Bool x$r_buff1_thd3; [L748] 0 _Bool x$r_buff1_thd4; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L861] 0 pthread_t t2149; [L862] FCALL, FORK 0 pthread_create(&t2149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2149, ((void *)0), P0, ((void *)0))=-3, t2149={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L863] 0 pthread_t t2150; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2149={6:0}, t2150={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L864] FCALL, FORK 0 pthread_create(&t2150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2150, ((void *)0), P1, ((void *)0))=-2, t2149={6:0}, t2150={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L865] 0 pthread_t t2151; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2149={6:0}, t2150={7:0}, t2151={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L866] FCALL, FORK 0 pthread_create(&t2151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2151, ((void *)0), P2, ((void *)0))=-1, t2149={6:0}, t2150={7:0}, t2151={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 x$flush_delayed = weak$$choice2 [L803] EXPR 3 \read(x) [L803] 3 x$mem_tmp = x [L804] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L805] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L805] EXPR 3 \read(x) [L805] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L805] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L806] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L807] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L808] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L809] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L810] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L811] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L812] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L813] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L814] EXPR 3 \read(x) [L814] 3 __unbuffered_p2_EAX = x [L815] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L815] 3 x = x$flush_delayed ? x$mem_tmp : x [L816] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L819] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L822] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L822] EXPR 3 \read(x) [L822] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L822] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L823] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L824] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L825] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L826] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L867] 0 pthread_t t2152; [L868] FCALL, FORK 0 pthread_create(&t2152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2152, ((void *)0), P3, ((void *)0))=0, t2149={6:0}, t2150={7:0}, t2151={8:0}, t2152={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L836] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L839] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L839] EXPR 4 \read(x) [L839] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L839] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L840] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L841] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L842] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L843] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L769] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L769] EXPR 1 \read(x) [L769] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L769] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L770] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L771] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L772] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L773] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 \read(x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 4 return 0; [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L874] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L874] EXPR 0 \read(x) [L874] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L874] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L875] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L876] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L877] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L878] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2149={6:0}, t2150={7:0}, t2151={8:0}, t2152={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L881] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L882] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L883] 0 x$flush_delayed = weak$$choice2 [L884] EXPR 0 \read(x) [L884] 0 x$mem_tmp = x [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L885] EXPR 0 \read(x) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L885] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L886] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L887] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L888] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L889] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L890] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L891] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L892] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L893] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L893] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L893] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L893] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L894] EXPR 0 \read(x) [L894] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L895] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L895] EXPR 0 \read(x) [L895] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L895] 0 x = x$flush_delayed ? x$mem_tmp : x [L896] 0 x$flush_delayed = (_Bool)0 [L898] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 868]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 286 locations, 104 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: 504.1s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 465.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 30.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2508 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2033 mSDsluCounter, 413 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 276 mSDsCounter, 508 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4831 IncrementalHoareTripleChecker+Invalid, 5339 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 508 mSolverCounterUnsat, 137 mSDtfsCounter, 4831 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2587occurred in iteration=17, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 283 ConstructedInterpolants, 0 QuantifiedInterpolants, 2213 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 14:01:03,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe016_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b69d29db6700923687b32c5d8fab6e8f05fe2198d87348098263d957793e472 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 14:01:05,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:01:05,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:01:05,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:01:05,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:01:05,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:01:05,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:01:05,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:01:05,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:01:05,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:01:05,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:01:05,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:01:05,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:01:05,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:01:05,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:01:05,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:01:05,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:01:05,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:01:05,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:01:05,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:01:05,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:01:05,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:01:05,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:01:05,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:01:05,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:01:05,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:01:05,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:01:05,237 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:01:05,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:01:05,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:01:05,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:01:05,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:01:05,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:01:05,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:01:05,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:01:05,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:01:05,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:01:05,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:01:05,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:01:05,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:01:05,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:01:05,252 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 14:01:05,274 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:01:05,274 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:01:05,275 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:01:05,275 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:01:05,275 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:01:05,276 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:01:05,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:01:05,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:01:05,277 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:01:05,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:01:05,277 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:01:05,277 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 14:01:05,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:01:05,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:01:05,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:01:05,278 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 14:01:05,278 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 14:01:05,278 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 14:01:05,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:01:05,279 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 14:01:05,279 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 14:01:05,279 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 14:01:05,279 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:01:05,280 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:01:05,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:01:05,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:01:05,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:01:05,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:01:05,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:01:05,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:01:05,281 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 14:01:05,281 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 14:01:05,281 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:01:05,281 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:01:05,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:01:05,282 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 14:01:05,282 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:01:05,282 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_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6b69d29db6700923687b32c5d8fab6e8f05fe2198d87348098263d957793e472 [2022-12-13 14:01:05,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:01:05,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:01:05,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:01:05,545 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:01:05,545 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:01:05,546 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe016_power.opt.i [2022-12-13 14:01:08,163 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:01:08,375 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:01:08,376 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/sv-benchmarks/c/pthread-wmm/safe016_power.opt.i [2022-12-13 14:01:08,388 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/data/e3e350f81/b8f9ac1fcbc94f31a24462ea8a5d1fe7/FLAGd22bbb395 [2022-12-13 14:01:08,400 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/data/e3e350f81/b8f9ac1fcbc94f31a24462ea8a5d1fe7 [2022-12-13 14:01:08,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:01:08,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:01:08,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:01:08,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:01:08,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:01:08,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:01:08" (1/1) ... [2022-12-13 14:01:08,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29ba1cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:01:08, skipping insertion in model container [2022-12-13 14:01:08,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:01:08" (1/1) ... [2022-12-13 14:01:08,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:01:08,451 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:01:08,596 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_57def950-6891-4320-9380-06041b2d4b53/sv-benchmarks/c/pthread-wmm/safe016_power.opt.i[951,964] [2022-12-13 14:01:08,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,750 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,755 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,756 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:01:08,815 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:01:08,824 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_57def950-6891-4320-9380-06041b2d4b53/sv-benchmarks/c/pthread-wmm/safe016_power.opt.i[951,964] [2022-12-13 14:01:08,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,845 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,846 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,879 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:01:08,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:01:08,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:01:08,922 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:01:08,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:01:08 WrapperNode [2022-12-13 14:01:08,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:01:08,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:01:08,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:01:08,924 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:01:08,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:01:08" (1/1) ... [2022-12-13 14:01:08,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:01:08" (1/1) ... [2022-12-13 14:01:08,959 INFO L138 Inliner]: procedures = 181, calls = 91, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 182 [2022-12-13 14:01:08,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:01:08,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:01:08,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:01:08,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:01:08,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:01:08" (1/1) ... [2022-12-13 14:01:08,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:01:08" (1/1) ... [2022-12-13 14:01:08,969 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:01:08" (1/1) ... [2022-12-13 14:01:08,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:01:08" (1/1) ... [2022-12-13 14:01:08,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:01:08" (1/1) ... [2022-12-13 14:01:08,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:01:08" (1/1) ... [2022-12-13 14:01:08,980 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:01:08" (1/1) ... [2022-12-13 14:01:08,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:01:08" (1/1) ... [2022-12-13 14:01:08,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:01:08,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:01:08,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:01:08,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:01:08,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:01:08" (1/1) ... [2022-12-13 14:01:08,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:01:09,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:01:09,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:01:09,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:01:09,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 14:01:09,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 14:01:09,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:01:09,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 14:01:09,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 14:01:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 14:01:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 14:01:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-13 14:01:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 14:01:09,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 14:01:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 14:01:09,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 14:01:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 14:01:09,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 14:01:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 14:01:09,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 14:01:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 14:01:09,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:01:09,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:01:09,040 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 14:01:09,182 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:01:09,184 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:01:09,827 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:01:10,572 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:01:10,572 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 14:01:10,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:01:10 BoogieIcfgContainer [2022-12-13 14:01:10,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:01:10,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:01:10,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:01:10,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:01:10,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:01:08" (1/3) ... [2022-12-13 14:01:10,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce08df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:01:10, skipping insertion in model container [2022-12-13 14:01:10,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:01:08" (2/3) ... [2022-12-13 14:01:10,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce08df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:01:10, skipping insertion in model container [2022-12-13 14:01:10,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:01:10" (3/3) ... [2022-12-13 14:01:10,583 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_power.opt.i [2022-12-13 14:01:10,603 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:01:10,603 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-12-13 14:01:10,603 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 14:01:10,778 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 14:01:10,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 229 places, 218 transitions, 456 flow [2022-12-13 14:01:10,924 INFO L130 PetriNetUnfolder]: 2/214 cut-off events. [2022-12-13 14:01:10,924 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:01:10,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 214 events. 2/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 372 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 151. Up to 2 conditions per place. [2022-12-13 14:01:10,931 INFO L82 GeneralOperation]: Start removeDead. Operand has 229 places, 218 transitions, 456 flow [2022-12-13 14:01:10,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 214 transitions, 440 flow [2022-12-13 14:01:10,944 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 14:01:10,954 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 214 transitions, 440 flow [2022-12-13 14:01:10,956 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 214 transitions, 440 flow [2022-12-13 14:01:10,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 214 transitions, 440 flow [2022-12-13 14:01:11,011 INFO L130 PetriNetUnfolder]: 2/214 cut-off events. [2022-12-13 14:01:11,011 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:01:11,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 214 events. 2/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 374 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 151. Up to 2 conditions per place. [2022-12-13 14:01:11,023 INFO L119 LiptonReduction]: Number of co-enabled transitions 11266 [2022-12-13 14:01:42,132 WARN L233 SmtUtils]: Spent 16.45s on a formula simplification. DAG size of input: 227 DAG size of output: 223 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 14:01:47,522 WARN L233 SmtUtils]: Spent 5.39s on a formula simplification that was a NOOP. DAG size: 223 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 14:01:59,618 WARN L233 SmtUtils]: Spent 12.09s on a formula simplification. DAG size of input: 259 DAG size of output: 255 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 14:02:05,598 WARN L233 SmtUtils]: Spent 5.98s on a formula simplification that was a NOOP. DAG size: 255 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 14:02:37,186 INFO L134 LiptonReduction]: Checked pairs total: 70559 [2022-12-13 14:02:37,186 INFO L136 LiptonReduction]: Total number of compositions: 166 [2022-12-13 14:02:37,196 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:02:37,199 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;@3ccf355c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:02:37,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-12-13 14:02:37,200 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 14:02:37,201 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:02:37,201 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:02:37,201 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 14:02:37,201 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 14:02:37,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:02:37,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1440, now seen corresponding path program 1 times [2022-12-13 14:02:37,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:02:37,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1798569317] [2022-12-13 14:02:37,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:02:37,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 14:02:37,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:02:37,215 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 14:02:37,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57def950-6891-4320-9380-06041b2d4b53/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 14:02:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:02:37,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 14:02:37,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:02:37,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-12-13 14:02:37,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:02:37,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:02:37,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1798569317] [2022-12-13 14:02:37,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1798569317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:02:37,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:02:37,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 14:02:37,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269698340] [2022-12-13 14:02:37,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:02:37,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 14:02:37,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:02:37,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 14:02:37,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 14:02:37,325 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 384 [2022-12-13 14:02:37,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 98 transitions, 208 flow. Second operand has 2 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:02:37,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:02:37,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 384 [2022-12-13 14:02:37,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand