./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe020_power.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe020_power.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd91eb07499c204f7750c4a87fd11eb7780a100da5928fd001cd5e1a53feff12 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:44:20,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:44:20,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:44:20,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:44:20,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:44:20,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:44:20,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:44:20,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:44:20,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:44:20,997 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:44:20,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:44:21,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:44:21,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:44:21,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:44:21,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:44:21,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:44:21,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:44:21,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:44:21,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:44:21,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:44:21,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:44:21,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:44:21,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:44:21,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:44:21,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:44:21,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:44:21,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:44:21,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:44:21,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:44:21,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:44:21,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:44:21,048 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:44:21,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:44:21,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:44:21,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:44:21,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:44:21,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:44:21,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:44:21,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:44:21,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:44:21,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:44:21,058 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 15:44:21,114 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:44:21,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:44:21,115 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:44:21,115 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:44:21,116 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:44:21,117 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:44:21,117 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:44:21,118 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:44:21,118 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:44:21,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:44:21,120 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:44:21,120 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:44:21,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:44:21,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:44:21,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:44:21,121 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:44:21,121 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:44:21,121 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:44:21,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:44:21,122 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:44:21,122 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:44:21,122 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:44:21,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:44:21,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:44:21,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:44:21,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:44:21,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:44:21,124 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:44:21,125 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:44:21,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:44:21,125 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:44:21,126 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:44:21,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:44:21,126 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_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd91eb07499c204f7750c4a87fd11eb7780a100da5928fd001cd5e1a53feff12 [2022-11-25 15:44:21,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:44:21,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:44:21,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:44:21,447 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:44:21,448 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:44:21,449 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe020_power.i [2022-11-25 15:44:24,625 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:44:24,889 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:44:24,889 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/sv-benchmarks/c/pthread-wmm/safe020_power.i [2022-11-25 15:44:24,903 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/data/d5cfcdafb/4124072caad441b6ad3429e07c8d46f8/FLAG831c0a5c4 [2022-11-25 15:44:24,929 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/data/d5cfcdafb/4124072caad441b6ad3429e07c8d46f8 [2022-11-25 15:44:24,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:44:24,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:44:24,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:44:24,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:44:24,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:44:24,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:44:24" (1/1) ... [2022-11-25 15:44:24,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a5006cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:24, skipping insertion in model container [2022-11-25 15:44:24,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:44:24" (1/1) ... [2022-11-25 15:44:24,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:44:25,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:44:25,206 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_146f9139-67ad-465e-b1c8-c613e4e31745/sv-benchmarks/c/pthread-wmm/safe020_power.i[990,1003] [2022-11-25 15:44:25,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:44:25,531 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:44:25,546 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_146f9139-67ad-465e-b1c8-c613e4e31745/sv-benchmarks/c/pthread-wmm/safe020_power.i[990,1003] [2022-11-25 15:44:25,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,573 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,574 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:44:25,610 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:44:25,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:44:25,673 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:44:25,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:25 WrapperNode [2022-11-25 15:44:25,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:44:25,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:44:25,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:44:25,676 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:44:25,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:25" (1/1) ... [2022-11-25 15:44:25,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:25" (1/1) ... [2022-11-25 15:44:25,779 INFO L138 Inliner]: procedures = 176, calls = 77, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-11-25 15:44:25,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:44:25,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:44:25,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:44:25,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:44:25,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:25" (1/1) ... [2022-11-25 15:44:25,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:25" (1/1) ... [2022-11-25 15:44:25,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:25" (1/1) ... [2022-11-25 15:44:25,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:25" (1/1) ... [2022-11-25 15:44:25,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:25" (1/1) ... [2022-11-25 15:44:25,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:25" (1/1) ... [2022-11-25 15:44:25,905 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:25" (1/1) ... [2022-11-25 15:44:25,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:25" (1/1) ... [2022-11-25 15:44:25,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:44:25,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:44:25,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:44:25,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:44:25,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:25" (1/1) ... [2022-11-25 15:44:25,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:44:25,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:44:26,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:44:26,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:44:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 15:44:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:44:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:44:26,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:44:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:44:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:44:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 15:44:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 15:44:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 15:44:26,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 15:44:26,051 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 15:44:26,052 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 15:44:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:44:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:44:26,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:44:26,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:44:26,054 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:44:26,240 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:44:26,242 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:44:27,078 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:44:27,833 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:44:27,833 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:44:27,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:44:27 BoogieIcfgContainer [2022-11-25 15:44:27,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:44:27,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:44:27,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:44:27,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:44:27,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:44:24" (1/3) ... [2022-11-25 15:44:27,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369a2afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:44:27, skipping insertion in model container [2022-11-25 15:44:27,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:44:25" (2/3) ... [2022-11-25 15:44:27,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369a2afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:44:27, skipping insertion in model container [2022-11-25 15:44:27,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:44:27" (3/3) ... [2022-11-25 15:44:27,850 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_power.i [2022-11-25 15:44:27,873 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:44:27,873 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2022-11-25 15:44:27,873 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:44:28,128 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:44:28,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 183 transitions, 381 flow [2022-11-25 15:44:28,336 INFO L130 PetriNetUnfolder]: 2/180 cut-off events. [2022-11-25 15:44:28,337 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:44:28,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 180 events. 2/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 295 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-11-25 15:44:28,347 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 183 transitions, 381 flow [2022-11-25 15:44:28,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 188 places, 180 transitions, 369 flow [2022-11-25 15:44:28,366 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:44:28,393 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 180 transitions, 369 flow [2022-11-25 15:44:28,396 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 180 transitions, 369 flow [2022-11-25 15:44:28,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 188 places, 180 transitions, 369 flow [2022-11-25 15:44:28,455 INFO L130 PetriNetUnfolder]: 2/180 cut-off events. [2022-11-25 15:44:28,456 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:44:28,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 180 events. 2/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 297 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-11-25 15:44:28,462 INFO L119 LiptonReduction]: Number of co-enabled transitions 7512 [2022-11-25 15:44:48,989 INFO L134 LiptonReduction]: Checked pairs total: 30254 [2022-11-25 15:44:48,990 INFO L136 LiptonReduction]: Total number of compositions: 178 [2022-11-25 15:44:49,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:44:49,032 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;@5612bff0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:44:49,032 INFO L358 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2022-11-25 15:44:49,041 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 15:44:49,042 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:44:49,042 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:44:49,043 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 15:44:49,044 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:44:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:49,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1229, now seen corresponding path program 1 times [2022-11-25 15:44:49,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:49,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128216940] [2022-11-25 15:44:49,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:49,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:49,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:44:49,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:49,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128216940] [2022-11-25 15:44:49,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128216940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:49,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:49,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 15:44:49,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374133236] [2022-11-25 15:44:49,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:49,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:44:49,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:49,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:44:49,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:44:49,297 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 361 [2022-11-25 15:44:49,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 161 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:49,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:44:49,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 361 [2022-11-25 15:44:49,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:44:55,557 INFO L130 PetriNetUnfolder]: 20995/29330 cut-off events. [2022-11-25 15:44:55,558 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-11-25 15:44:55,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58733 conditions, 29330 events. 20995/29330 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 2320. Compared 191824 event pairs, 20995 based on Foata normal form. 0/12746 useless extension candidates. Maximal degree in co-relation 58722. Up to 29277 conditions per place. [2022-11-25 15:44:55,786 INFO L137 encePairwiseOnDemand]: 330/361 looper letters, 44 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2022-11-25 15:44:55,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 187 flow [2022-11-25 15:44:55,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:44:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 15:44:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 329 transitions. [2022-11-25 15:44:55,811 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4556786703601108 [2022-11-25 15:44:55,812 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 329 transitions. [2022-11-25 15:44:55,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 329 transitions. [2022-11-25 15:44:55,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:44:55,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 329 transitions. [2022-11-25 15:44:55,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 164.5) internal successors, (329), 2 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:55,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 361.0) internal successors, (1083), 3 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:55,834 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 361.0) internal successors, (1083), 3 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:55,836 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 161 flow. Second operand 2 states and 329 transitions. [2022-11-25 15:44:55,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 187 flow [2022-11-25 15:44:55,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 15:44:55,847 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 96 flow [2022-11-25 15:44:55,849 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2022-11-25 15:44:55,853 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -32 predicate places. [2022-11-25 15:44:55,854 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 96 flow [2022-11-25 15:44:55,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:55,855 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:44:55,855 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-11-25 15:44:55,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:44:55,856 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:44:55,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:44:55,871 INFO L85 PathProgramCache]: Analyzing trace with hash 37655887, now seen corresponding path program 1 times [2022-11-25 15:44:55,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:44:55,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093621728] [2022-11-25 15:44:55,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:44:55,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:44:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:44:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:44:56,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:44:56,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093621728] [2022-11-25 15:44:56,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093621728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:44:56,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:44:56,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:44:56,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549208881] [2022-11-25 15:44:56,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:44:56,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:44:56,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:44:56,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:44:56,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:44:56,212 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 361 [2022-11-25 15:44:56,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:44:56,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:44:56,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 361 [2022-11-25 15:44:56,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:00,125 INFO L130 PetriNetUnfolder]: 13587/19924 cut-off events. [2022-11-25 15:45:00,126 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:00,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39682 conditions, 19924 events. 13587/19924 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1263. Compared 131366 event pairs, 8543 based on Foata normal form. 0/10872 useless extension candidates. Maximal degree in co-relation 39679. Up to 11976 conditions per place. [2022-11-25 15:45:00,260 INFO L137 encePairwiseOnDemand]: 344/361 looper letters, 52 selfloop transitions, 9 changer transitions 0/62 dead transitions. [2022-11-25 15:45:00,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 252 flow [2022-11-25 15:45:00,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:00,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:00,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2022-11-25 15:45:00,264 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40443213296398894 [2022-11-25 15:45:00,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2022-11-25 15:45:00,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2022-11-25 15:45:00,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:00,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2022-11-25 15:45:00,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:00,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:00,275 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:00,275 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 96 flow. Second operand 3 states and 438 transitions. [2022-11-25 15:45:00,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 252 flow [2022-11-25 15:45:00,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:45:00,279 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 168 flow [2022-11-25 15:45:00,280 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2022-11-25 15:45:00,281 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -30 predicate places. [2022-11-25 15:45:00,281 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 168 flow [2022-11-25 15:45:00,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:00,282 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:00,282 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-11-25 15:45:00,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:45:00,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:00,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:00,286 INFO L85 PathProgramCache]: Analyzing trace with hash 37655888, now seen corresponding path program 1 times [2022-11-25 15:45:00,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:00,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400937839] [2022-11-25 15:45:00,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:00,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:00,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:00,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400937839] [2022-11-25 15:45:00,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400937839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:00,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:00,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:45:00,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570878465] [2022-11-25 15:45:00,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:00,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:45:00,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:00,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:45:00,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:45:00,483 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 361 [2022-11-25 15:45:00,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:00,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:00,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 361 [2022-11-25 15:45:00,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:01,756 INFO L130 PetriNetUnfolder]: 4629/7162 cut-off events. [2022-11-25 15:45:01,757 INFO L131 PetriNetUnfolder]: For 1923/1923 co-relation queries the response was YES. [2022-11-25 15:45:01,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19324 conditions, 7162 events. 4629/7162 cut-off events. For 1923/1923 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 43252 event pairs, 3646 based on Foata normal form. 1546/7342 useless extension candidates. Maximal degree in co-relation 19319. Up to 6982 conditions per place. [2022-11-25 15:45:01,817 INFO L137 encePairwiseOnDemand]: 352/361 looper letters, 40 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2022-11-25 15:45:01,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 234 flow [2022-11-25 15:45:01,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2022-11-25 15:45:01,820 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3878116343490305 [2022-11-25 15:45:01,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2022-11-25 15:45:01,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2022-11-25 15:45:01,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:01,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2022-11-25 15:45:01,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:01,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:01,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:01,827 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 168 flow. Second operand 3 states and 420 transitions. [2022-11-25 15:45:01,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 234 flow [2022-11-25 15:45:01,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:45:01,848 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 136 flow [2022-11-25 15:45:01,848 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2022-11-25 15:45:01,849 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -38 predicate places. [2022-11-25 15:45:01,849 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 136 flow [2022-11-25 15:45:01,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:01,850 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:01,850 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 15:45:01,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:45:01,851 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:01,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:01,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1828138962, now seen corresponding path program 1 times [2022-11-25 15:45:01,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:01,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202558429] [2022-11-25 15:45:01,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:01,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:02,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:02,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202558429] [2022-11-25 15:45:02,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202558429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:02,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:02,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:45:02,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201465384] [2022-11-25 15:45:02,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:02,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:45:02,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:02,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:45:02,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:45:02,056 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 361 [2022-11-25 15:45:02,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:02,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:02,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 361 [2022-11-25 15:45:02,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:03,251 INFO L130 PetriNetUnfolder]: 3822/5887 cut-off events. [2022-11-25 15:45:03,251 INFO L131 PetriNetUnfolder]: For 803/803 co-relation queries the response was YES. [2022-11-25 15:45:03,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15154 conditions, 5887 events. 3822/5887 cut-off events. For 803/803 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 35540 event pairs, 924 based on Foata normal form. 0/4503 useless extension candidates. Maximal degree in co-relation 15149. Up to 4990 conditions per place. [2022-11-25 15:45:03,284 INFO L137 encePairwiseOnDemand]: 358/361 looper letters, 67 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2022-11-25 15:45:03,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 366 flow [2022-11-25 15:45:03,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2022-11-25 15:45:03,286 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40166204986149584 [2022-11-25 15:45:03,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2022-11-25 15:45:03,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2022-11-25 15:45:03,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:03,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2022-11-25 15:45:03,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:03,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:03,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:03,292 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 136 flow. Second operand 3 states and 435 transitions. [2022-11-25 15:45:03,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 366 flow [2022-11-25 15:45:03,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 70 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:45:03,294 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 137 flow [2022-11-25 15:45:03,295 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2022-11-25 15:45:03,296 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -38 predicate places. [2022-11-25 15:45:03,296 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 137 flow [2022-11-25 15:45:03,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:03,297 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:03,297 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:03,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:45:03,297 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:03,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:03,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1082958219, now seen corresponding path program 1 times [2022-11-25 15:45:03,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:03,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670458917] [2022-11-25 15:45:03,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:03,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:03,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670458917] [2022-11-25 15:45:03,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670458917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:03,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:03,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:45:03,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435375890] [2022-11-25 15:45:03,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:03,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:45:03,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:03,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:45:03,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:45:03,411 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 361 [2022-11-25 15:45:03,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:03,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:03,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 361 [2022-11-25 15:45:03,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:04,328 INFO L130 PetriNetUnfolder]: 3742/5907 cut-off events. [2022-11-25 15:45:04,328 INFO L131 PetriNetUnfolder]: For 1047/1047 co-relation queries the response was YES. [2022-11-25 15:45:04,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15363 conditions, 5907 events. 3742/5907 cut-off events. For 1047/1047 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 36065 event pairs, 1272 based on Foata normal form. 0/4567 useless extension candidates. Maximal degree in co-relation 15358. Up to 4413 conditions per place. [2022-11-25 15:45:04,366 INFO L137 encePairwiseOnDemand]: 357/361 looper letters, 59 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2022-11-25 15:45:04,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 63 transitions, 335 flow [2022-11-25 15:45:04,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:04,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-11-25 15:45:04,369 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39704524469067404 [2022-11-25 15:45:04,369 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2022-11-25 15:45:04,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2022-11-25 15:45:04,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:04,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2022-11-25 15:45:04,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:04,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:04,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:04,376 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 137 flow. Second operand 3 states and 430 transitions. [2022-11-25 15:45:04,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 63 transitions, 335 flow [2022-11-25 15:45:04,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 63 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:45:04,379 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 146 flow [2022-11-25 15:45:04,380 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2022-11-25 15:45:04,381 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -37 predicate places. [2022-11-25 15:45:04,381 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 146 flow [2022-11-25 15:45:04,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:04,382 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:04,382 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:04,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:45:04,382 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:04,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:04,383 INFO L85 PathProgramCache]: Analyzing trace with hash 788033570, now seen corresponding path program 1 times [2022-11-25 15:45:04,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:04,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249937841] [2022-11-25 15:45:04,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:04,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:05,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:05,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249937841] [2022-11-25 15:45:05,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249937841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:05,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:05,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:45:05,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547392482] [2022-11-25 15:45:05,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:05,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:45:05,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:05,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:45:05,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:45:05,079 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 361 [2022-11-25 15:45:05,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:05,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:05,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 361 [2022-11-25 15:45:05,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:06,416 INFO L130 PetriNetUnfolder]: 5725/8958 cut-off events. [2022-11-25 15:45:06,416 INFO L131 PetriNetUnfolder]: For 1625/1665 co-relation queries the response was YES. [2022-11-25 15:45:06,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23747 conditions, 8958 events. 5725/8958 cut-off events. For 1625/1665 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 59649 event pairs, 1328 based on Foata normal form. 0/7016 useless extension candidates. Maximal degree in co-relation 23741. Up to 4640 conditions per place. [2022-11-25 15:45:06,466 INFO L137 encePairwiseOnDemand]: 357/361 looper letters, 107 selfloop transitions, 5 changer transitions 0/113 dead transitions. [2022-11-25 15:45:06,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 113 transitions, 616 flow [2022-11-25 15:45:06,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:45:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:45:06,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 696 transitions. [2022-11-25 15:45:06,469 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.385595567867036 [2022-11-25 15:45:06,470 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 696 transitions. [2022-11-25 15:45:06,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 696 transitions. [2022-11-25 15:45:06,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:06,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 696 transitions. [2022-11-25 15:45:06,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.2) internal successors, (696), 5 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:06,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:06,478 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:06,478 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 146 flow. Second operand 5 states and 696 transitions. [2022-11-25 15:45:06,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 113 transitions, 616 flow [2022-11-25 15:45:06,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 113 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:45:06,483 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 178 flow [2022-11-25 15:45:06,483 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2022-11-25 15:45:06,484 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -32 predicate places. [2022-11-25 15:45:06,484 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 178 flow [2022-11-25 15:45:06,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:06,485 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:06,485 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:06,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:45:06,486 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:06,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:06,486 INFO L85 PathProgramCache]: Analyzing trace with hash 788033569, now seen corresponding path program 1 times [2022-11-25 15:45:06,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:06,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533544539] [2022-11-25 15:45:06,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:06,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:06,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:06,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533544539] [2022-11-25 15:45:06,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533544539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:06,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:06,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:45:06,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165689391] [2022-11-25 15:45:06,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:06,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:45:06,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:06,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:45:06,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:45:06,737 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 361 [2022-11-25 15:45:06,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:06,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:06,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 361 [2022-11-25 15:45:06,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:07,980 INFO L130 PetriNetUnfolder]: 6274/9943 cut-off events. [2022-11-25 15:45:07,980 INFO L131 PetriNetUnfolder]: For 2942/2942 co-relation queries the response was YES. [2022-11-25 15:45:08,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27051 conditions, 9943 events. 6274/9943 cut-off events. For 2942/2942 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 67657 event pairs, 2949 based on Foata normal form. 84/7981 useless extension candidates. Maximal degree in co-relation 27042. Up to 7146 conditions per place. [2022-11-25 15:45:08,031 INFO L137 encePairwiseOnDemand]: 355/361 looper letters, 50 selfloop transitions, 8 changer transitions 0/59 dead transitions. [2022-11-25 15:45:08,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 340 flow [2022-11-25 15:45:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:08,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2022-11-25 15:45:08,033 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3831948291782087 [2022-11-25 15:45:08,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2022-11-25 15:45:08,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2022-11-25 15:45:08,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:08,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2022-11-25 15:45:08,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:08,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:08,037 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:08,037 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 178 flow. Second operand 3 states and 415 transitions. [2022-11-25 15:45:08,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 340 flow [2022-11-25 15:45:08,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:45:08,050 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 220 flow [2022-11-25 15:45:08,050 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-11-25 15:45:08,051 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -31 predicate places. [2022-11-25 15:45:08,051 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 220 flow [2022-11-25 15:45:08,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:08,052 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:08,052 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:08,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:45:08,052 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:08,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:08,053 INFO L85 PathProgramCache]: Analyzing trace with hash 788028033, now seen corresponding path program 1 times [2022-11-25 15:45:08,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:08,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066328144] [2022-11-25 15:45:08,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:08,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:08,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:08,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:08,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066328144] [2022-11-25 15:45:08,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066328144] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:08,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:08,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:45:08,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737820491] [2022-11-25 15:45:08,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:08,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:45:08,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:08,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:45:08,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:45:08,280 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 361 [2022-11-25 15:45:08,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:08,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:08,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 361 [2022-11-25 15:45:08,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:09,762 INFO L130 PetriNetUnfolder]: 7724/11870 cut-off events. [2022-11-25 15:45:09,762 INFO L131 PetriNetUnfolder]: For 6791/6791 co-relation queries the response was YES. [2022-11-25 15:45:09,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34433 conditions, 11870 events. 7724/11870 cut-off events. For 6791/6791 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 77562 event pairs, 2186 based on Foata normal form. 0/9589 useless extension candidates. Maximal degree in co-relation 34423. Up to 11460 conditions per place. [2022-11-25 15:45:09,827 INFO L137 encePairwiseOnDemand]: 357/361 looper letters, 79 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2022-11-25 15:45:09,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 82 transitions, 558 flow [2022-11-25 15:45:09,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2022-11-25 15:45:09,830 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3961218836565097 [2022-11-25 15:45:09,830 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2022-11-25 15:45:09,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2022-11-25 15:45:09,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:09,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2022-11-25 15:45:09,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:09,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:09,835 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:09,836 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 220 flow. Second operand 3 states and 429 transitions. [2022-11-25 15:45:09,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 82 transitions, 558 flow [2022-11-25 15:45:09,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:45:09,875 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 231 flow [2022-11-25 15:45:09,875 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=231, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2022-11-25 15:45:09,876 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -29 predicate places. [2022-11-25 15:45:09,876 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 231 flow [2022-11-25 15:45:09,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:09,877 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:09,877 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:09,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:45:09,877 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:09,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:09,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1340935525, now seen corresponding path program 1 times [2022-11-25 15:45:09,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:09,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429533764] [2022-11-25 15:45:09,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:09,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:10,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:10,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429533764] [2022-11-25 15:45:10,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429533764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:10,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:10,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:45:10,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975188928] [2022-11-25 15:45:10,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:10,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:45:10,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:10,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:45:10,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:45:10,456 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 361 [2022-11-25 15:45:10,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:10,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:10,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 361 [2022-11-25 15:45:10,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:12,353 INFO L130 PetriNetUnfolder]: 7493/11516 cut-off events. [2022-11-25 15:45:12,353 INFO L131 PetriNetUnfolder]: For 5940/5940 co-relation queries the response was YES. [2022-11-25 15:45:12,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34315 conditions, 11516 events. 7493/11516 cut-off events. For 5940/5940 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 76461 event pairs, 2670 based on Foata normal form. 12/9053 useless extension candidates. Maximal degree in co-relation 34304. Up to 10057 conditions per place. [2022-11-25 15:45:12,426 INFO L137 encePairwiseOnDemand]: 358/361 looper letters, 61 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2022-11-25 15:45:12,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 436 flow [2022-11-25 15:45:12,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2022-11-25 15:45:12,429 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38596491228070173 [2022-11-25 15:45:12,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2022-11-25 15:45:12,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2022-11-25 15:45:12,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:12,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2022-11-25 15:45:12,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,433 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,433 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 231 flow. Second operand 3 states and 418 transitions. [2022-11-25 15:45:12,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 436 flow [2022-11-25 15:45:12,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 432 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:45:12,464 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 245 flow [2022-11-25 15:45:12,465 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2022-11-25 15:45:12,466 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -27 predicate places. [2022-11-25 15:45:12,466 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 245 flow [2022-11-25 15:45:12,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:12,466 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:12,467 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:12,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:45:12,467 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:12,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1337795454, now seen corresponding path program 1 times [2022-11-25 15:45:12,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:12,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274451444] [2022-11-25 15:45:12,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:12,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:13,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:13,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274451444] [2022-11-25 15:45:13,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274451444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:13,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:13,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:45:13,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517258635] [2022-11-25 15:45:13,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:13,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:45:13,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:13,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:45:13,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:45:13,289 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 361 [2022-11-25 15:45:13,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 245 flow. Second operand has 7 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:13,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:13,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 361 [2022-11-25 15:45:13,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:15,492 INFO L130 PetriNetUnfolder]: 8118/12382 cut-off events. [2022-11-25 15:45:15,492 INFO L131 PetriNetUnfolder]: For 7176/7176 co-relation queries the response was YES. [2022-11-25 15:45:15,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37165 conditions, 12382 events. 8118/12382 cut-off events. For 7176/7176 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 81919 event pairs, 1191 based on Foata normal form. 54/9715 useless extension candidates. Maximal degree in co-relation 37153. Up to 4785 conditions per place. [2022-11-25 15:45:15,571 INFO L137 encePairwiseOnDemand]: 345/361 looper letters, 91 selfloop transitions, 38 changer transitions 0/131 dead transitions. [2022-11-25 15:45:15,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 131 transitions, 853 flow [2022-11-25 15:45:15,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 15:45:15,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-25 15:45:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1287 transitions. [2022-11-25 15:45:15,577 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.35650969529085874 [2022-11-25 15:45:15,577 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1287 transitions. [2022-11-25 15:45:15,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1287 transitions. [2022-11-25 15:45:15,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:15,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1287 transitions. [2022-11-25 15:45:15,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 128.7) internal successors, (1287), 10 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:15,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 361.0) internal successors, (3971), 11 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:15,590 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 361.0) internal successors, (3971), 11 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:15,591 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 245 flow. Second operand 10 states and 1287 transitions. [2022-11-25 15:45:15,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 131 transitions, 853 flow [2022-11-25 15:45:15,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 131 transitions, 807 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-25 15:45:15,626 INFO L231 Difference]: Finished difference. Result has 63 places, 74 transitions, 491 flow [2022-11-25 15:45:15,627 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=491, PETRI_PLACES=63, PETRI_TRANSITIONS=74} [2022-11-25 15:45:15,627 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -22 predicate places. [2022-11-25 15:45:15,628 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 74 transitions, 491 flow [2022-11-25 15:45:15,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:15,628 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:15,629 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:15,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:45:15,629 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:15,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:15,630 INFO L85 PathProgramCache]: Analyzing trace with hash 17307440, now seen corresponding path program 1 times [2022-11-25 15:45:15,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:15,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58834806] [2022-11-25 15:45:15,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:15,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:17,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:17,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58834806] [2022-11-25 15:45:17,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58834806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:17,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:17,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:45:17,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030745186] [2022-11-25 15:45:17,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:17,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:45:17,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:17,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:45:17,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:45:17,941 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 361 [2022-11-25 15:45:17,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 74 transitions, 491 flow. Second operand has 8 states, 8 states have (on average 112.625) internal successors, (901), 8 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:17,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:17,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 361 [2022-11-25 15:45:17,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:20,092 INFO L130 PetriNetUnfolder]: 8864/13399 cut-off events. [2022-11-25 15:45:20,093 INFO L131 PetriNetUnfolder]: For 10660/10660 co-relation queries the response was YES. [2022-11-25 15:45:20,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48204 conditions, 13399 events. 8864/13399 cut-off events. For 10660/10660 co-relation queries the response was YES. Maximal size of possible extension queue 1093. Compared 88549 event pairs, 2671 based on Foata normal form. 15/11441 useless extension candidates. Maximal degree in co-relation 48193. Up to 11750 conditions per place. [2022-11-25 15:45:20,182 INFO L137 encePairwiseOnDemand]: 348/361 looper letters, 139 selfloop transitions, 51 changer transitions 0/192 dead transitions. [2022-11-25 15:45:20,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 192 transitions, 1502 flow [2022-11-25 15:45:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 15:45:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 15:45:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1335 transitions. [2022-11-25 15:45:20,188 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.33618735834802316 [2022-11-25 15:45:20,189 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1335 transitions. [2022-11-25 15:45:20,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1335 transitions. [2022-11-25 15:45:20,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:20,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1335 transitions. [2022-11-25 15:45:20,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.36363636363636) internal successors, (1335), 11 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:20,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 361.0) internal successors, (4332), 12 states have internal predecessors, (4332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:20,201 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 361.0) internal successors, (4332), 12 states have internal predecessors, (4332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:20,201 INFO L175 Difference]: Start difference. First operand has 63 places, 74 transitions, 491 flow. Second operand 11 states and 1335 transitions. [2022-11-25 15:45:20,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 192 transitions, 1502 flow [2022-11-25 15:45:20,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 192 transitions, 1501 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:45:20,237 INFO L231 Difference]: Finished difference. Result has 78 places, 117 transitions, 978 flow [2022-11-25 15:45:20,238 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=978, PETRI_PLACES=78, PETRI_TRANSITIONS=117} [2022-11-25 15:45:20,238 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -7 predicate places. [2022-11-25 15:45:20,239 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 117 transitions, 978 flow [2022-11-25 15:45:20,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.625) internal successors, (901), 8 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:20,240 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:20,240 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:20,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:45:20,240 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:20,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:20,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1380711229, now seen corresponding path program 1 times [2022-11-25 15:45:20,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:20,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423984684] [2022-11-25 15:45:20,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:20,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:20,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:20,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423984684] [2022-11-25 15:45:20,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423984684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:20,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:20,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:45:20,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212909758] [2022-11-25 15:45:20,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:20,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:45:20,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:20,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:45:20,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:45:20,524 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 361 [2022-11-25 15:45:20,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 117 transitions, 978 flow. Second operand has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:20,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:20,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 361 [2022-11-25 15:45:20,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:22,280 INFO L130 PetriNetUnfolder]: 7502/11337 cut-off events. [2022-11-25 15:45:22,280 INFO L131 PetriNetUnfolder]: For 17662/17734 co-relation queries the response was YES. [2022-11-25 15:45:22,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46751 conditions, 11337 events. 7502/11337 cut-off events. For 17662/17734 co-relation queries the response was YES. Maximal size of possible extension queue 927. Compared 72746 event pairs, 2273 based on Foata normal form. 151/9829 useless extension candidates. Maximal degree in co-relation 46734. Up to 5121 conditions per place. [2022-11-25 15:45:22,366 INFO L137 encePairwiseOnDemand]: 347/361 looper letters, 104 selfloop transitions, 49 changer transitions 0/155 dead transitions. [2022-11-25 15:45:22,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 155 transitions, 1554 flow [2022-11-25 15:45:22,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:45:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:45:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2022-11-25 15:45:22,370 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3691135734072022 [2022-11-25 15:45:22,370 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2022-11-25 15:45:22,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2022-11-25 15:45:22,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:22,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2022-11-25 15:45:22,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:22,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 361.0) internal successors, (1805), 5 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:22,376 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 361.0) internal successors, (1805), 5 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:22,376 INFO L175 Difference]: Start difference. First operand has 78 places, 117 transitions, 978 flow. Second operand 4 states and 533 transitions. [2022-11-25 15:45:22,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 155 transitions, 1554 flow [2022-11-25 15:45:22,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 155 transitions, 1534 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 15:45:22,511 INFO L231 Difference]: Finished difference. Result has 81 places, 128 transitions, 1257 flow [2022-11-25 15:45:22,512 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1257, PETRI_PLACES=81, PETRI_TRANSITIONS=128} [2022-11-25 15:45:22,512 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -4 predicate places. [2022-11-25 15:45:22,512 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 128 transitions, 1257 flow [2022-11-25 15:45:22,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:22,513 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:22,513 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:22,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:45:22,514 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:22,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:22,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1965745064, now seen corresponding path program 1 times [2022-11-25 15:45:22,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:22,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936367796] [2022-11-25 15:45:22,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:22,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:22,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:22,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936367796] [2022-11-25 15:45:22,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936367796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:22,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:22,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:45:22,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228710809] [2022-11-25 15:45:22,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:22,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:45:22,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:22,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:45:22,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:45:22,766 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 361 [2022-11-25 15:45:22,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 128 transitions, 1257 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:22,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:22,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 361 [2022-11-25 15:45:22,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:23,590 INFO L130 PetriNetUnfolder]: 2310/3887 cut-off events. [2022-11-25 15:45:23,590 INFO L131 PetriNetUnfolder]: For 7818/7825 co-relation queries the response was YES. [2022-11-25 15:45:23,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17321 conditions, 3887 events. 2310/3887 cut-off events. For 7818/7825 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 24287 event pairs, 632 based on Foata normal form. 45/3398 useless extension candidates. Maximal degree in co-relation 17302. Up to 3663 conditions per place. [2022-11-25 15:45:23,614 INFO L137 encePairwiseOnDemand]: 356/361 looper letters, 131 selfloop transitions, 4 changer transitions 0/137 dead transitions. [2022-11-25 15:45:23,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 137 transitions, 1468 flow [2022-11-25 15:45:23,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:23,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-11-25 15:45:23,616 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38411819021237303 [2022-11-25 15:45:23,616 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2022-11-25 15:45:23,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2022-11-25 15:45:23,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:23,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2022-11-25 15:45:23,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:23,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:23,621 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:23,621 INFO L175 Difference]: Start difference. First operand has 81 places, 128 transitions, 1257 flow. Second operand 3 states and 416 transitions. [2022-11-25 15:45:23,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 137 transitions, 1468 flow [2022-11-25 15:45:23,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 137 transitions, 1456 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-11-25 15:45:23,692 INFO L231 Difference]: Finished difference. Result has 83 places, 116 transitions, 1074 flow [2022-11-25 15:45:23,692 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1074, PETRI_PLACES=83, PETRI_TRANSITIONS=116} [2022-11-25 15:45:23,693 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places. [2022-11-25 15:45:23,693 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 116 transitions, 1074 flow [2022-11-25 15:45:23,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:23,694 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:23,694 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:23,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:45:23,694 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:23,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:23,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1202765498, now seen corresponding path program 1 times [2022-11-25 15:45:23,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:23,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797992806] [2022-11-25 15:45:23,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:23,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:23,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:23,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797992806] [2022-11-25 15:45:23,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797992806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:23,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:23,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:45:23,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893655066] [2022-11-25 15:45:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:23,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:45:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:23,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:45:23,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:45:23,963 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 361 [2022-11-25 15:45:23,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 116 transitions, 1074 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:23,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:23,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 361 [2022-11-25 15:45:23,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:25,028 INFO L130 PetriNetUnfolder]: 3688/6274 cut-off events. [2022-11-25 15:45:25,028 INFO L131 PetriNetUnfolder]: For 13656/13656 co-relation queries the response was YES. [2022-11-25 15:45:25,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29368 conditions, 6274 events. 3688/6274 cut-off events. For 13656/13656 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 42521 event pairs, 955 based on Foata normal form. 53/5458 useless extension candidates. Maximal degree in co-relation 29347. Up to 3332 conditions per place. [2022-11-25 15:45:25,066 INFO L137 encePairwiseOnDemand]: 358/361 looper letters, 180 selfloop transitions, 3 changer transitions 0/183 dead transitions. [2022-11-25 15:45:25,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 183 transitions, 2067 flow [2022-11-25 15:45:25,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2022-11-25 15:45:25,069 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39242843951985223 [2022-11-25 15:45:25,069 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2022-11-25 15:45:25,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2022-11-25 15:45:25,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:25,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2022-11-25 15:45:25,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,073 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,074 INFO L175 Difference]: Start difference. First operand has 83 places, 116 transitions, 1074 flow. Second operand 3 states and 425 transitions. [2022-11-25 15:45:25,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 183 transitions, 2067 flow [2022-11-25 15:45:25,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 183 transitions, 2060 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:45:25,205 INFO L231 Difference]: Finished difference. Result has 85 places, 116 transitions, 1081 flow [2022-11-25 15:45:25,205 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1081, PETRI_PLACES=85, PETRI_TRANSITIONS=116} [2022-11-25 15:45:25,206 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, 0 predicate places. [2022-11-25 15:45:25,206 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 116 transitions, 1081 flow [2022-11-25 15:45:25,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,206 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:25,206 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:25,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 15:45:25,207 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:25,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:25,207 INFO L85 PathProgramCache]: Analyzing trace with hash -207261536, now seen corresponding path program 1 times [2022-11-25 15:45:25,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:25,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155902932] [2022-11-25 15:45:25,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:25,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:25,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:25,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155902932] [2022-11-25 15:45:25,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155902932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:25,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:25,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:45:25,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504773276] [2022-11-25 15:45:25,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:25,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:45:25,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:25,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:45:25,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:45:25,514 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 361 [2022-11-25 15:45:25,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 116 transitions, 1081 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:25,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 361 [2022-11-25 15:45:25,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:25,941 INFO L130 PetriNetUnfolder]: 605/1256 cut-off events. [2022-11-25 15:45:25,942 INFO L131 PetriNetUnfolder]: For 2237/2244 co-relation queries the response was YES. [2022-11-25 15:45:25,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5470 conditions, 1256 events. 605/1256 cut-off events. For 2237/2244 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7177 event pairs, 150 based on Foata normal form. 74/1215 useless extension candidates. Maximal degree in co-relation 5448. Up to 830 conditions per place. [2022-11-25 15:45:25,951 INFO L137 encePairwiseOnDemand]: 356/361 looper letters, 93 selfloop transitions, 7 changer transitions 1/103 dead transitions. [2022-11-25 15:45:25,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 103 transitions, 988 flow [2022-11-25 15:45:25,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:45:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:45:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2022-11-25 15:45:25,954 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3815789473684211 [2022-11-25 15:45:25,954 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2022-11-25 15:45:25,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2022-11-25 15:45:25,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:25,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2022-11-25 15:45:25,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 361.0) internal successors, (1805), 5 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,959 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 361.0) internal successors, (1805), 5 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,959 INFO L175 Difference]: Start difference. First operand has 85 places, 116 transitions, 1081 flow. Second operand 4 states and 551 transitions. [2022-11-25 15:45:25,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 103 transitions, 988 flow [2022-11-25 15:45:25,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 103 transitions, 890 flow, removed 35 selfloop flow, removed 7 redundant places. [2022-11-25 15:45:25,974 INFO L231 Difference]: Finished difference. Result has 78 places, 72 transitions, 536 flow [2022-11-25 15:45:25,974 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=536, PETRI_PLACES=78, PETRI_TRANSITIONS=72} [2022-11-25 15:45:25,976 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -7 predicate places. [2022-11-25 15:45:25,976 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 72 transitions, 536 flow [2022-11-25 15:45:25,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,976 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:25,977 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:25,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 15:45:25,977 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:25,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:25,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1200329964, now seen corresponding path program 1 times [2022-11-25 15:45:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:25,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70787637] [2022-11-25 15:45:25,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:25,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:26,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:26,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70787637] [2022-11-25 15:45:26,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70787637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:26,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:26,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:45:26,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226359008] [2022-11-25 15:45:26,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:26,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:45:26,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:26,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:45:26,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:45:26,413 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 361 [2022-11-25 15:45:26,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 72 transitions, 536 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:26,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 361 [2022-11-25 15:45:26,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:26,650 INFO L130 PetriNetUnfolder]: 280/547 cut-off events. [2022-11-25 15:45:26,650 INFO L131 PetriNetUnfolder]: For 1142/1149 co-relation queries the response was YES. [2022-11-25 15:45:26,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2230 conditions, 547 events. 280/547 cut-off events. For 1142/1149 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2354 event pairs, 77 based on Foata normal form. 30/571 useless extension candidates. Maximal degree in co-relation 2212. Up to 217 conditions per place. [2022-11-25 15:45:26,654 INFO L137 encePairwiseOnDemand]: 356/361 looper letters, 60 selfloop transitions, 10 changer transitions 1/73 dead transitions. [2022-11-25 15:45:26,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 73 transitions, 576 flow [2022-11-25 15:45:26,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:45:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:45:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 668 transitions. [2022-11-25 15:45:26,657 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3700831024930748 [2022-11-25 15:45:26,657 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 668 transitions. [2022-11-25 15:45:26,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 668 transitions. [2022-11-25 15:45:26,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:26,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 668 transitions. [2022-11-25 15:45:26,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,663 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,663 INFO L175 Difference]: Start difference. First operand has 78 places, 72 transitions, 536 flow. Second operand 5 states and 668 transitions. [2022-11-25 15:45:26,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 73 transitions, 576 flow [2022-11-25 15:45:26,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 500 flow, removed 10 selfloop flow, removed 13 redundant places. [2022-11-25 15:45:26,668 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 234 flow [2022-11-25 15:45:26,668 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2022-11-25 15:45:26,668 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -25 predicate places. [2022-11-25 15:45:26,668 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 234 flow [2022-11-25 15:45:26,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,669 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:26,669 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:26,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 15:45:26,670 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:26,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:26,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1960790188, now seen corresponding path program 1 times [2022-11-25 15:45:26,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:26,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537524607] [2022-11-25 15:45:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:26,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:30,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:30,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537524607] [2022-11-25 15:45:30,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537524607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:30,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:30,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:45:30,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721851] [2022-11-25 15:45:30,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:30,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:45:30,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:30,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:45:30,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:45:30,830 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 361 [2022-11-25 15:45:30,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 234 flow. Second operand has 9 states, 9 states have (on average 118.22222222222223) internal successors, (1064), 9 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:30,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:30,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 361 [2022-11-25 15:45:30,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:31,941 INFO L130 PetriNetUnfolder]: 371/767 cut-off events. [2022-11-25 15:45:31,941 INFO L131 PetriNetUnfolder]: For 1591/1599 co-relation queries the response was YES. [2022-11-25 15:45:31,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3074 conditions, 767 events. 371/767 cut-off events. For 1591/1599 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3862 event pairs, 73 based on Foata normal form. 10/777 useless extension candidates. Maximal degree in co-relation 3061. Up to 288 conditions per place. [2022-11-25 15:45:31,945 INFO L137 encePairwiseOnDemand]: 353/361 looper letters, 109 selfloop transitions, 17 changer transitions 0/128 dead transitions. [2022-11-25 15:45:31,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 128 transitions, 988 flow [2022-11-25 15:45:31,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:45:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 15:45:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1130 transitions. [2022-11-25 15:45:31,949 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.34779932286857496 [2022-11-25 15:45:31,949 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1130 transitions. [2022-11-25 15:45:31,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1130 transitions. [2022-11-25 15:45:31,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:31,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1130 transitions. [2022-11-25 15:45:31,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.55555555555556) internal successors, (1130), 9 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:31,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 361.0) internal successors, (3610), 10 states have internal predecessors, (3610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:31,958 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 361.0) internal successors, (3610), 10 states have internal predecessors, (3610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:31,958 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 234 flow. Second operand 9 states and 1130 transitions. [2022-11-25 15:45:31,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 128 transitions, 988 flow [2022-11-25 15:45:31,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 128 transitions, 872 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-11-25 15:45:31,966 INFO L231 Difference]: Finished difference. Result has 70 places, 53 transitions, 344 flow [2022-11-25 15:45:31,967 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=344, PETRI_PLACES=70, PETRI_TRANSITIONS=53} [2022-11-25 15:45:31,967 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -15 predicate places. [2022-11-25 15:45:31,967 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 344 flow [2022-11-25 15:45:31,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.22222222222223) internal successors, (1064), 9 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:31,968 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:31,968 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:31,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 15:45:31,969 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:31,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:31,969 INFO L85 PathProgramCache]: Analyzing trace with hash 446049734, now seen corresponding path program 2 times [2022-11-25 15:45:31,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:31,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60307676] [2022-11-25 15:45:31,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:31,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:35,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:35,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60307676] [2022-11-25 15:45:35,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60307676] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:35,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:35,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:45:35,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758032531] [2022-11-25 15:45:35,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:35,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 15:45:35,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:35,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 15:45:35,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:45:36,068 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 361 [2022-11-25 15:45:36,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 344 flow. Second operand has 9 states, 9 states have (on average 118.22222222222223) internal successors, (1064), 9 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:36,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:36,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 361 [2022-11-25 15:45:36,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:37,076 INFO L130 PetriNetUnfolder]: 445/954 cut-off events. [2022-11-25 15:45:37,077 INFO L131 PetriNetUnfolder]: For 2676/2684 co-relation queries the response was YES. [2022-11-25 15:45:37,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4125 conditions, 954 events. 445/954 cut-off events. For 2676/2684 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5286 event pairs, 82 based on Foata normal form. 9/963 useless extension candidates. Maximal degree in co-relation 4106. Up to 352 conditions per place. [2022-11-25 15:45:37,084 INFO L137 encePairwiseOnDemand]: 351/361 looper letters, 120 selfloop transitions, 25 changer transitions 0/147 dead transitions. [2022-11-25 15:45:37,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 147 transitions, 1148 flow [2022-11-25 15:45:37,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 15:45:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-25 15:45:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1485 transitions. [2022-11-25 15:45:37,089 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.342797783933518 [2022-11-25 15:45:37,089 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1485 transitions. [2022-11-25 15:45:37,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1485 transitions. [2022-11-25 15:45:37,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:37,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1485 transitions. [2022-11-25 15:45:37,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 123.75) internal successors, (1485), 12 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:37,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 361.0) internal successors, (4693), 13 states have internal predecessors, (4693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:37,102 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 361.0) internal successors, (4693), 13 states have internal predecessors, (4693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:37,102 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 344 flow. Second operand 12 states and 1485 transitions. [2022-11-25 15:45:37,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 147 transitions, 1148 flow [2022-11-25 15:45:37,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 147 transitions, 1123 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-11-25 15:45:37,117 INFO L231 Difference]: Finished difference. Result has 84 places, 62 transitions, 454 flow [2022-11-25 15:45:37,117 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=454, PETRI_PLACES=84, PETRI_TRANSITIONS=62} [2022-11-25 15:45:37,118 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -1 predicate places. [2022-11-25 15:45:37,118 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 62 transitions, 454 flow [2022-11-25 15:45:37,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.22222222222223) internal successors, (1064), 9 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:37,119 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:37,119 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:37,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 15:45:37,119 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:45:37,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:37,120 INFO L85 PathProgramCache]: Analyzing trace with hash -713833210, now seen corresponding path program 3 times [2022-11-25 15:45:37,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:37,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247415820] [2022-11-25 15:45:37,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:37,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:45:37,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:45:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:45:37,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:45:37,524 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:45:37,525 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (90 of 91 remaining) [2022-11-25 15:45:37,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 91 remaining) [2022-11-25 15:45:37,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 91 remaining) [2022-11-25 15:45:37,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 91 remaining) [2022-11-25 15:45:37,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 91 remaining) [2022-11-25 15:45:37,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 91 remaining) [2022-11-25 15:45:37,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 91 remaining) [2022-11-25 15:45:37,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 91 remaining) [2022-11-25 15:45:37,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 91 remaining) [2022-11-25 15:45:37,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 91 remaining) [2022-11-25 15:45:37,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 91 remaining) [2022-11-25 15:45:37,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 91 remaining) [2022-11-25 15:45:37,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 91 remaining) [2022-11-25 15:45:37,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (77 of 91 remaining) [2022-11-25 15:45:37,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 91 remaining) [2022-11-25 15:45:37,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 91 remaining) [2022-11-25 15:45:37,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 91 remaining) [2022-11-25 15:45:37,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 91 remaining) [2022-11-25 15:45:37,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 91 remaining) [2022-11-25 15:45:37,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 91 remaining) [2022-11-25 15:45:37,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 91 remaining) [2022-11-25 15:45:37,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 91 remaining) [2022-11-25 15:45:37,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 91 remaining) [2022-11-25 15:45:37,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 91 remaining) [2022-11-25 15:45:37,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 91 remaining) [2022-11-25 15:45:37,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 91 remaining) [2022-11-25 15:45:37,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 91 remaining) [2022-11-25 15:45:37,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 91 remaining) [2022-11-25 15:45:37,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 91 remaining) [2022-11-25 15:45:37,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 91 remaining) [2022-11-25 15:45:37,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 91 remaining) [2022-11-25 15:45:37,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 91 remaining) [2022-11-25 15:45:37,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 91 remaining) [2022-11-25 15:45:37,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 91 remaining) [2022-11-25 15:45:37,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 91 remaining) [2022-11-25 15:45:37,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 91 remaining) [2022-11-25 15:45:37,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 91 remaining) [2022-11-25 15:45:37,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 91 remaining) [2022-11-25 15:45:37,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 91 remaining) [2022-11-25 15:45:37,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 91 remaining) [2022-11-25 15:45:37,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 91 remaining) [2022-11-25 15:45:37,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 91 remaining) [2022-11-25 15:45:37,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 91 remaining) [2022-11-25 15:45:37,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 91 remaining) [2022-11-25 15:45:37,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 91 remaining) [2022-11-25 15:45:37,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 91 remaining) [2022-11-25 15:45:37,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 91 remaining) [2022-11-25 15:45:37,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 91 remaining) [2022-11-25 15:45:37,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 91 remaining) [2022-11-25 15:45:37,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 91 remaining) [2022-11-25 15:45:37,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (40 of 91 remaining) [2022-11-25 15:45:37,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 91 remaining) [2022-11-25 15:45:37,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 91 remaining) [2022-11-25 15:45:37,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 91 remaining) [2022-11-25 15:45:37,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 91 remaining) [2022-11-25 15:45:37,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 91 remaining) [2022-11-25 15:45:37,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 91 remaining) [2022-11-25 15:45:37,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 91 remaining) [2022-11-25 15:45:37,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 91 remaining) [2022-11-25 15:45:37,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 91 remaining) [2022-11-25 15:45:37,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 91 remaining) [2022-11-25 15:45:37,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 91 remaining) [2022-11-25 15:45:37,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 91 remaining) [2022-11-25 15:45:37,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 91 remaining) [2022-11-25 15:45:37,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 91 remaining) [2022-11-25 15:45:37,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 91 remaining) [2022-11-25 15:45:37,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 91 remaining) [2022-11-25 15:45:37,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 91 remaining) [2022-11-25 15:45:37,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 91 remaining) [2022-11-25 15:45:37,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 91 remaining) [2022-11-25 15:45:37,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 91 remaining) [2022-11-25 15:45:37,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 91 remaining) [2022-11-25 15:45:37,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 91 remaining) [2022-11-25 15:45:37,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 91 remaining) [2022-11-25 15:45:37,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 91 remaining) [2022-11-25 15:45:37,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 91 remaining) [2022-11-25 15:45:37,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 91 remaining) [2022-11-25 15:45:37,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 91 remaining) [2022-11-25 15:45:37,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 91 remaining) [2022-11-25 15:45:37,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 91 remaining) [2022-11-25 15:45:37,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 91 remaining) [2022-11-25 15:45:37,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 91 remaining) [2022-11-25 15:45:37,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 91 remaining) [2022-11-25 15:45:37,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 91 remaining) [2022-11-25 15:45:37,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 91 remaining) [2022-11-25 15:45:37,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 91 remaining) [2022-11-25 15:45:37,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 91 remaining) [2022-11-25 15:45:37,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 91 remaining) [2022-11-25 15:45:37,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 91 remaining) [2022-11-25 15:45:37,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 91 remaining) [2022-11-25 15:45:37,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 91 remaining) [2022-11-25 15:45:37,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 15:45:37,553 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:37,561 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:45:37,561 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:45:37,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:45:37 BasicIcfg [2022-11-25 15:45:37,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:45:37,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:45:37,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:45:37,710 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:45:37,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:44:27" (3/4) ... [2022-11-25 15:45:37,714 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 15:45:37,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:45:37,715 INFO L158 Benchmark]: Toolchain (without parser) took 72779.82ms. Allocated memory was 180.4MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 135.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2022-11-25 15:45:37,715 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 121.6MB. Free memory was 65.5MB in the beginning and 65.4MB in the end (delta: 116.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:45:37,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 735.99ms. Allocated memory is still 180.4MB. Free memory was 135.0MB in the beginning and 106.6MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 15:45:37,716 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.76ms. Allocated memory is still 180.4MB. Free memory was 106.6MB in the beginning and 104.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:45:37,716 INFO L158 Benchmark]: Boogie Preprocessor took 164.48ms. Allocated memory is still 180.4MB. Free memory was 104.1MB in the beginning and 150.2MB in the end (delta: -46.1MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-11-25 15:45:37,719 INFO L158 Benchmark]: RCFGBuilder took 1881.26ms. Allocated memory is still 180.4MB. Free memory was 150.2MB in the beginning and 78.1MB in the end (delta: 72.1MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. [2022-11-25 15:45:37,720 INFO L158 Benchmark]: TraceAbstraction took 69868.62ms. Allocated memory was 180.4MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 77.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2022-11-25 15:45:37,720 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 3.4GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:45:37,722 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.32ms. Allocated memory is still 121.6MB. Free memory was 65.5MB in the beginning and 65.4MB in the end (delta: 116.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 735.99ms. Allocated memory is still 180.4MB. Free memory was 135.0MB in the beginning and 106.6MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.76ms. Allocated memory is still 180.4MB. Free memory was 106.6MB in the beginning and 104.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 164.48ms. Allocated memory is still 180.4MB. Free memory was 104.1MB in the beginning and 150.2MB in the end (delta: -46.1MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1881.26ms. Allocated memory is still 180.4MB. Free memory was 150.2MB in the beginning and 78.1MB in the end (delta: 72.1MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. * TraceAbstraction took 69868.62ms. Allocated memory was 180.4MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 77.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 3.4GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.6s, 188 PlacesBefore, 85 PlacesAfterwards, 180 TransitionsBefore, 76 TransitionsAfterwards, 7512 CoEnabledTransitionPairs, 7 FixpointIterations, 72 TrivialSequentialCompositions, 101 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 178 TotalNumberOfCompositions, 30254 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12725, independent: 12277, independent conditional: 0, independent unconditional: 12277, dependent: 369, dependent conditional: 0, dependent unconditional: 369, unknown: 79, unknown conditional: 0, unknown unconditional: 79] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4811, independent: 4709, independent conditional: 0, independent unconditional: 4709, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4811, independent: 4082, independent conditional: 0, independent unconditional: 4082, dependent: 729, dependent conditional: 0, dependent unconditional: 729, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 729, independent: 627, independent conditional: 0, independent unconditional: 627, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3293, independent: 2286, independent conditional: 0, independent unconditional: 2286, dependent: 634, dependent conditional: 0, dependent unconditional: 634, unknown: 373, unknown conditional: 0, unknown unconditional: 373] ], Cache Queries: [ total: 12725, independent: 7568, independent conditional: 0, independent unconditional: 7568, dependent: 287, dependent conditional: 0, dependent unconditional: 287, unknown: 4870, unknown conditional: 0, unknown unconditional: 4870] , Statistics on independence cache: Total cache size (in pairs): 789, Positive cache size: 756, Positive conditional cache size: 0, Positive unconditional cache size: 756, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 13, Unknown conditional cache size: 0, Unknown unconditional cache size: 13 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [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_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2257; [L860] FCALL, FORK 0 pthread_create(&t2257, ((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_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$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(&t2257, ((void *)0), P0, ((void *)0))=8, t2257={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L861] 0 pthread_t t2258; 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_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$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, t2257={7:0}, t2258={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L862] FCALL, FORK 0 pthread_create(&t2258, ((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_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$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(&t2258, ((void *)0), P1, ((void *)0))=9, t2257={7:0}, t2258={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L863] 0 pthread_t t2259; 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_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$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, t2257={7:0}, t2258={5:0}, t2259={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L864] FCALL, FORK 0 pthread_create(&t2259, ((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_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$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(&t2259, ((void *)0), P2, ((void *)0))=10, t2257={7:0}, t2258={5:0}, t2259={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] 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)))) [L820] EXPR 3 \read(x) [L820] 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)))) [L820] 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)))) [L821] 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)))) [L822] 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)))) [L823] 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)))) [L824] 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)))) [L825] 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)))) [L826] 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)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 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_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$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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L834] 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_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$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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L837] 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) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] 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) [L837] 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) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 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 [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 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_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$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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 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_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$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=255, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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_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$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=2, weak$$choice1=255, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __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_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$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=2, weak$$choice1=255, 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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 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) [L801] 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) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 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 [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_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_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$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=2, weak$$choice1=255, 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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 3 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] 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) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] 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) [L870] 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) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 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 [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_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_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$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=1, main$tmp_guard1=0, t2257={7:0}, t2258={5:0}, t2259={6:0}, weak$$choice0=2, weak$$choice1=255, 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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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_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$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}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, 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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 857]: 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: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 244 locations, 91 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: 69.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 33.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1462 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1080 mSDsluCounter, 433 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 389 mSDsCounter, 307 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3170 IncrementalHoareTripleChecker+Invalid, 3477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 307 mSolverCounterUnsat, 44 mSDtfsCounter, 3170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1257occurred in iteration=12, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 2735 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 15:45:37,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe020_power.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cd91eb07499c204f7750c4a87fd11eb7780a100da5928fd001cd5e1a53feff12 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:45:40,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:45:40,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:45:40,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:45:40,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:45:40,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:45:40,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:45:40,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:45:40,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:45:40,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:45:40,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:45:40,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:45:40,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:45:40,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:45:40,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:45:40,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:45:40,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:45:40,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:45:40,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:45:40,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:45:40,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:45:40,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:45:40,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:45:40,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:45:40,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:45:40,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:45:40,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:45:40,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:45:40,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:45:40,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:45:40,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:45:40,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:45:40,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:45:40,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:45:40,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:45:40,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:45:40,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:45:40,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:45:40,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:45:40,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:45:40,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:45:40,624 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 15:45:40,667 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:45:40,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:45:40,669 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:45:40,669 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:45:40,670 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:45:40,671 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:45:40,671 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:45:40,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:45:40,672 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:45:40,672 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:45:40,673 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:45:40,674 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:45:40,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:45:40,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:45:40,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:45:40,675 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:45:40,675 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:45:40,675 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:45:40,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:45:40,676 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:45:40,676 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 15:45:40,676 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 15:45:40,676 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:45:40,677 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:45:40,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:45:40,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:45:40,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:45:40,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:45:40,678 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:45:40,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:45:40,678 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 15:45:40,679 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 15:45:40,679 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:45:40,679 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:45:40,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:45:40,680 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 15:45:40,680 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_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cd91eb07499c204f7750c4a87fd11eb7780a100da5928fd001cd5e1a53feff12 [2022-11-25 15:45:41,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:45:41,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:45:41,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:45:41,163 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:45:41,163 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:45:41,165 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe020_power.i [2022-11-25 15:45:44,363 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:45:44,794 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:45:44,799 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/sv-benchmarks/c/pthread-wmm/safe020_power.i [2022-11-25 15:45:44,813 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/data/05659d2da/2357b422847d4a7ab83dca13ee419f2e/FLAG90d81d700 [2022-11-25 15:45:44,845 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/data/05659d2da/2357b422847d4a7ab83dca13ee419f2e [2022-11-25 15:45:44,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:45:44,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:45:44,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:45:44,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:45:44,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:45:44,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:45:44" (1/1) ... [2022-11-25 15:45:44,864 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62be662c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:44, skipping insertion in model container [2022-11-25 15:45:44,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:45:44" (1/1) ... [2022-11-25 15:45:44,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:45:44,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:45:45,137 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_146f9139-67ad-465e-b1c8-c613e4e31745/sv-benchmarks/c/pthread-wmm/safe020_power.i[990,1003] [2022-11-25 15:45:45,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:45:45,536 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:45:45,595 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_146f9139-67ad-465e-b1c8-c613e4e31745/sv-benchmarks/c/pthread-wmm/safe020_power.i[990,1003] [2022-11-25 15:45:45,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:45,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:45,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:45:45,785 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:45:45,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:45 WrapperNode [2022-11-25 15:45:45,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:45:45,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:45:45,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:45:45,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:45:45,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:45" (1/1) ... [2022-11-25 15:45:45,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:45" (1/1) ... [2022-11-25 15:45:45,892 INFO L138 Inliner]: procedures = 180, calls = 77, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2022-11-25 15:45:45,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:45:45,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:45:45,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:45:45,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:45:45,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:45" (1/1) ... [2022-11-25 15:45:45,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:45" (1/1) ... [2022-11-25 15:45:45,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:45" (1/1) ... [2022-11-25 15:45:45,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:45" (1/1) ... [2022-11-25 15:45:45,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:45" (1/1) ... [2022-11-25 15:45:45,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:45" (1/1) ... [2022-11-25 15:45:45,964 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:45" (1/1) ... [2022-11-25 15:45:45,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:45" (1/1) ... [2022-11-25 15:45:45,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:45:45,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:45:45,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:45:45,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:45:45,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:45" (1/1) ... [2022-11-25 15:45:46,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:45:46,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:46,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:45:46,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:45:46,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 15:45:46,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:45:46,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:45:46,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:45:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:45:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 15:45:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 15:45:46,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-25 15:45:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 15:45:46,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 15:45:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 15:45:46,117 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 15:45:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 15:45:46,118 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 15:45:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:45:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:45:46,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:45:46,121 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:45:46,415 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:45:46,418 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:45:47,421 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:45:48,233 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:45:48,234 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:45:48,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:45:48 BoogieIcfgContainer [2022-11-25 15:45:48,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:45:48,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:45:48,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:45:48,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:45:48,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:45:44" (1/3) ... [2022-11-25 15:45:48,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38bebac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:45:48, skipping insertion in model container [2022-11-25 15:45:48,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:45" (2/3) ... [2022-11-25 15:45:48,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38bebac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:45:48, skipping insertion in model container [2022-11-25 15:45:48,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:45:48" (3/3) ... [2022-11-25 15:45:48,250 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_power.i [2022-11-25 15:45:48,276 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:45:48,276 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 51 error locations. [2022-11-25 15:45:48,277 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:45:48,494 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:45:48,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 184 transitions, 383 flow [2022-11-25 15:45:48,638 INFO L130 PetriNetUnfolder]: 2/181 cut-off events. [2022-11-25 15:45:48,639 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:48,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 181 events. 2/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 295 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-11-25 15:45:48,650 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 184 transitions, 383 flow [2022-11-25 15:45:48,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 181 transitions, 371 flow [2022-11-25 15:45:48,683 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:45:48,699 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 181 transitions, 371 flow [2022-11-25 15:45:48,702 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 181 transitions, 371 flow [2022-11-25 15:45:48,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 181 transitions, 371 flow [2022-11-25 15:45:48,767 INFO L130 PetriNetUnfolder]: 2/181 cut-off events. [2022-11-25 15:45:48,767 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:48,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 181 events. 2/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 294 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-11-25 15:45:48,773 INFO L119 LiptonReduction]: Number of co-enabled transitions 7512 [2022-11-25 15:46:07,914 WARN L233 SmtUtils]: Spent 5.28s on a formula simplification. DAG size of input: 189 DAG size of output: 186 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 15:46:17,557 WARN L233 SmtUtils]: Spent 7.11s on a formula simplification. DAG size of input: 219 DAG size of output: 216 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-25 15:46:34,962 INFO L134 LiptonReduction]: Checked pairs total: 33048 [2022-11-25 15:46:34,962 INFO L136 LiptonReduction]: Total number of compositions: 178 [2022-11-25 15:46:34,980 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:46:34,986 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;@49ee08f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:46:34,986 INFO L358 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2022-11-25 15:46:34,989 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 15:46:34,990 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:46:34,990 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:46:34,991 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 15:46:34,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:46:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:34,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1229, now seen corresponding path program 1 times [2022-11-25 15:46:35,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:46:35,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454662082] [2022-11-25 15:46:35,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:35,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:35,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:46:35,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:46:35,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 15:46:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:35,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 15:46:35,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:35,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:46:35,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:46:35,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454662082] [2022-11-25 15:46:35,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454662082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:35,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:35,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 15:46:35,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605772499] [2022-11-25 15:46:35,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:35,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:46:35,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:46:35,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:46:35,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:46:35,371 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 362 [2022-11-25 15:46:35,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 161 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:35,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:46:35,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 362 [2022-11-25 15:46:35,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:46:42,100 INFO L130 PetriNetUnfolder]: 20995/29330 cut-off events. [2022-11-25 15:46:42,100 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-25 15:46:42,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58733 conditions, 29330 events. 20995/29330 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 2330. Compared 191895 event pairs, 20995 based on Foata normal form. 0/12746 useless extension candidates. Maximal degree in co-relation 58722. Up to 29277 conditions per place. [2022-11-25 15:46:42,326 INFO L137 encePairwiseOnDemand]: 331/362 looper letters, 44 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2022-11-25 15:46:42,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 187 flow [2022-11-25 15:46:42,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:46:42,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 15:46:42,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 331 transitions. [2022-11-25 15:46:42,353 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.457182320441989 [2022-11-25 15:46:42,354 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 331 transitions. [2022-11-25 15:46:42,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 331 transitions. [2022-11-25 15:46:42,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:46:42,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 331 transitions. [2022-11-25 15:46:42,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 165.5) internal successors, (331), 2 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:42,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:42,375 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:42,377 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 161 flow. Second operand 2 states and 331 transitions. [2022-11-25 15:46:42,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 187 flow [2022-11-25 15:46:42,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 15:46:42,391 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 96 flow [2022-11-25 15:46:42,394 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2022-11-25 15:46:42,398 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -32 predicate places. [2022-11-25 15:46:42,399 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 96 flow [2022-11-25 15:46:42,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:42,399 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:46:42,400 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-11-25 15:46:42,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:42,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:42,622 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:46:42,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:42,632 INFO L85 PathProgramCache]: Analyzing trace with hash 37600089, now seen corresponding path program 1 times [2022-11-25 15:46:42,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:46:42,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704818048] [2022-11-25 15:46:42,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:42,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:42,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:46:42,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:46:42,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 15:46:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:42,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:46:42,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:42,948 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 15:46:42,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 15:46:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:42,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:46:42,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:46:42,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704818048] [2022-11-25 15:46:42,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704818048] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:42,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:42,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:46:42,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550997938] [2022-11-25 15:46:42,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:42,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:46:42,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:46:42,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:46:42,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:46:43,073 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 362 [2022-11-25 15:46:43,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:43,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:46:43,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 362 [2022-11-25 15:46:43,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:46:46,337 INFO L130 PetriNetUnfolder]: 10855/15376 cut-off events. [2022-11-25 15:46:46,338 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:46:46,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30802 conditions, 15376 events. 10855/15376 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 92894 event pairs, 6679 based on Foata normal form. 0/7960 useless extension candidates. Maximal degree in co-relation 30799. Up to 7812 conditions per place. [2022-11-25 15:46:46,428 INFO L137 encePairwiseOnDemand]: 352/362 looper letters, 56 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2022-11-25 15:46:46,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 240 flow [2022-11-25 15:46:46,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:46:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:46:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2022-11-25 15:46:46,433 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40607734806629836 [2022-11-25 15:46:46,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2022-11-25 15:46:46,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2022-11-25 15:46:46,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:46:46,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2022-11-25 15:46:46,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:46,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:46,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:46,444 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 96 flow. Second operand 3 states and 441 transitions. [2022-11-25 15:46:46,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 240 flow [2022-11-25 15:46:46,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 240 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:46:46,447 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 110 flow [2022-11-25 15:46:46,448 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-11-25 15:46:46,449 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -31 predicate places. [2022-11-25 15:46:46,449 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 110 flow [2022-11-25 15:46:46,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:46,451 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:46:46,451 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-11-25 15:46:46,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:46,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:46,666 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:46:46,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:46,667 INFO L85 PathProgramCache]: Analyzing trace with hash 37600090, now seen corresponding path program 1 times [2022-11-25 15:46:46,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:46:46,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523831328] [2022-11-25 15:46:46,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:46,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:46,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:46:46,675 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:46:46,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 15:46:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:46,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 15:46:46,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:46,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 15:46:46,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 15:46:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:46,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:46:46,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:46:46,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523831328] [2022-11-25 15:46:47,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523831328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:47,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:47,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:46:47,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49605401] [2022-11-25 15:46:47,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:47,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:46:47,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:46:47,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:46:47,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:46:47,093 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 362 [2022-11-25 15:46:47,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:47,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:46:47,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 362 [2022-11-25 15:46:47,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:46:48,338 INFO L130 PetriNetUnfolder]: 3610/5243 cut-off events. [2022-11-25 15:46:48,339 INFO L131 PetriNetUnfolder]: For 413/413 co-relation queries the response was YES. [2022-11-25 15:46:48,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11578 conditions, 5243 events. 3610/5243 cut-off events. For 413/413 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 27108 event pairs, 3610 based on Foata normal form. 0/4194 useless extension candidates. Maximal degree in co-relation 11573. Up to 5223 conditions per place. [2022-11-25 15:46:48,380 INFO L137 encePairwiseOnDemand]: 353/362 looper letters, 33 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2022-11-25 15:46:48,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 35 transitions, 162 flow [2022-11-25 15:46:48,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:46:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:46:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2022-11-25 15:46:48,383 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39226519337016574 [2022-11-25 15:46:48,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2022-11-25 15:46:48,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2022-11-25 15:46:48,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:46:48,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2022-11-25 15:46:48,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:48,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:48,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:48,390 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 110 flow. Second operand 3 states and 426 transitions. [2022-11-25 15:46:48,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 35 transitions, 162 flow [2022-11-25 15:46:48,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 35 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:46:48,395 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 92 flow [2022-11-25 15:46:48,396 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2022-11-25 15:46:48,397 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -39 predicate places. [2022-11-25 15:46:48,397 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 92 flow [2022-11-25 15:46:48,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:48,398 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:46:48,398 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 15:46:48,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:48,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:48,613 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:46:48,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:48,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1774591982, now seen corresponding path program 1 times [2022-11-25 15:46:48,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:46:48,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726097035] [2022-11-25 15:46:48,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:48,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:48,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:46:48,619 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:46:48,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 15:46:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:48,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:46:48,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:48,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:46:48,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:46:48,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726097035] [2022-11-25 15:46:48,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726097035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:48,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:48,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:46:48,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746866137] [2022-11-25 15:46:48,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:48,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:46:48,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:46:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:46:48,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:46:48,925 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 362 [2022-11-25 15:46:48,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:48,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:46:48,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 362 [2022-11-25 15:46:48,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:46:50,230 INFO L130 PetriNetUnfolder]: 2972/4325 cut-off events. [2022-11-25 15:46:50,231 INFO L131 PetriNetUnfolder]: For 291/291 co-relation queries the response was YES. [2022-11-25 15:46:50,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9566 conditions, 4325 events. 2972/4325 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 23095 event pairs, 656 based on Foata normal form. 0/3659 useless extension candidates. Maximal degree in co-relation 9561. Up to 3661 conditions per place. [2022-11-25 15:46:50,258 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 54 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2022-11-25 15:46:50,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 259 flow [2022-11-25 15:46:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:46:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:46:50,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2022-11-25 15:46:50,262 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40331491712707185 [2022-11-25 15:46:50,263 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2022-11-25 15:46:50,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2022-11-25 15:46:50,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:46:50,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2022-11-25 15:46:50,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:50,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:50,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:50,271 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 92 flow. Second operand 3 states and 438 transitions. [2022-11-25 15:46:50,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 259 flow [2022-11-25 15:46:50,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:46:50,274 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 93 flow [2022-11-25 15:46:50,274 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2022-11-25 15:46:50,275 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -39 predicate places. [2022-11-25 15:46:50,275 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 93 flow [2022-11-25 15:46:50,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:50,276 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:46:50,277 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:50,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-11-25 15:46:50,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:50,490 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:46:50,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:50,491 INFO L85 PathProgramCache]: Analyzing trace with hash -588565224, now seen corresponding path program 1 times [2022-11-25 15:46:50,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:46:50,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941544592] [2022-11-25 15:46:50,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:50,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:50,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:46:50,500 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:46:50,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 15:46:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:50,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:46:50,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:50,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:50,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:46:50,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:46:50,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941544592] [2022-11-25 15:46:50,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941544592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:50,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:50,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:46:50,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107808223] [2022-11-25 15:46:50,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:50,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:46:50,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:46:50,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:46:50,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:46:50,841 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 362 [2022-11-25 15:46:50,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:50,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:46:50,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 362 [2022-11-25 15:46:50,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:46:51,633 INFO L130 PetriNetUnfolder]: 1139/1855 cut-off events. [2022-11-25 15:46:51,634 INFO L131 PetriNetUnfolder]: For 221/221 co-relation queries the response was YES. [2022-11-25 15:46:51,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4157 conditions, 1855 events. 1139/1855 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 9279 event pairs, 408 based on Foata normal form. 27/1596 useless extension candidates. Maximal degree in co-relation 4152. Up to 1713 conditions per place. [2022-11-25 15:46:51,647 INFO L137 encePairwiseOnDemand]: 357/362 looper letters, 44 selfloop transitions, 4 changer transitions 0/49 dead transitions. [2022-11-25 15:46:51,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 225 flow [2022-11-25 15:46:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:46:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:46:51,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-11-25 15:46:51,651 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3876611418047882 [2022-11-25 15:46:51,651 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2022-11-25 15:46:51,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2022-11-25 15:46:51,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:46:51,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2022-11-25 15:46:51,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:51,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:51,663 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:51,663 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 93 flow. Second operand 3 states and 421 transitions. [2022-11-25 15:46:51,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 225 flow [2022-11-25 15:46:51,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 219 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:46:51,668 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 115 flow [2022-11-25 15:46:51,668 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2022-11-25 15:46:51,672 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -38 predicate places. [2022-11-25 15:46:51,672 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 115 flow [2022-11-25 15:46:51,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:51,673 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:46:51,673 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:51,692 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:51,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:51,886 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:46:51,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1045284535, now seen corresponding path program 1 times [2022-11-25 15:46:51,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:46:51,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245143912] [2022-11-25 15:46:51,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:51,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:51,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:46:51,889 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:46:51,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 15:46:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:52,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:46:52,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:52,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:52,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:46:52,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:46:52,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245143912] [2022-11-25 15:46:52,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245143912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:52,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:52,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:46:52,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594386385] [2022-11-25 15:46:52,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:52,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:46:52,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:46:52,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:46:52,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:46:52,261 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 362 [2022-11-25 15:46:52,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:52,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:46:52,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 362 [2022-11-25 15:46:52,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:46:52,794 INFO L130 PetriNetUnfolder]: 270/528 cut-off events. [2022-11-25 15:46:52,794 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-11-25 15:46:52,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 528 events. 270/528 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2108 event pairs, 98 based on Foata normal form. 27/500 useless extension candidates. Maximal degree in co-relation 1288. Up to 269 conditions per place. [2022-11-25 15:46:52,796 INFO L137 encePairwiseOnDemand]: 357/362 looper letters, 53 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2022-11-25 15:46:52,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 295 flow [2022-11-25 15:46:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:46:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:46:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2022-11-25 15:46:52,802 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3846685082872928 [2022-11-25 15:46:52,802 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2022-11-25 15:46:52,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2022-11-25 15:46:52,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:46:52,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2022-11-25 15:46:52,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:52,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 362.0) internal successors, (1810), 5 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:52,812 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 362.0) internal successors, (1810), 5 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:52,812 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 115 flow. Second operand 4 states and 557 transitions. [2022-11-25 15:46:52,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 295 flow [2022-11-25 15:46:52,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:46:52,819 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 151 flow [2022-11-25 15:46:52,820 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-11-25 15:46:52,823 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -35 predicate places. [2022-11-25 15:46:52,823 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 151 flow [2022-11-25 15:46:52,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:52,826 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:46:52,826 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:52,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:53,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:53,042 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:46:53,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:53,043 INFO L85 PathProgramCache]: Analyzing trace with hash -471587006, now seen corresponding path program 1 times [2022-11-25 15:46:53,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:46:53,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891275148] [2022-11-25 15:46:53,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:53,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:53,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:46:53,045 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:46:53,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 15:46:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:53,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 15:46:53,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:53,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:46:53,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:46:53,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891275148] [2022-11-25 15:46:53,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891275148] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:53,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:53,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:46:53,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302691796] [2022-11-25 15:46:53,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:53,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:46:53,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:46:53,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:46:53,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:46:53,402 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 362 [2022-11-25 15:46:53,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:53,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:46:53,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 362 [2022-11-25 15:46:53,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:46:53,978 INFO L130 PetriNetUnfolder]: 162/306 cut-off events. [2022-11-25 15:46:53,978 INFO L131 PetriNetUnfolder]: For 234/234 co-relation queries the response was YES. [2022-11-25 15:46:53,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 306 events. 162/306 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1024 event pairs, 70 based on Foata normal form. 9/310 useless extension candidates. Maximal degree in co-relation 825. Up to 134 conditions per place. [2022-11-25 15:46:53,980 INFO L137 encePairwiseOnDemand]: 357/362 looper letters, 43 selfloop transitions, 10 changer transitions 1/55 dead transitions. [2022-11-25 15:46:53,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 283 flow [2022-11-25 15:46:53,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:46:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:46:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 675 transitions. [2022-11-25 15:46:53,985 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3729281767955801 [2022-11-25 15:46:53,985 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 675 transitions. [2022-11-25 15:46:53,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 675 transitions. [2022-11-25 15:46:53,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:46:53,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 675 transitions. [2022-11-25 15:46:53,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:53,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 362.0) internal successors, (2172), 6 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:53,994 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 362.0) internal successors, (2172), 6 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:53,995 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 151 flow. Second operand 5 states and 675 transitions. [2022-11-25 15:46:53,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 283 flow [2022-11-25 15:46:53,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 267 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-11-25 15:46:53,999 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2022-11-25 15:46:53,999 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-11-25 15:46:54,000 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -39 predicate places. [2022-11-25 15:46:54,001 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2022-11-25 15:46:54,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:46:54,002 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:46:54,002 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:46:54,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 15:46:54,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:54,228 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:46:54,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:46:54,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1247670539, now seen corresponding path program 1 times [2022-11-25 15:46:54,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:46:54,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358438261] [2022-11-25 15:46:54,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:46:54,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:46:54,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:46:54,234 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:46:54,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 15:46:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:46:54,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:46:54,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:46:59,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-25 15:46:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:46:59,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:46:59,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:46:59,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358438261] [2022-11-25 15:46:59,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358438261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:46:59,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:46:59,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:46:59,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433729807] [2022-11-25 15:46:59,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:46:59,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:46:59,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:46:59,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:46:59,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:47:00,222 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 362 [2022-11-25 15:47:00,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 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-11-25 15:47:00,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:47:00,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 362 [2022-11-25 15:47:00,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:47:00,871 INFO L130 PetriNetUnfolder]: 230/444 cut-off events. [2022-11-25 15:47:00,871 INFO L131 PetriNetUnfolder]: For 479/479 co-relation queries the response was YES. [2022-11-25 15:47:00,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 444 events. 230/444 cut-off events. For 479/479 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1766 event pairs, 78 based on Foata normal form. 0/440 useless extension candidates. Maximal degree in co-relation 1279. Up to 127 conditions per place. [2022-11-25 15:47:00,873 INFO L137 encePairwiseOnDemand]: 355/362 looper letters, 69 selfloop transitions, 12 changer transitions 0/82 dead transitions. [2022-11-25 15:47:00,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 82 transitions, 533 flow [2022-11-25 15:47:00,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:47:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:47:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1025 transitions. [2022-11-25 15:47:00,877 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3539364640883978 [2022-11-25 15:47:00,878 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1025 transitions. [2022-11-25 15:47:00,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1025 transitions. [2022-11-25 15:47:00,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:47:00,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1025 transitions. [2022-11-25 15:47:00,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.125) internal successors, (1025), 8 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:00,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 362.0) internal successors, (3258), 9 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:00,887 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 362.0) internal successors, (3258), 9 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:00,887 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 8 states and 1025 transitions. [2022-11-25 15:47:00,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 82 transitions, 533 flow [2022-11-25 15:47:00,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 82 transitions, 463 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-11-25 15:47:00,892 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 164 flow [2022-11-25 15:47:00,892 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=164, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-11-25 15:47:00,893 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -35 predicate places. [2022-11-25 15:47:00,893 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 164 flow [2022-11-25 15:47:00,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.16666666666667) internal successors, (739), 6 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-11-25 15:47:00,894 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:47:00,894 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:00,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 15:47:01,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:47:01,099 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:47:01,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1502112910, now seen corresponding path program 1 times [2022-11-25 15:47:01,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:47:01,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [571890708] [2022-11-25 15:47:01,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:01,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:47:01,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:47:01,101 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:47:01,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 15:47:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:01,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 15:47:01,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:47:01,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-25 15:47:01,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-25 15:47:02,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-11-25 15:47:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:47:02,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:47:02,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:47:02,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [571890708] [2022-11-25 15:47:02,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [571890708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:02,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:02,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:47:02,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447059202] [2022-11-25 15:47:02,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:02,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:47:02,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:47:02,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:47:02,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:47:02,503 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 362 [2022-11-25 15:47:02,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:02,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:47:02,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 362 [2022-11-25 15:47:02,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:47:03,015 INFO L130 PetriNetUnfolder]: 229/444 cut-off events. [2022-11-25 15:47:03,015 INFO L131 PetriNetUnfolder]: For 440/440 co-relation queries the response was YES. [2022-11-25 15:47:03,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 444 events. 229/444 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1772 event pairs, 78 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 1417. Up to 127 conditions per place. [2022-11-25 15:47:03,018 INFO L137 encePairwiseOnDemand]: 356/362 looper letters, 71 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2022-11-25 15:47:03,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 82 transitions, 514 flow [2022-11-25 15:47:03,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:47:03,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:47:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1065 transitions. [2022-11-25 15:47:03,022 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3677486187845304 [2022-11-25 15:47:03,022 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1065 transitions. [2022-11-25 15:47:03,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1065 transitions. [2022-11-25 15:47:03,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:47:03,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1065 transitions. [2022-11-25 15:47:03,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.125) internal successors, (1065), 8 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:03,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 362.0) internal successors, (3258), 9 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:03,031 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 362.0) internal successors, (3258), 9 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:03,031 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 164 flow. Second operand 8 states and 1065 transitions. [2022-11-25 15:47:03,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 82 transitions, 514 flow [2022-11-25 15:47:03,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 513 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:47:03,035 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 181 flow [2022-11-25 15:47:03,035 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=181, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2022-11-25 15:47:03,036 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -30 predicate places. [2022-11-25 15:47:03,036 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 181 flow [2022-11-25 15:47:03,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:03,037 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:47:03,037 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:03,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 15:47:03,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:47:03,247 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:47:03,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:03,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1264089795, now seen corresponding path program 1 times [2022-11-25 15:47:03,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:47:03,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450883267] [2022-11-25 15:47:03,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:47:03,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:47:03,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:47:03,249 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:47:03,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-25 15:47:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:47:03,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 15:47:03,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:47:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:47:03,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:47:03,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:47:03,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450883267] [2022-11-25 15:47:03,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450883267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:03,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:03,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:47:03,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278482613] [2022-11-25 15:47:03,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:03,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:47:03,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:47:03,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:47:03,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:47:03,555 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 362 [2022-11-25 15:47:03,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:03,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:47:03,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 362 [2022-11-25 15:47:03,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:47:03,863 INFO L130 PetriNetUnfolder]: 336/638 cut-off events. [2022-11-25 15:47:03,864 INFO L131 PetriNetUnfolder]: For 917/917 co-relation queries the response was YES. [2022-11-25 15:47:03,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2219 conditions, 638 events. 336/638 cut-off events. For 917/917 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2747 event pairs, 149 based on Foata normal form. 0/636 useless extension candidates. Maximal degree in co-relation 2210. Up to 441 conditions per place. [2022-11-25 15:47:03,867 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 60 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2022-11-25 15:47:03,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 414 flow [2022-11-25 15:47:03,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:47:03,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:47:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2022-11-25 15:47:03,870 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3821362799263352 [2022-11-25 15:47:03,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2022-11-25 15:47:03,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2022-11-25 15:47:03,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:47:03,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2022-11-25 15:47:03,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:03,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:03,874 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:03,874 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 181 flow. Second operand 3 states and 415 transitions. [2022-11-25 15:47:03,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 414 flow [2022-11-25 15:47:03,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 62 transitions, 388 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-25 15:47:03,879 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 174 flow [2022-11-25 15:47:03,880 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2022-11-25 15:47:03,880 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -33 predicate places. [2022-11-25 15:47:03,880 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 174 flow [2022-11-25 15:47:03,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:03,881 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:47:03,881 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:03,901 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-25 15:47:04,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:47:04,082 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:47:04,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:04,082 INFO L85 PathProgramCache]: Analyzing trace with hash 490637117, now seen corresponding path program 2 times [2022-11-25 15:47:04,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:47:04,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217554722] [2022-11-25 15:47:04,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 15:47:04,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:47:04,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:47:04,084 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:47:04,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-25 15:47:04,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 15:47:04,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 15:47:04,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-25 15:47:04,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:47:04,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 15:47:12,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 36 [2022-11-25 15:47:12,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-25 15:47:12,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 15:47:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:47:12,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 15:47:12,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 15:47:12,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217554722] [2022-11-25 15:47:12,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217554722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:47:12,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:47:12,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:47:12,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355087334] [2022-11-25 15:47:12,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:47:12,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:47:12,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 15:47:12,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:47:12,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:47:14,210 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 362 [2022-11-25 15:47:14,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 174 flow. Second operand has 7 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:14,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:47:14,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 362 [2022-11-25 15:47:14,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:47:15,562 INFO L130 PetriNetUnfolder]: 452/937 cut-off events. [2022-11-25 15:47:15,562 INFO L131 PetriNetUnfolder]: For 1125/1125 co-relation queries the response was YES. [2022-11-25 15:47:15,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3220 conditions, 937 events. 452/937 cut-off events. For 1125/1125 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5091 event pairs, 97 based on Foata normal form. 1/938 useless extension candidates. Maximal degree in co-relation 3210. Up to 314 conditions per place. [2022-11-25 15:47:15,567 INFO L137 encePairwiseOnDemand]: 354/362 looper letters, 102 selfloop transitions, 13 changer transitions 0/116 dead transitions. [2022-11-25 15:47:15,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 116 transitions, 748 flow [2022-11-25 15:47:15,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:47:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:47:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 888 transitions. [2022-11-25 15:47:15,571 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.35043409629044986 [2022-11-25 15:47:15,571 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 888 transitions. [2022-11-25 15:47:15,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 888 transitions. [2022-11-25 15:47:15,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:47:15,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 888 transitions. [2022-11-25 15:47:15,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:15,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 362.0) internal successors, (2896), 8 states have internal predecessors, (2896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:15,580 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 362.0) internal successors, (2896), 8 states have internal predecessors, (2896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:15,580 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 174 flow. Second operand 7 states and 888 transitions. [2022-11-25 15:47:15,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 116 transitions, 748 flow [2022-11-25 15:47:15,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 116 transitions, 743 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:47:15,590 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 257 flow [2022-11-25 15:47:15,591 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=257, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2022-11-25 15:47:15,591 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -24 predicate places. [2022-11-25 15:47:15,592 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 257 flow [2022-11-25 15:47:15,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.85714285714286) internal successors, (832), 7 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:47:15,593 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:47:15,593 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:15,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-25 15:47:15,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:47:15,809 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2022-11-25 15:47:15,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:47:15,809 INFO L85 PathProgramCache]: Analyzing trace with hash 506318905, now seen corresponding path program 3 times [2022-11-25 15:47:15,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 15:47:15,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443774040] [2022-11-25 15:47:15,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 15:47:15,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:47:15,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 15:47:15,811 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 15:47:15,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 15:47:16,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 15:47:16,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 15:47:16,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:47:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:47:16,538 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 15:47:16,538 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:47:16,539 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (90 of 91 remaining) [2022-11-25 15:47:16,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 91 remaining) [2022-11-25 15:47:16,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 91 remaining) [2022-11-25 15:47:16,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 91 remaining) [2022-11-25 15:47:16,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 91 remaining) [2022-11-25 15:47:16,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 91 remaining) [2022-11-25 15:47:16,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 91 remaining) [2022-11-25 15:47:16,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 91 remaining) [2022-11-25 15:47:16,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 91 remaining) [2022-11-25 15:47:16,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 91 remaining) [2022-11-25 15:47:16,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 91 remaining) [2022-11-25 15:47:16,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 91 remaining) [2022-11-25 15:47:16,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 91 remaining) [2022-11-25 15:47:16,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (77 of 91 remaining) [2022-11-25 15:47:16,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 91 remaining) [2022-11-25 15:47:16,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 91 remaining) [2022-11-25 15:47:16,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 91 remaining) [2022-11-25 15:47:16,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 91 remaining) [2022-11-25 15:47:16,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 91 remaining) [2022-11-25 15:47:16,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 91 remaining) [2022-11-25 15:47:16,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 91 remaining) [2022-11-25 15:47:16,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 91 remaining) [2022-11-25 15:47:16,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 91 remaining) [2022-11-25 15:47:16,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 91 remaining) [2022-11-25 15:47:16,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 91 remaining) [2022-11-25 15:47:16,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 91 remaining) [2022-11-25 15:47:16,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 91 remaining) [2022-11-25 15:47:16,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 91 remaining) [2022-11-25 15:47:16,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 91 remaining) [2022-11-25 15:47:16,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 91 remaining) [2022-11-25 15:47:16,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 91 remaining) [2022-11-25 15:47:16,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 91 remaining) [2022-11-25 15:47:16,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 91 remaining) [2022-11-25 15:47:16,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 91 remaining) [2022-11-25 15:47:16,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 91 remaining) [2022-11-25 15:47:16,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 91 remaining) [2022-11-25 15:47:16,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 91 remaining) [2022-11-25 15:47:16,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 91 remaining) [2022-11-25 15:47:16,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 91 remaining) [2022-11-25 15:47:16,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 91 remaining) [2022-11-25 15:47:16,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 91 remaining) [2022-11-25 15:47:16,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 91 remaining) [2022-11-25 15:47:16,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 91 remaining) [2022-11-25 15:47:16,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 91 remaining) [2022-11-25 15:47:16,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 91 remaining) [2022-11-25 15:47:16,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 91 remaining) [2022-11-25 15:47:16,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 91 remaining) [2022-11-25 15:47:16,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 91 remaining) [2022-11-25 15:47:16,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 91 remaining) [2022-11-25 15:47:16,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 91 remaining) [2022-11-25 15:47:16,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (40 of 91 remaining) [2022-11-25 15:47:16,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 91 remaining) [2022-11-25 15:47:16,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 91 remaining) [2022-11-25 15:47:16,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 91 remaining) [2022-11-25 15:47:16,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 91 remaining) [2022-11-25 15:47:16,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 91 remaining) [2022-11-25 15:47:16,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 91 remaining) [2022-11-25 15:47:16,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 91 remaining) [2022-11-25 15:47:16,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 91 remaining) [2022-11-25 15:47:16,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 91 remaining) [2022-11-25 15:47:16,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 91 remaining) [2022-11-25 15:47:16,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 91 remaining) [2022-11-25 15:47:16,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 91 remaining) [2022-11-25 15:47:16,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 91 remaining) [2022-11-25 15:47:16,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 91 remaining) [2022-11-25 15:47:16,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 91 remaining) [2022-11-25 15:47:16,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 91 remaining) [2022-11-25 15:47:16,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 91 remaining) [2022-11-25 15:47:16,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 91 remaining) [2022-11-25 15:47:16,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 91 remaining) [2022-11-25 15:47:16,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 91 remaining) [2022-11-25 15:47:16,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 91 remaining) [2022-11-25 15:47:16,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 91 remaining) [2022-11-25 15:47:16,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 91 remaining) [2022-11-25 15:47:16,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 91 remaining) [2022-11-25 15:47:16,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 91 remaining) [2022-11-25 15:47:16,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 91 remaining) [2022-11-25 15:47:16,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 91 remaining) [2022-11-25 15:47:16,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 91 remaining) [2022-11-25 15:47:16,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 91 remaining) [2022-11-25 15:47:16,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 91 remaining) [2022-11-25 15:47:16,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 91 remaining) [2022-11-25 15:47:16,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 91 remaining) [2022-11-25 15:47:16,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 91 remaining) [2022-11-25 15:47:16,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 91 remaining) [2022-11-25 15:47:16,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 91 remaining) [2022-11-25 15:47:16,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 91 remaining) [2022-11-25 15:47:16,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 91 remaining) [2022-11-25 15:47:16,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 91 remaining) [2022-11-25 15:47:16,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 91 remaining) [2022-11-25 15:47:16,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 91 remaining) [2022-11-25 15:47:16,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 15:47:16,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 15:47:16,782 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:47:16,789 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:47:16,790 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:47:16,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:47:16 BasicIcfg [2022-11-25 15:47:16,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:47:16,948 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:47:16,948 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:47:16,948 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:47:16,949 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:45:48" (3/4) ... [2022-11-25 15:47:16,952 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 15:47:16,953 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:47:16,954 INFO L158 Benchmark]: Toolchain (without parser) took 92099.53ms. Allocated memory was 71.3MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 48.4MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-25 15:47:16,954 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 71.3MB. Free memory is still 49.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:47:16,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 929.67ms. Allocated memory is still 71.3MB. Free memory was 48.2MB in the beginning and 40.2MB in the end (delta: 8.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-25 15:47:16,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.54ms. Allocated memory is still 71.3MB. Free memory was 40.2MB in the beginning and 37.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:47:16,955 INFO L158 Benchmark]: Boogie Preprocessor took 91.20ms. Allocated memory is still 71.3MB. Free memory was 37.5MB in the beginning and 34.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:47:16,956 INFO L158 Benchmark]: RCFGBuilder took 2250.03ms. Allocated memory was 71.3MB in the beginning and 117.4MB in the end (delta: 46.1MB). Free memory was 34.8MB in the beginning and 42.5MB in the end (delta: -7.7MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. [2022-11-25 15:47:16,957 INFO L158 Benchmark]: TraceAbstraction took 88708.04ms. Allocated memory was 117.4MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 42.3MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 998.5MB. Max. memory is 16.1GB. [2022-11-25 15:47:16,958 INFO L158 Benchmark]: Witness Printer took 4.80ms. Allocated memory is still 3.2GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:47:16,963 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.34ms. Allocated memory is still 71.3MB. Free memory is still 49.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 929.67ms. Allocated memory is still 71.3MB. Free memory was 48.2MB in the beginning and 40.2MB in the end (delta: 8.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.54ms. Allocated memory is still 71.3MB. Free memory was 40.2MB in the beginning and 37.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.20ms. Allocated memory is still 71.3MB. Free memory was 37.5MB in the beginning and 34.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2250.03ms. Allocated memory was 71.3MB in the beginning and 117.4MB in the end (delta: 46.1MB). Free memory was 34.8MB in the beginning and 42.5MB in the end (delta: -7.7MB). Peak memory consumption was 41.3MB. Max. memory is 16.1GB. * TraceAbstraction took 88708.04ms. Allocated memory was 117.4MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 42.3MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 998.5MB. Max. memory is 16.1GB. * Witness Printer took 4.80ms. Allocated memory is still 3.2GB. Free memory is still 2.1GB. 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: 46.3s, 189 PlacesBefore, 85 PlacesAfterwards, 181 TransitionsBefore, 76 TransitionsAfterwards, 7512 CoEnabledTransitionPairs, 8 FixpointIterations, 73 TrivialSequentialCompositions, 100 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 178 TotalNumberOfCompositions, 33048 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12038, independent: 11528, independent conditional: 0, independent unconditional: 11528, dependent: 442, dependent conditional: 0, dependent unconditional: 442, unknown: 68, unknown conditional: 0, unknown unconditional: 68] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4583, independent: 4467, independent conditional: 0, independent unconditional: 4467, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4583, independent: 3953, independent conditional: 0, independent unconditional: 3953, dependent: 630, dependent conditional: 0, dependent unconditional: 630, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 630, independent: 514, independent conditional: 0, independent unconditional: 514, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4999, independent: 2831, independent conditional: 0, independent unconditional: 2831, dependent: 1460, dependent conditional: 0, dependent unconditional: 1460, unknown: 709, unknown conditional: 0, unknown unconditional: 709] ], Cache Queries: [ total: 12038, independent: 7061, independent conditional: 0, independent unconditional: 7061, dependent: 345, dependent conditional: 0, dependent unconditional: 345, unknown: 4632, unknown conditional: 0, unknown unconditional: 4632] , Statistics on independence cache: Total cache size (in pairs): 656, Positive cache size: 620, Positive conditional cache size: 0, Positive unconditional cache size: 620, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 10, Unknown conditional cache size: 0, Unknown unconditional cache size: 10 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [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_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2257; [L860] FCALL, FORK 0 pthread_create(&t2257, ((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_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$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(&t2257, ((void *)0), P0, ((void *)0))=-2, t2257={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L861] 0 pthread_t t2258; 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_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$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, t2257={7:0}, t2258={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L862] FCALL, FORK 0 pthread_create(&t2258, ((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_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$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(&t2258, ((void *)0), P1, ((void *)0))=-1, t2257={7:0}, t2258={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L863] 0 pthread_t t2259; 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_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$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, t2257={7:0}, t2258={14:0}, t2259={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L864] FCALL, FORK 0 pthread_create(&t2259, ((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_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$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(&t2259, ((void *)0), P2, ((void *)0))=0, t2257={7:0}, t2258={14:0}, t2259={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] 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)))) [L820] EXPR 3 \read(x) [L820] 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)))) [L820] 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)))) [L821] 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)))) [L822] 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)))) [L823] 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)))) [L824] 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)))) [L825] 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)))) [L826] 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)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] EXPR 3 \read(x) [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 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_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$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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L834] 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_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$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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 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_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$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=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_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_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$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=5, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L837] 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) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] 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) [L837] 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) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 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 [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __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_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$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=5, weak$$choice1=0, weak$$choice2=2, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __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_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$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=5, weak$$choice1=0, weak$$choice2=2, 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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 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) [L801] 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) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 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 [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_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_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$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=5, weak$$choice1=0, weak$$choice2=2, 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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 3 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] 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) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] 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) [L870] 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) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 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 [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_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_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$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=1, main$tmp_guard1=0, t2257={7:0}, t2258={14:0}, t2259={15:0}, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, 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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __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_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$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}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=2, weak$$choice2=2, 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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 857]: 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: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 245 locations, 91 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: 88.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 46.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 777 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 554 mSDsluCounter, 341 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 312 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1743 IncrementalHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 29 mSDtfsCounter, 1743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=257occurred in iteration=11, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 938 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1612 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 15:47:17,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_146f9139-67ad-465e-b1c8-c613e4e31745/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample