./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 15:46:15,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:46:15,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:46:15,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:46:15,466 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:46:15,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:46:15,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:46:15,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:46:15,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:46:15,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:46:15,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:46:15,472 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:46:15,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:46:15,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:46:15,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:46:15,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:46:15,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:46:15,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:46:15,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:46:15,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:46:15,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:46:15,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:46:15,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:46:15,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:46:15,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:46:15,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:46:15,483 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:46:15,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:46:15,484 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:46:15,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:46:15,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:46:15,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:46:15,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:46:15,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:46:15,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:46:15,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:46:15,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:46:15,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:46:15,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:46:15,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:46:15,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:46:15,490 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 15:46:15,505 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:46:15,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:46:15,505 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:46:15,506 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:46:15,506 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:46:15,506 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:46:15,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:46:15,521 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:46:15,521 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:46:15,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:46:15,521 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:46:15,521 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:46:15,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:46:15,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:46:15,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:46:15,522 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 15:46:15,522 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 15:46:15,523 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 15:46:15,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:46:15,523 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 15:46:15,523 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:46:15,523 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:46:15,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:46:15,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:46:15,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:46:15,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:46:15,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:46:15,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:46:15,525 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:46:15,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 15:46:15,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:46:15,525 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:46:15,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:46:15,526 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:46:15,526 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_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 [2022-12-13 15:46:15,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:46:15,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:46:15,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:46:15,749 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:46:15,749 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:46:15,750 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i [2022-12-13 15:46:18,262 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:46:18,476 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:46:18,476 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i [2022-12-13 15:46:18,485 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/data/dc87f625e/219f9e6f8dba4d1c897a75a2e1812769/FLAG8b6e92202 [2022-12-13 15:46:18,852 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/data/dc87f625e/219f9e6f8dba4d1c897a75a2e1812769 [2022-12-13 15:46:18,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:46:18,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:46:18,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:46:18,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:46:18,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:46:18,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:46:18" (1/1) ... [2022-12-13 15:46:18,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5130cf01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:46:18, skipping insertion in model container [2022-12-13 15:46:18,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:46:18" (1/1) ... [2022-12-13 15:46:18,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:46:18,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:46:19,001 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_f6c600b1-edfe-41e4-8716-e5574f911de0/sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i[995,1008] [2022-12-13 15:46:19,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,112 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:46:19,145 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:46:19,154 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_f6c600b1-edfe-41e4-8716-e5574f911de0/sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i[995,1008] [2022-12-13 15:46:19,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,178 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:46:19,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:46:19,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:46:19,218 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:46:19,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:46:19 WrapperNode [2022-12-13 15:46:19,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:46:19,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:46:19,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:46:19,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:46:19,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:46:19" (1/1) ... [2022-12-13 15:46:19,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:46:19" (1/1) ... [2022-12-13 15:46:19,253 INFO L138 Inliner]: procedures = 177, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 182 [2022-12-13 15:46:19,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:46:19,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:46:19,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:46:19,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:46:19,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:46:19" (1/1) ... [2022-12-13 15:46:19,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:46:19" (1/1) ... [2022-12-13 15:46:19,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:46:19" (1/1) ... [2022-12-13 15:46:19,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:46:19" (1/1) ... [2022-12-13 15:46:19,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:46:19" (1/1) ... [2022-12-13 15:46:19,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:46:19" (1/1) ... [2022-12-13 15:46:19,277 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:46:19" (1/1) ... [2022-12-13 15:46:19,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:46:19" (1/1) ... [2022-12-13 15:46:19,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:46:19,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:46:19,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:46:19,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:46:19,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:46:19" (1/1) ... [2022-12-13 15:46:19,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:46:19,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:46:19,306 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:46:19,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:46:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 15:46:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 15:46:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 15:46:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:46:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:46:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:46:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 15:46:19,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 15:46:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 15:46:19,342 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 15:46:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 15:46:19,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 15:46:19,343 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 15:46:19,343 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 15:46:19,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 15:46:19,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 15:46:19,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:46:19,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:46:19,345 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 15:46:19,459 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:46:19,461 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:46:19,914 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:46:20,430 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:46:20,430 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 15:46:20,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:46:20 BoogieIcfgContainer [2022-12-13 15:46:20,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:46:20,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:46:20,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:46:20,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:46:20,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:46:18" (1/3) ... [2022-12-13 15:46:20,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e84cbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:46:20, skipping insertion in model container [2022-12-13 15:46:20,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:46:19" (2/3) ... [2022-12-13 15:46:20,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e84cbbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:46:20, skipping insertion in model container [2022-12-13 15:46:20,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:46:20" (3/3) ... [2022-12-13 15:46:20,439 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2022-12-13 15:46:20,453 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:46:20,454 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2022-12-13 15:46:20,454 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 15:46:20,549 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 15:46:20,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 208 transitions, 436 flow [2022-12-13 15:46:20,645 INFO L130 PetriNetUnfolder]: 2/204 cut-off events. [2022-12-13 15:46:20,646 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:46:20,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 2/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 321 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 141. Up to 2 conditions per place. [2022-12-13 15:46:20,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 219 places, 208 transitions, 436 flow [2022-12-13 15:46:20,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 215 places, 204 transitions, 420 flow [2022-12-13 15:46:20,657 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 15:46:20,665 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 204 transitions, 420 flow [2022-12-13 15:46:20,667 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 204 transitions, 420 flow [2022-12-13 15:46:20,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 204 transitions, 420 flow [2022-12-13 15:46:20,701 INFO L130 PetriNetUnfolder]: 2/204 cut-off events. [2022-12-13 15:46:20,701 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:46:20,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 2/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 319 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 141. Up to 2 conditions per place. [2022-12-13 15:46:20,704 INFO L119 LiptonReduction]: Number of co-enabled transitions 9308 [2022-12-13 15:46:37,695 INFO L134 LiptonReduction]: Checked pairs total: 42567 [2022-12-13 15:46:37,695 INFO L136 LiptonReduction]: Total number of compositions: 167 [2022-12-13 15:46:37,705 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:46:37,709 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;@69029323, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:46:37,709 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2022-12-13 15:46:37,711 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 15:46:37,711 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:46:37,711 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:46:37,712 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 15:46:37,712 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:46:37,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:46:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1248, now seen corresponding path program 1 times [2022-12-13 15:46:37,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:46:37,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861320059] [2022-12-13 15:46:37,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:46:37,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:46:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:46:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:46:37,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:46:37,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861320059] [2022-12-13 15:46:37,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861320059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:46:37,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:46:37,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 15:46:37,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920451984] [2022-12-13 15:46:37,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:46:37,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 15:46:37,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:46:37,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 15:46:37,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 15:46:37,828 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 375 [2022-12-13 15:46:37,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 88 transitions, 188 flow. Second operand has 2 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:37,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:46:37,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 375 [2022-12-13 15:46:37,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:46:50,407 INFO L130 PetriNetUnfolder]: 69720/92983 cut-off events. [2022-12-13 15:46:50,407 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-13 15:46:50,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184997 conditions, 92983 events. 69720/92983 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6562. Compared 630333 event pairs, 69720 based on Foata normal form. 1200/48190 useless extension candidates. Maximal degree in co-relation 184985. Up to 91727 conditions per place. [2022-12-13 15:46:50,871 INFO L137 encePairwiseOnDemand]: 342/375 looper letters, 49 selfloop transitions, 0 changer transitions 0/55 dead transitions. [2022-12-13 15:46:50,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 220 flow [2022-12-13 15:46:50,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 15:46:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 15:46:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 390 transitions. [2022-12-13 15:46:50,885 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-13 15:46:50,885 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 390 transitions. [2022-12-13 15:46:50,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 390 transitions. [2022-12-13 15:46:50,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:46:50,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 390 transitions. [2022-12-13 15:46:50,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 195.0) internal successors, (390), 2 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:50,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:50,898 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:50,900 INFO L175 Difference]: Start difference. First operand has 100 places, 88 transitions, 188 flow. Second operand 2 states and 390 transitions. [2022-12-13 15:46:50,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 220 flow [2022-12-13 15:46:50,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 15:46:50,913 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 118 flow [2022-12-13 15:46:50,915 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2022-12-13 15:46:50,919 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -35 predicate places. [2022-12-13 15:46:50,919 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 118 flow [2022-12-13 15:46:50,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:46:50,919 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:46:50,919 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:46:50,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 15:46:50,920 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:46:50,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:46:50,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1233918, now seen corresponding path program 1 times [2022-12-13 15:46:50,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:46:50,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392144286] [2022-12-13 15:46:50,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:46:50,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:46:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:46:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:46:51,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:46:51,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392144286] [2022-12-13 15:46:51,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392144286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:46:51,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:46:51,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:46:51,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655751391] [2022-12-13 15:46:51,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:46:51,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:46:51,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:46:51,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:46:51,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:46:51,115 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 375 [2022-12-13 15:46:51,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 118 flow. Second operand has 3 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-12-13 15:46:51,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:46:51,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 375 [2022-12-13 15:46:51,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:47:00,858 INFO L130 PetriNetUnfolder]: 58693/79722 cut-off events. [2022-12-13 15:47:00,858 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:47:01,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159252 conditions, 79722 events. 58693/79722 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3513. Compared 511904 event pairs, 35918 based on Foata normal form. 0/50545 useless extension candidates. Maximal degree in co-relation 159249. Up to 47637 conditions per place. [2022-12-13 15:47:01,408 INFO L137 encePairwiseOnDemand]: 354/375 looper letters, 59 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2022-12-13 15:47:01,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 73 transitions, 294 flow [2022-12-13 15:47:01,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:47:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:47:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2022-12-13 15:47:01,411 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4577777777777778 [2022-12-13 15:47:01,411 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2022-12-13 15:47:01,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2022-12-13 15:47:01,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:47:01,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2022-12-13 15:47:01,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:01,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:01,418 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:01,418 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 118 flow. Second operand 3 states and 515 transitions. [2022-12-13 15:47:01,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 73 transitions, 294 flow [2022-12-13 15:47:01,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 73 transitions, 294 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 15:47:01,420 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 206 flow [2022-12-13 15:47:01,421 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2022-12-13 15:47:01,421 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -34 predicate places. [2022-12-13 15:47:01,421 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 206 flow [2022-12-13 15:47:01,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-12-13 15:47:01,422 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:47:01,422 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:47:01,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 15:47:01,423 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:47:01,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:47:01,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1233919, now seen corresponding path program 1 times [2022-12-13 15:47:01,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:47:01,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916723249] [2022-12-13 15:47:01,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:47:01,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:47:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:47:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:47:01,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:47:01,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916723249] [2022-12-13 15:47:01,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916723249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:47:01,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:47:01,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:47:01,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809430413] [2022-12-13 15:47:01,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:47:01,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:47:01,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:47:01,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:47:01,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:47:01,588 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 375 [2022-12-13 15:47:01,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:01,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:47:01,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 375 [2022-12-13 15:47:01,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:47:05,528 INFO L130 PetriNetUnfolder]: 18500/26519 cut-off events. [2022-12-13 15:47:05,528 INFO L131 PetriNetUnfolder]: For 7652/7856 co-relation queries the response was YES. [2022-12-13 15:47:05,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70613 conditions, 26519 events. 18500/26519 cut-off events. For 7652/7856 co-relation queries the response was YES. Maximal size of possible extension queue 1451. Compared 170985 event pairs, 14438 based on Foata normal form. 6081/29500 useless extension candidates. Maximal degree in co-relation 70608. Up to 24120 conditions per place. [2022-12-13 15:47:05,652 INFO L137 encePairwiseOnDemand]: 364/375 looper letters, 43 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2022-12-13 15:47:05,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 51 transitions, 274 flow [2022-12-13 15:47:05,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:47:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:47:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-12-13 15:47:05,654 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 15:47:05,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-12-13 15:47:05,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-12-13 15:47:05,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:47:05,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-12-13 15:47:05,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:05,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:05,658 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:05,658 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 206 flow. Second operand 3 states and 500 transitions. [2022-12-13 15:47:05,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 51 transitions, 274 flow [2022-12-13 15:47:05,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:47:05,699 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 166 flow [2022-12-13 15:47:05,699 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2022-12-13 15:47:05,699 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -44 predicate places. [2022-12-13 15:47:05,699 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 166 flow [2022-12-13 15:47:05,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:05,700 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:47:05,700 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:47:05,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 15:47:05,700 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:47:05,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:47:05,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1763451383, now seen corresponding path program 1 times [2022-12-13 15:47:05,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:47:05,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905683316] [2022-12-13 15:47:05,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:47:05,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:47:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:47:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:47:05,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:47:05,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905683316] [2022-12-13 15:47:05,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905683316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:47:05,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:47:05,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:47:05,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279847857] [2022-12-13 15:47:05,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:47:05,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:47:05,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:47:05,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:47:05,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:47:05,827 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 375 [2022-12-13 15:47:05,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:05,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:47:05,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 375 [2022-12-13 15:47:05,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:47:09,303 INFO L130 PetriNetUnfolder]: 18139/26053 cut-off events. [2022-12-13 15:47:09,303 INFO L131 PetriNetUnfolder]: For 3065/3257 co-relation queries the response was YES. [2022-12-13 15:47:09,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64578 conditions, 26053 events. 18139/26053 cut-off events. For 3065/3257 co-relation queries the response was YES. Maximal size of possible extension queue 1450. Compared 168282 event pairs, 10170 based on Foata normal form. 0/20454 useless extension candidates. Maximal degree in co-relation 64573. Up to 14912 conditions per place. [2022-12-13 15:47:09,436 INFO L137 encePairwiseOnDemand]: 371/375 looper letters, 77 selfloop transitions, 3 changer transitions 0/87 dead transitions. [2022-12-13 15:47:09,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 87 transitions, 440 flow [2022-12-13 15:47:09,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:47:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:47:09,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2022-12-13 15:47:09,438 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4693333333333333 [2022-12-13 15:47:09,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2022-12-13 15:47:09,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2022-12-13 15:47:09,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:47:09,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2022-12-13 15:47:09,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:09,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:09,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:09,441 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 166 flow. Second operand 3 states and 528 transitions. [2022-12-13 15:47:09,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 87 transitions, 440 flow [2022-12-13 15:47:09,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 87 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:47:09,443 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 178 flow [2022-12-13 15:47:09,443 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2022-12-13 15:47:09,444 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -42 predicate places. [2022-12-13 15:47:09,444 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 178 flow [2022-12-13 15:47:09,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:09,444 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:47:09,444 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:47:09,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 15:47:09,444 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:47:09,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:47:09,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1763451629, now seen corresponding path program 1 times [2022-12-13 15:47:09,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:47:09,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684310010] [2022-12-13 15:47:09,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:47:09,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:47:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:47:09,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:47:09,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:47:09,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684310010] [2022-12-13 15:47:09,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684310010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:47:09,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:47:09,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:47:09,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310782788] [2022-12-13 15:47:09,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:47:09,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:47:09,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:47:09,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:47:09,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:47:09,627 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 375 [2022-12-13 15:47:09,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:09,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:47:09,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 375 [2022-12-13 15:47:09,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:47:12,880 INFO L130 PetriNetUnfolder]: 17566/25345 cut-off events. [2022-12-13 15:47:12,880 INFO L131 PetriNetUnfolder]: For 5512/5548 co-relation queries the response was YES. [2022-12-13 15:47:12,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66725 conditions, 25345 events. 17566/25345 cut-off events. For 5512/5548 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 167320 event pairs, 4148 based on Foata normal form. 0/21006 useless extension candidates. Maximal degree in co-relation 66719. Up to 20115 conditions per place. [2022-12-13 15:47:13,023 INFO L137 encePairwiseOnDemand]: 372/375 looper letters, 70 selfloop transitions, 2 changer transitions 2/81 dead transitions. [2022-12-13 15:47:13,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 81 transitions, 432 flow [2022-12-13 15:47:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:47:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:47:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2022-12-13 15:47:13,025 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46044444444444443 [2022-12-13 15:47:13,025 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2022-12-13 15:47:13,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2022-12-13 15:47:13,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:47:13,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2022-12-13 15:47:13,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:13,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:13,028 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:13,029 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 178 flow. Second operand 3 states and 518 transitions. [2022-12-13 15:47:13,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 81 transitions, 432 flow [2022-12-13 15:47:13,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:47:13,031 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 178 flow [2022-12-13 15:47:13,031 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2022-12-13 15:47:13,031 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -41 predicate places. [2022-12-13 15:47:13,032 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 178 flow [2022-12-13 15:47:13,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:13,032 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:47:13,032 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:47:13,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 15:47:13,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:47:13,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:47:13,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1834114616, now seen corresponding path program 1 times [2022-12-13 15:47:13,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:47:13,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195330102] [2022-12-13 15:47:13,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:47:13,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:47:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:47:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:47:13,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:47:13,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195330102] [2022-12-13 15:47:13,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195330102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:47:13,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:47:13,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:47:13,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393651192] [2022-12-13 15:47:13,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:47:13,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:47:13,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:47:13,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:47:13,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:47:13,368 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 375 [2022-12-13 15:47:13,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:13,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:47:13,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 375 [2022-12-13 15:47:13,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:47:16,683 INFO L130 PetriNetUnfolder]: 16902/25104 cut-off events. [2022-12-13 15:47:16,683 INFO L131 PetriNetUnfolder]: For 3621/3765 co-relation queries the response was YES. [2022-12-13 15:47:16,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64936 conditions, 25104 events. 16902/25104 cut-off events. For 3621/3765 co-relation queries the response was YES. Maximal size of possible extension queue 1411. Compared 172556 event pairs, 6968 based on Foata normal form. 111/20270 useless extension candidates. Maximal degree in co-relation 64929. Up to 13420 conditions per place. [2022-12-13 15:47:16,798 INFO L137 encePairwiseOnDemand]: 371/375 looper letters, 73 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2022-12-13 15:47:16,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 83 transitions, 439 flow [2022-12-13 15:47:16,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:47:16,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:47:16,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 653 transitions. [2022-12-13 15:47:16,800 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43533333333333335 [2022-12-13 15:47:16,800 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 653 transitions. [2022-12-13 15:47:16,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 653 transitions. [2022-12-13 15:47:16,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:47:16,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 653 transitions. [2022-12-13 15:47:16,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 163.25) internal successors, (653), 4 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:16,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 375.0) internal successors, (1875), 5 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:16,803 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 375.0) internal successors, (1875), 5 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:16,803 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 178 flow. Second operand 4 states and 653 transitions. [2022-12-13 15:47:16,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 83 transitions, 439 flow [2022-12-13 15:47:16,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 83 transitions, 430 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 15:47:16,805 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 169 flow [2022-12-13 15:47:16,805 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2022-12-13 15:47:16,806 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -44 predicate places. [2022-12-13 15:47:16,806 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 169 flow [2022-12-13 15:47:16,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:16,806 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:47:16,806 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:47:16,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 15:47:16,807 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:47:16,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:47:16,807 INFO L85 PathProgramCache]: Analyzing trace with hash -490383836, now seen corresponding path program 1 times [2022-12-13 15:47:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:47:16,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115199313] [2022-12-13 15:47:16,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:47:16,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:47:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:47:16,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-12-13 15:47:16,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:47:16,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115199313] [2022-12-13 15:47:16,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115199313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:47:16,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:47:16,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:47:16,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95310187] [2022-12-13 15:47:16,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:47:16,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:47:16,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:47:16,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:47:16,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:47:16,963 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 375 [2022-12-13 15:47:16,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:16,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:47:16,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 375 [2022-12-13 15:47:16,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:47:21,680 INFO L130 PetriNetUnfolder]: 25284/36529 cut-off events. [2022-12-13 15:47:21,680 INFO L131 PetriNetUnfolder]: For 11336/11716 co-relation queries the response was YES. [2022-12-13 15:47:21,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96471 conditions, 36529 events. 25284/36529 cut-off events. For 11336/11716 co-relation queries the response was YES. Maximal size of possible extension queue 2338. Compared 261360 event pairs, 6404 based on Foata normal form. 233/30174 useless extension candidates. Maximal degree in co-relation 96465. Up to 16005 conditions per place. [2022-12-13 15:47:21,900 INFO L137 encePairwiseOnDemand]: 371/375 looper letters, 102 selfloop transitions, 3 changer transitions 0/112 dead transitions. [2022-12-13 15:47:21,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 112 transitions, 606 flow [2022-12-13 15:47:21,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:47:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:47:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 686 transitions. [2022-12-13 15:47:21,902 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4573333333333333 [2022-12-13 15:47:21,902 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 686 transitions. [2022-12-13 15:47:21,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 686 transitions. [2022-12-13 15:47:21,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:47:21,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 686 transitions. [2022-12-13 15:47:21,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.5) internal successors, (686), 4 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:21,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 375.0) internal successors, (1875), 5 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:21,906 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 375.0) internal successors, (1875), 5 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:21,906 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 169 flow. Second operand 4 states and 686 transitions. [2022-12-13 15:47:21,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 112 transitions, 606 flow [2022-12-13 15:47:21,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 112 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:47:21,910 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 184 flow [2022-12-13 15:47:21,910 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2022-12-13 15:47:21,910 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -41 predicate places. [2022-12-13 15:47:21,910 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 184 flow [2022-12-13 15:47:21,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:21,911 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:47:21,911 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:47:21,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 15:47:21,911 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:47:21,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:47:21,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2110124412, now seen corresponding path program 1 times [2022-12-13 15:47:21,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:47:21,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736815608] [2022-12-13 15:47:21,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:47:21,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:47:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:47:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:47:22,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:47:22,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736815608] [2022-12-13 15:47:22,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736815608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:47:22,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:47:22,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:47:22,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555535869] [2022-12-13 15:47:22,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:47:22,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:47:22,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:47:22,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:47:22,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:47:22,096 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 375 [2022-12-13 15:47:22,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:22,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:47:22,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 375 [2022-12-13 15:47:22,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:47:26,778 INFO L130 PetriNetUnfolder]: 25430/37435 cut-off events. [2022-12-13 15:47:26,778 INFO L131 PetriNetUnfolder]: For 11280/11507 co-relation queries the response was YES. [2022-12-13 15:47:26,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102596 conditions, 37435 events. 25430/37435 cut-off events. For 11280/11507 co-relation queries the response was YES. Maximal size of possible extension queue 2275. Compared 268076 event pairs, 12810 based on Foata normal form. 30/29533 useless extension candidates. Maximal degree in co-relation 102588. Up to 20223 conditions per place. [2022-12-13 15:47:26,993 INFO L137 encePairwiseOnDemand]: 372/375 looper letters, 74 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2022-12-13 15:47:26,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 461 flow [2022-12-13 15:47:26,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:47:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:47:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2022-12-13 15:47:26,995 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-13 15:47:26,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2022-12-13 15:47:26,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2022-12-13 15:47:26,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:47:26,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2022-12-13 15:47:26,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:26,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:26,999 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:26,999 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 184 flow. Second operand 3 states and 525 transitions. [2022-12-13 15:47:26,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 461 flow [2022-12-13 15:47:27,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 455 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:47:27,004 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 191 flow [2022-12-13 15:47:27,005 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2022-12-13 15:47:27,005 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -40 predicate places. [2022-12-13 15:47:27,005 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 191 flow [2022-12-13 15:47:27,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:27,005 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:47:27,006 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:47:27,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 15:47:27,006 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:47:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:47:27,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1835031458, now seen corresponding path program 1 times [2022-12-13 15:47:27,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:47:27,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609456199] [2022-12-13 15:47:27,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:47:27,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:47:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:47:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:47:27,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:47:27,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609456199] [2022-12-13 15:47:27,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609456199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:47:27,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:47:27,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:47:27,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96421185] [2022-12-13 15:47:27,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:47:27,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:47:27,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:47:27,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:47:27,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:47:27,168 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 375 [2022-12-13 15:47:27,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:27,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:47:27,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 375 [2022-12-13 15:47:27,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:47:31,430 INFO L130 PetriNetUnfolder]: 23694/33798 cut-off events. [2022-12-13 15:47:31,430 INFO L131 PetriNetUnfolder]: For 9019/9019 co-relation queries the response was YES. [2022-12-13 15:47:31,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100126 conditions, 33798 events. 23694/33798 cut-off events. For 9019/9019 co-relation queries the response was YES. Maximal size of possible extension queue 2084. Compared 222299 event pairs, 7221 based on Foata normal form. 92/28438 useless extension candidates. Maximal degree in co-relation 100117. Up to 16089 conditions per place. [2022-12-13 15:47:31,605 INFO L137 encePairwiseOnDemand]: 357/375 looper letters, 59 selfloop transitions, 12 changer transitions 0/73 dead transitions. [2022-12-13 15:47:31,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 73 transitions, 427 flow [2022-12-13 15:47:31,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:47:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:47:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 633 transitions. [2022-12-13 15:47:31,608 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.422 [2022-12-13 15:47:31,608 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 633 transitions. [2022-12-13 15:47:31,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 633 transitions. [2022-12-13 15:47:31,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:47:31,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 633 transitions. [2022-12-13 15:47:31,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.25) internal successors, (633), 4 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-12-13 15:47:31,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 375.0) internal successors, (1875), 5 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:31,611 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 375.0) internal successors, (1875), 5 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:31,611 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 191 flow. Second operand 4 states and 633 transitions. [2022-12-13 15:47:31,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 73 transitions, 427 flow [2022-12-13 15:47:31,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 417 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:47:31,616 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 277 flow [2022-12-13 15:47:31,616 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2022-12-13 15:47:31,616 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -37 predicate places. [2022-12-13 15:47:31,616 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 277 flow [2022-12-13 15:47:31,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:31,617 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:47:31,617 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:47:31,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 15:47:31,617 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:47:31,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:47:31,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1055792377, now seen corresponding path program 1 times [2022-12-13 15:47:31,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:47:31,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914628261] [2022-12-13 15:47:31,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:47:31,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:47:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:47:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:47:32,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:47:32,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914628261] [2022-12-13 15:47:32,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914628261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:47:32,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:47:32,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 15:47:32,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860712427] [2022-12-13 15:47:32,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:47:32,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 15:47:32,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:47:32,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 15:47:32,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-13 15:47:33,252 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 375 [2022-12-13 15:47:33,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 277 flow. Second operand has 10 states, 10 states have (on average 132.7) internal successors, (1327), 10 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:33,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:47:33,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 375 [2022-12-13 15:47:33,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:47:38,230 INFO L130 PetriNetUnfolder]: 24668/35133 cut-off events. [2022-12-13 15:47:38,230 INFO L131 PetriNetUnfolder]: For 20284/20284 co-relation queries the response was YES. [2022-12-13 15:47:38,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120535 conditions, 35133 events. 24668/35133 cut-off events. For 20284/20284 co-relation queries the response was YES. Maximal size of possible extension queue 2109. Compared 231017 event pairs, 11844 based on Foata normal form. 4/31973 useless extension candidates. Maximal degree in co-relation 120525. Up to 33733 conditions per place. [2022-12-13 15:47:38,424 INFO L137 encePairwiseOnDemand]: 363/375 looper letters, 91 selfloop transitions, 21 changer transitions 0/113 dead transitions. [2022-12-13 15:47:38,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 113 transitions, 746 flow [2022-12-13 15:47:38,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 15:47:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 15:47:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1402 transitions. [2022-12-13 15:47:38,428 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3738666666666667 [2022-12-13 15:47:38,428 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1402 transitions. [2022-12-13 15:47:38,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1402 transitions. [2022-12-13 15:47:38,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:47:38,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1402 transitions. [2022-12-13 15:47:38,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 140.2) internal successors, (1402), 10 states have internal predecessors, (1402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:38,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 375.0) internal successors, (4125), 11 states have internal predecessors, (4125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:38,434 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 375.0) internal successors, (4125), 11 states have internal predecessors, (4125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:38,434 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 277 flow. Second operand 10 states and 1402 transitions. [2022-12-13 15:47:38,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 113 transitions, 746 flow [2022-12-13 15:47:38,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 113 transitions, 743 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:47:38,491 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 455 flow [2022-12-13 15:47:38,491 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=455, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2022-12-13 15:47:38,491 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -25 predicate places. [2022-12-13 15:47:38,491 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 455 flow [2022-12-13 15:47:38,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 132.7) internal successors, (1327), 10 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:38,492 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:47:38,492 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:47:38,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 15:47:38,493 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:47:38,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:47:38,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2054104655, now seen corresponding path program 2 times [2022-12-13 15:47:38,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:47:38,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440550657] [2022-12-13 15:47:38,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:47:38,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:47:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:47:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:47:39,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:47:39,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440550657] [2022-12-13 15:47:39,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440550657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:47:39,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:47:39,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 15:47:39,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405834549] [2022-12-13 15:47:39,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:47:39,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 15:47:39,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:47:39,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 15:47:39,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 15:47:39,880 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 375 [2022-12-13 15:47:39,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 455 flow. Second operand has 11 states, 11 states have (on average 131.54545454545453) internal successors, (1447), 11 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:39,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:47:39,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 375 [2022-12-13 15:47:39,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:47:45,226 INFO L130 PetriNetUnfolder]: 25520/36272 cut-off events. [2022-12-13 15:47:45,226 INFO L131 PetriNetUnfolder]: For 31624/31624 co-relation queries the response was YES. [2022-12-13 15:47:45,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132548 conditions, 36272 events. 25520/36272 cut-off events. For 31624/31624 co-relation queries the response was YES. Maximal size of possible extension queue 2166. Compared 240271 event pairs, 6227 based on Foata normal form. 50/33053 useless extension candidates. Maximal degree in co-relation 132533. Up to 32837 conditions per place. [2022-12-13 15:47:45,449 INFO L137 encePairwiseOnDemand]: 360/375 looper letters, 114 selfloop transitions, 54 changer transitions 0/169 dead transitions. [2022-12-13 15:47:45,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 169 transitions, 1326 flow [2022-12-13 15:47:45,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 15:47:45,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 15:47:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1550 transitions. [2022-12-13 15:47:45,452 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2022-12-13 15:47:45,452 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1550 transitions. [2022-12-13 15:47:45,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1550 transitions. [2022-12-13 15:47:45,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:47:45,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1550 transitions. [2022-12-13 15:47:45,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 140.9090909090909) internal successors, (1550), 11 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:45,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 375.0) internal successors, (4500), 12 states have internal predecessors, (4500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:45,466 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 375.0) internal successors, (4500), 12 states have internal predecessors, (4500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:45,466 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 455 flow. Second operand 11 states and 1550 transitions. [2022-12-13 15:47:45,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 169 transitions, 1326 flow [2022-12-13 15:47:45,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 169 transitions, 1310 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-13 15:47:45,605 INFO L231 Difference]: Finished difference. Result has 90 places, 111 transitions, 922 flow [2022-12-13 15:47:45,605 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=922, PETRI_PLACES=90, PETRI_TRANSITIONS=111} [2022-12-13 15:47:45,606 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -10 predicate places. [2022-12-13 15:47:45,606 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 111 transitions, 922 flow [2022-12-13 15:47:45,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 131.54545454545453) internal successors, (1447), 11 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:45,607 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:47:45,607 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:47:45,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 15:47:45,607 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:47:45,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:47:45,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1051404727, now seen corresponding path program 1 times [2022-12-13 15:47:45,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:47:45,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249347246] [2022-12-13 15:47:45,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:47:45,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:47:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:47:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:47:45,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:47:45,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249347246] [2022-12-13 15:47:45,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249347246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:47:45,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:47:45,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:47:45,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697370462] [2022-12-13 15:47:45,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:47:45,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:47:45,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:47:45,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:47:45,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:47:45,916 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 375 [2022-12-13 15:47:45,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 111 transitions, 922 flow. Second operand has 7 states, 7 states have (on average 141.28571428571428) internal successors, (989), 7 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:45,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:47:45,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 375 [2022-12-13 15:47:45,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:47:50,445 INFO L130 PetriNetUnfolder]: 21603/30764 cut-off events. [2022-12-13 15:47:50,446 INFO L131 PetriNetUnfolder]: For 44815/44815 co-relation queries the response was YES. [2022-12-13 15:47:50,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125219 conditions, 30764 events. 21603/30764 cut-off events. For 44815/44815 co-relation queries the response was YES. Maximal size of possible extension queue 1820. Compared 197610 event pairs, 5733 based on Foata normal form. 402/28221 useless extension candidates. Maximal degree in co-relation 125198. Up to 12709 conditions per place. [2022-12-13 15:47:50,798 INFO L137 encePairwiseOnDemand]: 357/375 looper letters, 122 selfloop transitions, 31 changer transitions 0/157 dead transitions. [2022-12-13 15:47:50,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 157 transitions, 1529 flow [2022-12-13 15:47:50,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:47:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 15:47:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 915 transitions. [2022-12-13 15:47:50,800 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2022-12-13 15:47:50,800 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 915 transitions. [2022-12-13 15:47:50,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 915 transitions. [2022-12-13 15:47:50,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:47:50,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 915 transitions. [2022-12-13 15:47:50,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:50,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 375.0) internal successors, (2625), 7 states have internal predecessors, (2625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:50,804 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 375.0) internal successors, (2625), 7 states have internal predecessors, (2625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:50,804 INFO L175 Difference]: Start difference. First operand has 90 places, 111 transitions, 922 flow. Second operand 6 states and 915 transitions. [2022-12-13 15:47:50,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 157 transitions, 1529 flow [2022-12-13 15:47:51,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 157 transitions, 1466 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-12-13 15:47:51,673 INFO L231 Difference]: Finished difference. Result has 95 places, 123 transitions, 1138 flow [2022-12-13 15:47:51,674 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1138, PETRI_PLACES=95, PETRI_TRANSITIONS=123} [2022-12-13 15:47:51,674 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -5 predicate places. [2022-12-13 15:47:51,674 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 123 transitions, 1138 flow [2022-12-13 15:47:51,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 141.28571428571428) internal successors, (989), 7 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:51,674 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:47:51,674 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:47:51,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 15:47:51,675 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:47:51,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:47:51,675 INFO L85 PathProgramCache]: Analyzing trace with hash 598544799, now seen corresponding path program 1 times [2022-12-13 15:47:51,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:47:51,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37680054] [2022-12-13 15:47:51,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:47:51,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:47:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:47:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:47:52,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:47:52,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37680054] [2022-12-13 15:47:52,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37680054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:47:52,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:47:52,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:47:52,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274234772] [2022-12-13 15:47:52,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:47:52,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:47:52,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:47:52,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:47:52,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:47:52,157 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 375 [2022-12-13 15:47:52,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 123 transitions, 1138 flow. Second operand has 4 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:52,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:47:52,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 375 [2022-12-13 15:47:52,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:47:58,012 INFO L130 PetriNetUnfolder]: 26522/37841 cut-off events. [2022-12-13 15:47:58,012 INFO L131 PetriNetUnfolder]: For 78244/78244 co-relation queries the response was YES. [2022-12-13 15:47:58,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167488 conditions, 37841 events. 26522/37841 cut-off events. For 78244/78244 co-relation queries the response was YES. Maximal size of possible extension queue 2285. Compared 252433 event pairs, 14267 based on Foata normal form. 16/33796 useless extension candidates. Maximal degree in co-relation 167465. Up to 29400 conditions per place. [2022-12-13 15:47:58,309 INFO L137 encePairwiseOnDemand]: 367/375 looper letters, 116 selfloop transitions, 41 changer transitions 0/162 dead transitions. [2022-12-13 15:47:58,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 162 transitions, 1758 flow [2022-12-13 15:47:58,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:47:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:47:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 645 transitions. [2022-12-13 15:47:58,311 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43 [2022-12-13 15:47:58,311 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 645 transitions. [2022-12-13 15:47:58,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 645 transitions. [2022-12-13 15:47:58,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:47:58,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 645 transitions. [2022-12-13 15:47:58,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:58,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 375.0) internal successors, (1875), 5 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:58,315 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 375.0) internal successors, (1875), 5 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:58,315 INFO L175 Difference]: Start difference. First operand has 95 places, 123 transitions, 1138 flow. Second operand 4 states and 645 transitions. [2022-12-13 15:47:58,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 162 transitions, 1758 flow [2022-12-13 15:47:58,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 162 transitions, 1739 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 15:47:58,730 INFO L231 Difference]: Finished difference. Result has 96 places, 140 transitions, 1439 flow [2022-12-13 15:47:58,731 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1439, PETRI_PLACES=96, PETRI_TRANSITIONS=140} [2022-12-13 15:47:58,731 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -4 predicate places. [2022-12-13 15:47:58,731 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 140 transitions, 1439 flow [2022-12-13 15:47:58,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:58,731 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:47:58,731 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:47:58,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 15:47:58,732 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:47:58,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:47:58,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1658821316, now seen corresponding path program 1 times [2022-12-13 15:47:58,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:47:58,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878307128] [2022-12-13 15:47:58,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:47:58,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:47:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:47:58,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:47:58,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:47:58,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878307128] [2022-12-13 15:47:58,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878307128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:47:58,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:47:58,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:47:58,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638199350] [2022-12-13 15:47:58,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:47:58,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:47:58,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:47:58,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:47:58,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:47:58,875 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 375 [2022-12-13 15:47:58,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 140 transitions, 1439 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:47:58,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:47:58,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 375 [2022-12-13 15:47:58,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:48:02,580 INFO L130 PetriNetUnfolder]: 14382/21783 cut-off events. [2022-12-13 15:48:02,580 INFO L131 PetriNetUnfolder]: For 62917/63722 co-relation queries the response was YES. [2022-12-13 15:48:02,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104500 conditions, 21783 events. 14382/21783 cut-off events. For 62917/63722 co-relation queries the response was YES. Maximal size of possible extension queue 1519. Compared 151235 event pairs, 4510 based on Foata normal form. 289/19535 useless extension candidates. Maximal degree in co-relation 104475. Up to 19700 conditions per place. [2022-12-13 15:48:02,713 INFO L137 encePairwiseOnDemand]: 369/375 looper letters, 134 selfloop transitions, 5 changer transitions 0/170 dead transitions. [2022-12-13 15:48:02,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 170 transitions, 1900 flow [2022-12-13 15:48:02,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:48:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:48:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-12-13 15:48:02,715 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 15:48:02,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-12-13 15:48:02,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-12-13 15:48:02,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:48:02,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-12-13 15:48:02,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:02,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:02,717 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 375.0) internal successors, (1500), 4 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:02,718 INFO L175 Difference]: Start difference. First operand has 96 places, 140 transitions, 1439 flow. Second operand 3 states and 500 transitions. [2022-12-13 15:48:02,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 170 transitions, 1900 flow [2022-12-13 15:48:03,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 170 transitions, 1835 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 15:48:03,122 INFO L231 Difference]: Finished difference. Result has 97 places, 144 transitions, 1416 flow [2022-12-13 15:48:03,122 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1416, PETRI_PLACES=97, PETRI_TRANSITIONS=144} [2022-12-13 15:48:03,123 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -3 predicate places. [2022-12-13 15:48:03,123 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 144 transitions, 1416 flow [2022-12-13 15:48:03,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:03,123 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:48:03,123 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:48:03,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 15:48:03,123 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:48:03,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:48:03,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2134022054, now seen corresponding path program 1 times [2022-12-13 15:48:03,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:48:03,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272656137] [2022-12-13 15:48:03,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:48:03,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:48:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:48:03,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-12-13 15:48:03,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:48:03,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272656137] [2022-12-13 15:48:03,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272656137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:48:03,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:48:03,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:48:03,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279131678] [2022-12-13 15:48:03,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:48:03,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:48:03,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:48:03,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:48:03,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:48:03,281 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 375 [2022-12-13 15:48:03,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 144 transitions, 1416 flow. Second operand has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:03,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:48:03,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 375 [2022-12-13 15:48:03,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:48:04,599 INFO L130 PetriNetUnfolder]: 4226/7033 cut-off events. [2022-12-13 15:48:04,599 INFO L131 PetriNetUnfolder]: For 18646/19010 co-relation queries the response was YES. [2022-12-13 15:48:04,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33515 conditions, 7033 events. 4226/7033 cut-off events. For 18646/19010 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 46112 event pairs, 909 based on Foata normal form. 245/6567 useless extension candidates. Maximal degree in co-relation 33489. Up to 5300 conditions per place. [2022-12-13 15:48:04,640 INFO L137 encePairwiseOnDemand]: 369/375 looper letters, 137 selfloop transitions, 9 changer transitions 0/170 dead transitions. [2022-12-13 15:48:04,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 170 transitions, 1749 flow [2022-12-13 15:48:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:48:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:48:04,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 664 transitions. [2022-12-13 15:48:04,642 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44266666666666665 [2022-12-13 15:48:04,642 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 664 transitions. [2022-12-13 15:48:04,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 664 transitions. [2022-12-13 15:48:04,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:48:04,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 664 transitions. [2022-12-13 15:48:04,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:04,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 375.0) internal successors, (1875), 5 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:04,644 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 375.0) internal successors, (1875), 5 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:04,644 INFO L175 Difference]: Start difference. First operand has 97 places, 144 transitions, 1416 flow. Second operand 4 states and 664 transitions. [2022-12-13 15:48:04,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 170 transitions, 1749 flow [2022-12-13 15:48:04,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 170 transitions, 1704 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 15:48:04,792 INFO L231 Difference]: Finished difference. Result has 95 places, 123 transitions, 1144 flow [2022-12-13 15:48:04,792 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1144, PETRI_PLACES=95, PETRI_TRANSITIONS=123} [2022-12-13 15:48:04,792 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -5 predicate places. [2022-12-13 15:48:04,792 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 123 transitions, 1144 flow [2022-12-13 15:48:04,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:04,793 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:48:04,793 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-12-13 15:48:04,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 15:48:04,793 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:48:04,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:48:04,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1204236576, now seen corresponding path program 1 times [2022-12-13 15:48:04,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:48:04,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772405433] [2022-12-13 15:48:04,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:48:04,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:48:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:48:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:48:04,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:48:04,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772405433] [2022-12-13 15:48:04,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772405433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:48:04,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:48:04,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:48:04,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048682844] [2022-12-13 15:48:04,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:48:04,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:48:04,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:48:04,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:48:04,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:48:04,933 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 375 [2022-12-13 15:48:04,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 123 transitions, 1144 flow. Second operand has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:04,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:48:04,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 375 [2022-12-13 15:48:04,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:48:07,002 INFO L130 PetriNetUnfolder]: 7816/12875 cut-off events. [2022-12-13 15:48:07,002 INFO L131 PetriNetUnfolder]: For 35679/36326 co-relation queries the response was YES. [2022-12-13 15:48:07,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61036 conditions, 12875 events. 7816/12875 cut-off events. For 35679/36326 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 90160 event pairs, 2069 based on Foata normal form. 258/11832 useless extension candidates. Maximal degree in co-relation 61011. Up to 6630 conditions per place. [2022-12-13 15:48:07,089 INFO L137 encePairwiseOnDemand]: 372/375 looper letters, 237 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2022-12-13 15:48:07,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 262 transitions, 2822 flow [2022-12-13 15:48:07,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:48:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:48:07,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 688 transitions. [2022-12-13 15:48:07,092 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45866666666666667 [2022-12-13 15:48:07,092 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 688 transitions. [2022-12-13 15:48:07,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 688 transitions. [2022-12-13 15:48:07,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:48:07,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 688 transitions. [2022-12-13 15:48:07,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:07,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 375.0) internal successors, (1875), 5 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:07,095 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 375.0) internal successors, (1875), 5 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:07,095 INFO L175 Difference]: Start difference. First operand has 95 places, 123 transitions, 1144 flow. Second operand 4 states and 688 transitions. [2022-12-13 15:48:07,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 262 transitions, 2822 flow [2022-12-13 15:48:07,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 262 transitions, 2764 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 15:48:07,172 INFO L231 Difference]: Finished difference. Result has 97 places, 124 transitions, 1132 flow [2022-12-13 15:48:07,172 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=1119, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1132, PETRI_PLACES=97, PETRI_TRANSITIONS=124} [2022-12-13 15:48:07,172 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -3 predicate places. [2022-12-13 15:48:07,173 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 124 transitions, 1132 flow [2022-12-13 15:48:07,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:07,173 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:48:07,173 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-12-13 15:48:07,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 15:48:07,173 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:48:07,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:48:07,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1789284110, now seen corresponding path program 2 times [2022-12-13 15:48:07,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:48:07,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156884230] [2022-12-13 15:48:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:48:07,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:48:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:48:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:48:07,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:48:07,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156884230] [2022-12-13 15:48:07,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156884230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:48:07,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:48:07,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:48:07,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576930649] [2022-12-13 15:48:07,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:48:07,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:48:07,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:48:07,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:48:07,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:48:07,335 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 375 [2022-12-13 15:48:07,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 124 transitions, 1132 flow. Second operand has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:07,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:48:07,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 375 [2022-12-13 15:48:07,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:48:08,077 INFO L130 PetriNetUnfolder]: 2167/3705 cut-off events. [2022-12-13 15:48:08,078 INFO L131 PetriNetUnfolder]: For 9130/9513 co-relation queries the response was YES. [2022-12-13 15:48:08,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16091 conditions, 3705 events. 2167/3705 cut-off events. For 9130/9513 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 22187 event pairs, 233 based on Foata normal form. 302/3799 useless extension candidates. Maximal degree in co-relation 16065. Up to 1110 conditions per place. [2022-12-13 15:48:08,095 INFO L137 encePairwiseOnDemand]: 369/375 looper letters, 122 selfloop transitions, 13 changer transitions 0/151 dead transitions. [2022-12-13 15:48:08,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 151 transitions, 1393 flow [2022-12-13 15:48:08,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:48:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:48:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 826 transitions. [2022-12-13 15:48:08,097 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44053333333333333 [2022-12-13 15:48:08,097 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 826 transitions. [2022-12-13 15:48:08,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 826 transitions. [2022-12-13 15:48:08,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:48:08,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 826 transitions. [2022-12-13 15:48:08,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.2) internal successors, (826), 5 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:08,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 375.0) internal successors, (2250), 6 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:08,099 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 375.0) internal successors, (2250), 6 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:08,099 INFO L175 Difference]: Start difference. First operand has 97 places, 124 transitions, 1132 flow. Second operand 5 states and 826 transitions. [2022-12-13 15:48:08,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 151 transitions, 1393 flow [2022-12-13 15:48:08,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 151 transitions, 1347 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-13 15:48:08,111 INFO L231 Difference]: Finished difference. Result has 96 places, 94 transitions, 759 flow [2022-12-13 15:48:08,111 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=759, PETRI_PLACES=96, PETRI_TRANSITIONS=94} [2022-12-13 15:48:08,111 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -4 predicate places. [2022-12-13 15:48:08,111 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 94 transitions, 759 flow [2022-12-13 15:48:08,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:08,112 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:48:08,112 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:48:08,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 15:48:08,112 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:48:08,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:48:08,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1823696775, now seen corresponding path program 1 times [2022-12-13 15:48:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:48:08,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637916901] [2022-12-13 15:48:08,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:48:08,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:48:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:48:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:48:08,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:48:08,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637916901] [2022-12-13 15:48:08,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637916901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:48:08,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:48:08,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:48:08,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190214210] [2022-12-13 15:48:08,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:48:08,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:48:08,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:48:08,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:48:08,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:48:08,978 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 375 [2022-12-13 15:48:08,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 94 transitions, 759 flow. Second operand has 7 states, 7 states have (on average 147.14285714285714) internal successors, (1030), 7 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:08,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:48:08,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 375 [2022-12-13 15:48:08,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:48:10,124 INFO L130 PetriNetUnfolder]: 3341/5854 cut-off events. [2022-12-13 15:48:10,125 INFO L131 PetriNetUnfolder]: For 17816/17838 co-relation queries the response was YES. [2022-12-13 15:48:10,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27573 conditions, 5854 events. 3341/5854 cut-off events. For 17816/17838 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 37983 event pairs, 782 based on Foata normal form. 14/5553 useless extension candidates. Maximal degree in co-relation 27547. Up to 2960 conditions per place. [2022-12-13 15:48:10,154 INFO L137 encePairwiseOnDemand]: 367/375 looper letters, 142 selfloop transitions, 29 changer transitions 1/177 dead transitions. [2022-12-13 15:48:10,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 177 transitions, 1775 flow [2022-12-13 15:48:10,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:48:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:48:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 802 transitions. [2022-12-13 15:48:10,156 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42773333333333335 [2022-12-13 15:48:10,156 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 802 transitions. [2022-12-13 15:48:10,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 802 transitions. [2022-12-13 15:48:10,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:48:10,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 802 transitions. [2022-12-13 15:48:10,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 160.4) internal successors, (802), 5 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:10,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 375.0) internal successors, (2250), 6 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:10,159 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 375.0) internal successors, (2250), 6 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:10,159 INFO L175 Difference]: Start difference. First operand has 96 places, 94 transitions, 759 flow. Second operand 5 states and 802 transitions. [2022-12-13 15:48:10,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 177 transitions, 1775 flow [2022-12-13 15:48:10,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 177 transitions, 1685 flow, removed 22 selfloop flow, removed 3 redundant places. [2022-12-13 15:48:10,207 INFO L231 Difference]: Finished difference. Result has 99 places, 106 transitions, 950 flow [2022-12-13 15:48:10,208 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=950, PETRI_PLACES=99, PETRI_TRANSITIONS=106} [2022-12-13 15:48:10,208 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -1 predicate places. [2022-12-13 15:48:10,208 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 106 transitions, 950 flow [2022-12-13 15:48:10,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 147.14285714285714) internal successors, (1030), 7 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:10,208 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:48:10,208 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:48:10,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 15:48:10,208 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:48:10,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:48:10,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1698393065, now seen corresponding path program 1 times [2022-12-13 15:48:10,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:48:10,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084200019] [2022-12-13 15:48:10,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:48:10,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:48:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:48:10,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:48:10,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:48:10,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084200019] [2022-12-13 15:48:10,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084200019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:48:10,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:48:10,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:48:10,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581000884] [2022-12-13 15:48:10,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:48:10,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:48:10,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:48:10,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:48:10,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:48:10,407 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 375 [2022-12-13 15:48:10,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 106 transitions, 950 flow. Second operand has 6 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:10,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:48:10,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 375 [2022-12-13 15:48:10,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:48:11,220 INFO L130 PetriNetUnfolder]: 2297/3673 cut-off events. [2022-12-13 15:48:11,220 INFO L131 PetriNetUnfolder]: For 12207/12723 co-relation queries the response was YES. [2022-12-13 15:48:11,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17165 conditions, 3673 events. 2297/3673 cut-off events. For 12207/12723 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 21734 event pairs, 159 based on Foata normal form. 398/3979 useless extension candidates. Maximal degree in co-relation 17137. Up to 1432 conditions per place. [2022-12-13 15:48:11,239 INFO L137 encePairwiseOnDemand]: 369/375 looper letters, 113 selfloop transitions, 17 changer transitions 1/142 dead transitions. [2022-12-13 15:48:11,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 142 transitions, 1356 flow [2022-12-13 15:48:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:48:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 15:48:11,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 969 transitions. [2022-12-13 15:48:11,241 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43066666666666664 [2022-12-13 15:48:11,241 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 969 transitions. [2022-12-13 15:48:11,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 969 transitions. [2022-12-13 15:48:11,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:48:11,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 969 transitions. [2022-12-13 15:48:11,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:11,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 375.0) internal successors, (2625), 7 states have internal predecessors, (2625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:11,244 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 375.0) internal successors, (2625), 7 states have internal predecessors, (2625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:11,244 INFO L175 Difference]: Start difference. First operand has 99 places, 106 transitions, 950 flow. Second operand 6 states and 969 transitions. [2022-12-13 15:48:11,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 142 transitions, 1356 flow [2022-12-13 15:48:11,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 142 transitions, 1243 flow, removed 36 selfloop flow, removed 12 redundant places. [2022-12-13 15:48:11,325 INFO L231 Difference]: Finished difference. Result has 85 places, 70 transitions, 506 flow [2022-12-13 15:48:11,325 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=506, PETRI_PLACES=85, PETRI_TRANSITIONS=70} [2022-12-13 15:48:11,325 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -15 predicate places. [2022-12-13 15:48:11,325 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 70 transitions, 506 flow [2022-12-13 15:48:11,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 152.5) internal successors, (915), 6 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:48:11,326 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:48:11,326 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:48:11,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 15:48:11,326 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:48:11,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:48:11,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2058017801, now seen corresponding path program 1 times [2022-12-13 15:48:11,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:48:11,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545188564] [2022-12-13 15:48:11,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:48:11,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:48:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:48:11,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:48:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:48:11,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:48:11,481 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 15:48:11,482 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (87 of 88 remaining) [2022-12-13 15:48:11,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2022-12-13 15:48:11,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2022-12-13 15:48:11,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2022-12-13 15:48:11,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2022-12-13 15:48:11,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2022-12-13 15:48:11,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2022-12-13 15:48:11,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2022-12-13 15:48:11,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2022-12-13 15:48:11,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2022-12-13 15:48:11,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2022-12-13 15:48:11,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2022-12-13 15:48:11,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2022-12-13 15:48:11,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 88 remaining) [2022-12-13 15:48:11,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2022-12-13 15:48:11,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2022-12-13 15:48:11,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2022-12-13 15:48:11,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2022-12-13 15:48:11,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2022-12-13 15:48:11,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2022-12-13 15:48:11,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2022-12-13 15:48:11,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2022-12-13 15:48:11,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 88 remaining) [2022-12-13 15:48:11,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2022-12-13 15:48:11,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2022-12-13 15:48:11,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2022-12-13 15:48:11,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2022-12-13 15:48:11,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2022-12-13 15:48:11,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2022-12-13 15:48:11,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2022-12-13 15:48:11,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2022-12-13 15:48:11,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2022-12-13 15:48:11,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2022-12-13 15:48:11,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2022-12-13 15:48:11,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2022-12-13 15:48:11,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2022-12-13 15:48:11,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2022-12-13 15:48:11,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2022-12-13 15:48:11,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2022-12-13 15:48:11,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2022-12-13 15:48:11,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2022-12-13 15:48:11,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2022-12-13 15:48:11,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2022-12-13 15:48:11,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2022-12-13 15:48:11,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2022-12-13 15:48:11,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2022-12-13 15:48:11,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2022-12-13 15:48:11,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2022-12-13 15:48:11,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2022-12-13 15:48:11,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 88 remaining) [2022-12-13 15:48:11,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 88 remaining) [2022-12-13 15:48:11,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 88 remaining) [2022-12-13 15:48:11,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 88 remaining) [2022-12-13 15:48:11,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 88 remaining) [2022-12-13 15:48:11,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2022-12-13 15:48:11,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK (32 of 88 remaining) [2022-12-13 15:48:11,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 88 remaining) [2022-12-13 15:48:11,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 88 remaining) [2022-12-13 15:48:11,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 88 remaining) [2022-12-13 15:48:11,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 88 remaining) [2022-12-13 15:48:11,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2022-12-13 15:48:11,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2022-12-13 15:48:11,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2022-12-13 15:48:11,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 88 remaining) [2022-12-13 15:48:11,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 88 remaining) [2022-12-13 15:48:11,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2022-12-13 15:48:11,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2022-12-13 15:48:11,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2022-12-13 15:48:11,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2022-12-13 15:48:11,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2022-12-13 15:48:11,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2022-12-13 15:48:11,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2022-12-13 15:48:11,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2022-12-13 15:48:11,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2022-12-13 15:48:11,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2022-12-13 15:48:11,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2022-12-13 15:48:11,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2022-12-13 15:48:11,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2022-12-13 15:48:11,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2022-12-13 15:48:11,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2022-12-13 15:48:11,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2022-12-13 15:48:11,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2022-12-13 15:48:11,491 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2022-12-13 15:48:11,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2022-12-13 15:48:11,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2022-12-13 15:48:11,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2022-12-13 15:48:11,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2022-12-13 15:48:11,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2022-12-13 15:48:11,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 15:48:11,492 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:48:11,498 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 15:48:11,499 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 15:48:11,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:48:11 BasicIcfg [2022-12-13 15:48:11,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 15:48:11,580 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 15:48:11,580 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 15:48:11,580 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 15:48:11,580 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:46:20" (3/4) ... [2022-12-13 15:48:11,583 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 15:48:11,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 15:48:11,583 INFO L158 Benchmark]: Toolchain (without parser) took 112727.96ms. Allocated memory was 130.0MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 92.5MB in the beginning and 857.0MB in the end (delta: -764.5MB). Peak memory consumption was 4.0GB. Max. memory is 16.1GB. [2022-12-13 15:48:11,584 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 130.0MB. Free memory is still 96.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:48:11,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.61ms. Allocated memory is still 130.0MB. Free memory was 92.5MB in the beginning and 63.5MB in the end (delta: 29.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 15:48:11,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.92ms. Allocated memory is still 130.0MB. Free memory was 63.5MB in the beginning and 60.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 15:48:11,584 INFO L158 Benchmark]: Boogie Preprocessor took 27.18ms. Allocated memory is still 130.0MB. Free memory was 60.6MB in the beginning and 58.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:48:11,585 INFO L158 Benchmark]: RCFGBuilder took 1150.89ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 58.1MB in the beginning and 59.0MB in the end (delta: -826.5kB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2022-12-13 15:48:11,585 INFO L158 Benchmark]: TraceAbstraction took 111144.85ms. Allocated memory was 188.7MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 57.9MB in the beginning and 857.0MB in the end (delta: -799.1MB). Peak memory consumption was 3.9GB. Max. memory is 16.1GB. [2022-12-13 15:48:11,585 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 4.9GB. Free memory is still 857.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:48:11,587 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.16ms. Allocated memory is still 130.0MB. Free memory is still 96.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.61ms. Allocated memory is still 130.0MB. Free memory was 92.5MB in the beginning and 63.5MB in the end (delta: 29.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.92ms. Allocated memory is still 130.0MB. Free memory was 63.5MB in the beginning and 60.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.18ms. Allocated memory is still 130.0MB. Free memory was 60.6MB in the beginning and 58.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1150.89ms. Allocated memory was 130.0MB in the beginning and 188.7MB in the end (delta: 58.7MB). Free memory was 58.1MB in the beginning and 59.0MB in the end (delta: -826.5kB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. * TraceAbstraction took 111144.85ms. Allocated memory was 188.7MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 57.9MB in the beginning and 857.0MB in the end (delta: -799.1MB). Peak memory consumption was 3.9GB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 4.9GB. Free memory is still 857.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.0s, 215 PlacesBefore, 100 PlacesAfterwards, 204 TransitionsBefore, 88 TransitionsAfterwards, 9308 CoEnabledTransitionPairs, 7 FixpointIterations, 75 TrivialSequentialCompositions, 87 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 167 TotalNumberOfCompositions, 42567 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11534, independent: 10828, independent conditional: 0, independent unconditional: 10828, dependent: 706, dependent conditional: 0, dependent unconditional: 706, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3705, independent: 3620, independent conditional: 0, independent unconditional: 3620, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11534, independent: 7208, independent conditional: 0, independent unconditional: 7208, dependent: 621, dependent conditional: 0, dependent unconditional: 621, unknown: 3705, unknown conditional: 0, unknown unconditional: 3705] , Statistics on independence cache: Total cache size (in pairs): 607, Positive cache size: 554, Positive conditional cache size: 0, Positive unconditional cache size: 554, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2225; [L855] FCALL, FORK 0 pthread_create(&t2225, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2225, ((void *)0), P0, ((void *)0))=-3, t2225={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2226; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225={7:0}, t2226={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t2226, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2226, ((void *)0), P1, ((void *)0))=-2, t2225={7:0}, t2226={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2227; [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] EXPR 1 \read(y) [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L772] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L773] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L774] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L775] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L779] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L780] EXPR 1 \read(y) [L780] 1 __unbuffered_p0_EAX = y [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] 1 y = y$flush_delayed ? y$mem_tmp : y [L782] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L859] FCALL, FORK 0 pthread_create(&t2227, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2227, ((void *)0), P2, ((void *)0))=-1, t2225={7:0}, t2226={8:0}, t2227={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L860] 0 pthread_t t2228; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225={7:0}, t2226={8:0}, t2227={5:0}, t2228={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 \read(y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L861] FCALL, FORK 0 pthread_create(&t2228, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2228, ((void *)0), P3, ((void *)0))=0, t2225={7:0}, t2226={8:0}, t2227={5:0}, t2228={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 \read(y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225={7:0}, t2226={8:0}, t2227={5:0}, t2228={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L874] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 0 y$flush_delayed = weak$$choice2 [L877] EXPR 0 \read(y) [L877] 0 y$mem_tmp = y [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] EXPR 0 \read(y) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L879] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L880] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L881] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L882] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L884] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L887] EXPR 0 \read(y) [L887] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] 0 y = y$flush_delayed ? y$mem_tmp : y [L889] 0 y$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 859]: 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: 855]: 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: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 267 locations, 88 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: 110.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 87.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2090 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1665 mSDsluCounter, 424 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 384 mSDsCounter, 425 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4306 IncrementalHoareTripleChecker+Invalid, 4731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 425 mSolverCounterUnsat, 40 mSDtfsCounter, 4306 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1439occurred in iteration=13, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 2380 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 15:48:11,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 15:48:13,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:48:13,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:48:13,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:48:13,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:48:13,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:48:13,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:48:13,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:48:13,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:48:13,313 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:48:13,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:48:13,315 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:48:13,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:48:13,316 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:48:13,317 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:48:13,318 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:48:13,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:48:13,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:48:13,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:48:13,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:48:13,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:48:13,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:48:13,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:48:13,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:48:13,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:48:13,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:48:13,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:48:13,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:48:13,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:48:13,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:48:13,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:48:13,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:48:13,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:48:13,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:48:13,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:48:13,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:48:13,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:48:13,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:48:13,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:48:13,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:48:13,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:48:13,348 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 15:48:13,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:48:13,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:48:13,373 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:48:13,373 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:48:13,374 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:48:13,374 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:48:13,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:48:13,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:48:13,375 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:48:13,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:48:13,375 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:48:13,376 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:48:13,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:48:13,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:48:13,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:48:13,376 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 15:48:13,377 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 15:48:13,377 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 15:48:13,377 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:48:13,377 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 15:48:13,377 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 15:48:13,377 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 15:48:13,378 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:48:13,378 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:48:13,378 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:48:13,378 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:48:13,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:48:13,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:48:13,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:48:13,379 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:48:13,379 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 15:48:13,380 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 15:48:13,380 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:48:13,380 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:48:13,380 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:48:13,380 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 15:48:13,380 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:48:13,381 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_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 [2022-12-13 15:48:13,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:48:13,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:48:13,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:48:13,611 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:48:13,611 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:48:13,612 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i [2022-12-13 15:48:16,153 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:48:16,356 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:48:16,357 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i [2022-12-13 15:48:16,369 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/data/421df5d82/022f11889abf487691ef113a8bf41646/FLAG4dcbdccf1 [2022-12-13 15:48:16,383 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/data/421df5d82/022f11889abf487691ef113a8bf41646 [2022-12-13 15:48:16,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:48:16,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:48:16,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:48:16,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:48:16,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:48:16,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:48:16" (1/1) ... [2022-12-13 15:48:16,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a6a260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:48:16, skipping insertion in model container [2022-12-13 15:48:16,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:48:16" (1/1) ... [2022-12-13 15:48:16,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:48:16,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:48:16,597 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_f6c600b1-edfe-41e4-8716-e5574f911de0/sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i[995,1008] [2022-12-13 15:48:16,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,764 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,765 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,766 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,767 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:48:16,808 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:48:16,820 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/sv-benchmarks/c/pthread-wmm/safe019_power.oepc.i[995,1008] [2022-12-13 15:48:16,842 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,854 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,855 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:48:16,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:48:16,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:48:16,917 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:48:16,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:48:16 WrapperNode [2022-12-13 15:48:16,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:48:16,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:48:16,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:48:16,919 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:48:16,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:48:16" (1/1) ... [2022-12-13 15:48:16,943 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:48:16" (1/1) ... [2022-12-13 15:48:16,967 INFO L138 Inliner]: procedures = 181, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 183 [2022-12-13 15:48:16,967 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:48:16,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:48:16,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:48:16,968 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:48:16,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:48:16" (1/1) ... [2022-12-13 15:48:16,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:48:16" (1/1) ... [2022-12-13 15:48:16,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:48:16" (1/1) ... [2022-12-13 15:48:16,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:48:16" (1/1) ... [2022-12-13 15:48:16,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:48:16" (1/1) ... [2022-12-13 15:48:16,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:48:16" (1/1) ... [2022-12-13 15:48:16,999 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:48:16" (1/1) ... [2022-12-13 15:48:17,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:48:16" (1/1) ... [2022-12-13 15:48:17,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:48:17,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:48:17,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:48:17,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:48:17,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:48:16" (1/1) ... [2022-12-13 15:48:17,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:48:17,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:48:17,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:48:17,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:48:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 15:48:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 15:48:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:48:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:48:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:48:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 15:48:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 15:48:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-13 15:48:17,062 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 15:48:17,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 15:48:17,062 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 15:48:17,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 15:48:17,062 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 15:48:17,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 15:48:17,062 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 15:48:17,062 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 15:48:17,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 15:48:17,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:48:17,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:48:17,064 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 15:48:17,195 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:48:17,197 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:48:17,766 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:48:18,384 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:48:18,385 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 15:48:18,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:48:18 BoogieIcfgContainer [2022-12-13 15:48:18,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:48:18,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:48:18,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:48:18,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:48:18,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:48:16" (1/3) ... [2022-12-13 15:48:18,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edc02da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:48:18, skipping insertion in model container [2022-12-13 15:48:18,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:48:16" (2/3) ... [2022-12-13 15:48:18,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edc02da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:48:18, skipping insertion in model container [2022-12-13 15:48:18,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:48:18" (3/3) ... [2022-12-13 15:48:18,395 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2022-12-13 15:48:18,414 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:48:18,414 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2022-12-13 15:48:18,414 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 15:48:18,530 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 15:48:18,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 209 transitions, 438 flow [2022-12-13 15:48:18,660 INFO L130 PetriNetUnfolder]: 2/205 cut-off events. [2022-12-13 15:48:18,661 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:48:18,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 2/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 321 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 141. Up to 2 conditions per place. [2022-12-13 15:48:18,667 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 209 transitions, 438 flow [2022-12-13 15:48:18,674 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 216 places, 205 transitions, 422 flow [2022-12-13 15:48:18,677 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 15:48:18,688 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 205 transitions, 422 flow [2022-12-13 15:48:18,690 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 205 transitions, 422 flow [2022-12-13 15:48:18,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 205 transitions, 422 flow [2022-12-13 15:48:18,738 INFO L130 PetriNetUnfolder]: 2/205 cut-off events. [2022-12-13 15:48:18,738 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:48:18,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 2/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 319 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 141. Up to 2 conditions per place. [2022-12-13 15:48:18,742 INFO L119 LiptonReduction]: Number of co-enabled transitions 9308 [2022-12-13 15:49:01,211 INFO L134 LiptonReduction]: Checked pairs total: 42629 [2022-12-13 15:49:01,212 INFO L136 LiptonReduction]: Total number of compositions: 169 [2022-12-13 15:49:01,222 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:49:01,226 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;@14890ef7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:49:01,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2022-12-13 15:49:01,227 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 15:49:01,227 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:49:01,227 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:49:01,228 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 15:49:01,228 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:49:01,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:01,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1253, now seen corresponding path program 1 times [2022-12-13 15:49:01,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:49:01,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298508566] [2022-12-13 15:49:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:01,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:49:01,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:49:01,241 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:49:01,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 15:49:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:01,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 15:49:01,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:49:01,323 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:01,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:49:01,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298508566] [2022-12-13 15:49:01,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298508566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:01,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:01,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 15:49:01,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210747946] [2022-12-13 15:49:01,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:01,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 15:49:01,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:49:01,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 15:49:01,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 15:49:01,353 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 378 [2022-12-13 15:49:01,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 88 transitions, 188 flow. Second operand has 2 states, 2 states have (on average 155.5) internal successors, (311), 2 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:01,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:49:01,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 378 [2022-12-13 15:49:01,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:49:15,193 INFO L130 PetriNetUnfolder]: 69720/92983 cut-off events. [2022-12-13 15:49:15,193 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-13 15:49:15,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184997 conditions, 92983 events. 69720/92983 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6562. Compared 630455 event pairs, 69720 based on Foata normal form. 1200/48190 useless extension candidates. Maximal degree in co-relation 184985. Up to 91727 conditions per place. [2022-12-13 15:49:15,683 INFO L137 encePairwiseOnDemand]: 345/378 looper letters, 49 selfloop transitions, 0 changer transitions 0/55 dead transitions. [2022-12-13 15:49:15,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 220 flow [2022-12-13 15:49:15,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 15:49:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 15:49:15,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 392 transitions. [2022-12-13 15:49:15,695 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-13 15:49:15,695 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 392 transitions. [2022-12-13 15:49:15,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 392 transitions. [2022-12-13 15:49:15,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:49:15,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 392 transitions. [2022-12-13 15:49:15,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 196.0) internal successors, (392), 2 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:15,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 378.0) internal successors, (1134), 3 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:15,705 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 378.0) internal successors, (1134), 3 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:15,707 INFO L175 Difference]: Start difference. First operand has 100 places, 88 transitions, 188 flow. Second operand 2 states and 392 transitions. [2022-12-13 15:49:15,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 220 flow [2022-12-13 15:49:15,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 55 transitions, 216 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 15:49:15,717 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 118 flow [2022-12-13 15:49:15,718 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2022-12-13 15:49:15,721 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -35 predicate places. [2022-12-13 15:49:15,721 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 118 flow [2022-12-13 15:49:15,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 155.5) internal successors, (311), 2 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:15,722 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:49:15,722 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:49:15,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 15:49:15,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:49:15,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:49:15,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:15,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1238787, now seen corresponding path program 1 times [2022-12-13 15:49:15,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:49:15,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891964368] [2022-12-13 15:49:15,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:15,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:49:15,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:49:15,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:49:15,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 15:49:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:16,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 15:49:16,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:16,220 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 15:49:16,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 15:49:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:49:16,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:16,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:49:16,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891964368] [2022-12-13 15:49:16,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891964368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:16,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:16,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:49:16,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255204720] [2022-12-13 15:49:16,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:16,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:49:16,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:49:16,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:49:16,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:49:16,328 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 378 [2022-12-13 15:49:16,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:16,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:49:16,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 378 [2022-12-13 15:49:16,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:49:23,769 INFO L130 PetriNetUnfolder]: 38381/50962 cut-off events. [2022-12-13 15:49:23,770 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:49:23,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102071 conditions, 50962 events. 38381/50962 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2668. Compared 312136 event pairs, 22031 based on Foata normal form. 960/31520 useless extension candidates. Maximal degree in co-relation 102068. Up to 27880 conditions per place. [2022-12-13 15:49:23,985 INFO L137 encePairwiseOnDemand]: 366/378 looper letters, 62 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2022-12-13 15:49:23,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 68 transitions, 272 flow [2022-12-13 15:49:23,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:49:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:49:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2022-12-13 15:49:23,988 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45943562610229277 [2022-12-13 15:49:23,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2022-12-13 15:49:23,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2022-12-13 15:49:23,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:49:23,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2022-12-13 15:49:23,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:23,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:23,991 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:23,992 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 118 flow. Second operand 3 states and 521 transitions. [2022-12-13 15:49:23,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 68 transitions, 272 flow [2022-12-13 15:49:23,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 68 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 15:49:23,993 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 132 flow [2022-12-13 15:49:23,993 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2022-12-13 15:49:23,994 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -35 predicate places. [2022-12-13 15:49:23,994 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 132 flow [2022-12-13 15:49:23,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:23,994 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:49:23,994 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:49:24,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 15:49:24,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:49:24,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:49:24,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:24,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1238788, now seen corresponding path program 1 times [2022-12-13 15:49:24,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:49:24,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083326239] [2022-12-13 15:49:24,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:24,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:49:24,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:49:24,203 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:49:24,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 15:49:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:24,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:49:24,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:24,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:49:24,307 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-12-13 15:49:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:49:24,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:24,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:49:24,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083326239] [2022-12-13 15:49:24,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083326239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:24,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:24,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:49:24,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580989766] [2022-12-13 15:49:24,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:24,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:49:24,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:49:24,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:49:24,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:49:24,396 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 378 [2022-12-13 15:49:24,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:24,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:49:24,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 378 [2022-12-13 15:49:24,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:49:26,541 INFO L130 PetriNetUnfolder]: 9634/13327 cut-off events. [2022-12-13 15:49:26,541 INFO L131 PetriNetUnfolder]: For 1074/1266 co-relation queries the response was YES. [2022-12-13 15:49:26,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29189 conditions, 13327 events. 9634/13327 cut-off events. For 1074/1266 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 75114 event pairs, 9634 based on Foata normal form. 651/12081 useless extension candidates. Maximal degree in co-relation 29184. Up to 13034 conditions per place. [2022-12-13 15:49:26,590 INFO L137 encePairwiseOnDemand]: 367/378 looper letters, 35 selfloop transitions, 1 changer transitions 1/42 dead transitions. [2022-12-13 15:49:26,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 42 transitions, 186 flow [2022-12-13 15:49:26,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:49:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:49:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2022-12-13 15:49:26,592 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4462081128747795 [2022-12-13 15:49:26,592 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 506 transitions. [2022-12-13 15:49:26,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 506 transitions. [2022-12-13 15:49:26,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:49:26,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 506 transitions. [2022-12-13 15:49:26,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:26,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:26,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:26,596 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 132 flow. Second operand 3 states and 506 transitions. [2022-12-13 15:49:26,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 42 transitions, 186 flow [2022-12-13 15:49:26,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 42 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:49:26,600 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 108 flow [2022-12-13 15:49:26,600 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=53, 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=108, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2022-12-13 15:49:26,600 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -45 predicate places. [2022-12-13 15:49:26,600 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 108 flow [2022-12-13 15:49:26,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:26,601 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:49:26,601 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:26,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 15:49:26,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:49:26,801 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:49:26,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:26,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1071260753, now seen corresponding path program 1 times [2022-12-13 15:49:26,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:49:26,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494549786] [2022-12-13 15:49:26,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:26,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:49:26,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:49:26,803 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:49:26,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 15:49:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:26,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 15:49:26,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:49:26,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:26,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:49:26,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494549786] [2022-12-13 15:49:26,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494549786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:26,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:26,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:49:26,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457448676] [2022-12-13 15:49:26,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:26,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:49:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:49:26,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:49:26,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:49:26,943 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 378 [2022-12-13 15:49:26,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:26,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:49:26,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 378 [2022-12-13 15:49:26,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:49:28,430 INFO L130 PetriNetUnfolder]: 5402/7864 cut-off events. [2022-12-13 15:49:28,430 INFO L131 PetriNetUnfolder]: For 580/696 co-relation queries the response was YES. [2022-12-13 15:49:28,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17094 conditions, 7864 events. 5402/7864 cut-off events. For 580/696 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 45148 event pairs, 2033 based on Foata normal form. 36/6801 useless extension candidates. Maximal degree in co-relation 17089. Up to 7468 conditions per place. [2022-12-13 15:49:28,465 INFO L137 encePairwiseOnDemand]: 372/378 looper letters, 49 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2022-12-13 15:49:28,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 258 flow [2022-12-13 15:49:28,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:49:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:49:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2022-12-13 15:49:28,469 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.445326278659612 [2022-12-13 15:49:28,469 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2022-12-13 15:49:28,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2022-12-13 15:49:28,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:49:28,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2022-12-13 15:49:28,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:28,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:28,476 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 378.0) internal successors, (1512), 4 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:28,477 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 108 flow. Second operand 3 states and 505 transitions. [2022-12-13 15:49:28,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 258 flow [2022-12-13 15:49:28,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:49:28,479 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 140 flow [2022-12-13 15:49:28,479 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2022-12-13 15:49:28,480 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -44 predicate places. [2022-12-13 15:49:28,480 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 140 flow [2022-12-13 15:49:28,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:28,481 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:49:28,481 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:28,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-12-13 15:49:28,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:49:28,682 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:49:28,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash -256806441, now seen corresponding path program 1 times [2022-12-13 15:49:28,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:49:28,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623392040] [2022-12-13 15:49:28,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:28,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:49:28,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:49:28,690 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:49:28,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 15:49:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:28,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:49:28,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:49:28,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:28,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:49:28,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623392040] [2022-12-13 15:49:28,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623392040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:28,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:28,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:49:28,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85861483] [2022-12-13 15:49:28,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:28,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:49:28,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:49:28,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:49:28,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:49:28,848 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 378 [2022-12-13 15:49:28,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:28,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:49:28,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 378 [2022-12-13 15:49:28,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:49:29,542 INFO L130 PetriNetUnfolder]: 1766/2848 cut-off events. [2022-12-13 15:49:29,542 INFO L131 PetriNetUnfolder]: For 617/649 co-relation queries the response was YES. [2022-12-13 15:49:29,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6953 conditions, 2848 events. 1766/2848 cut-off events. For 617/649 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15462 event pairs, 499 based on Foata normal form. 60/2546 useless extension candidates. Maximal degree in co-relation 6947. Up to 2226 conditions per place. [2022-12-13 15:49:29,552 INFO L137 encePairwiseOnDemand]: 372/378 looper letters, 60 selfloop transitions, 9 changer transitions 0/74 dead transitions. [2022-12-13 15:49:29,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 354 flow [2022-12-13 15:49:29,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:49:29,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:49:29,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 670 transitions. [2022-12-13 15:49:29,553 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44312169312169314 [2022-12-13 15:49:29,554 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 670 transitions. [2022-12-13 15:49:29,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 670 transitions. [2022-12-13 15:49:29,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:49:29,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 670 transitions. [2022-12-13 15:49:29,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.5) internal successors, (670), 4 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:29,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 378.0) internal successors, (1890), 5 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:29,557 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 378.0) internal successors, (1890), 5 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:29,557 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 140 flow. Second operand 4 states and 670 transitions. [2022-12-13 15:49:29,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 354 flow [2022-12-13 15:49:29,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:49:29,559 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 187 flow [2022-12-13 15:49:29,559 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2022-12-13 15:49:29,559 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -41 predicate places. [2022-12-13 15:49:29,559 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 187 flow [2022-12-13 15:49:29,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:29,560 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:49:29,560 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:29,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 15:49:29,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:49:29,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:49:29,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:29,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1107475, now seen corresponding path program 1 times [2022-12-13 15:49:29,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:49:29,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12598515] [2022-12-13 15:49:29,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:29,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:49:29,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:49:29,767 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:49:29,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 15:49:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:29,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:49:29,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:29,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:49:29,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:29,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:49:29,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12598515] [2022-12-13 15:49:29,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12598515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:29,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:29,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:49:29,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069855711] [2022-12-13 15:49:29,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:29,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:49:29,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:49:29,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:49:29,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:49:29,957 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 378 [2022-12-13 15:49:29,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 153.4) internal successors, (767), 5 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:29,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:49:29,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 378 [2022-12-13 15:49:29,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:49:30,545 INFO L130 PetriNetUnfolder]: 638/1074 cut-off events. [2022-12-13 15:49:30,545 INFO L131 PetriNetUnfolder]: For 780/783 co-relation queries the response was YES. [2022-12-13 15:49:30,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3056 conditions, 1074 events. 638/1074 cut-off events. For 780/783 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4672 event pairs, 148 based on Foata normal form. 37/1048 useless extension candidates. Maximal degree in co-relation 3049. Up to 342 conditions per place. [2022-12-13 15:49:30,550 INFO L137 encePairwiseOnDemand]: 372/378 looper letters, 69 selfloop transitions, 13 changer transitions 0/87 dead transitions. [2022-12-13 15:49:30,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 87 transitions, 455 flow [2022-12-13 15:49:30,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:49:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:49:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 833 transitions. [2022-12-13 15:49:30,555 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2022-12-13 15:49:30,555 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 833 transitions. [2022-12-13 15:49:30,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 833 transitions. [2022-12-13 15:49:30,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:49:30,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 833 transitions. [2022-12-13 15:49:30,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:30,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 378.0) internal successors, (2268), 6 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:30,565 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 378.0) internal successors, (2268), 6 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:30,565 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 187 flow. Second operand 5 states and 833 transitions. [2022-12-13 15:49:30,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 87 transitions, 455 flow [2022-12-13 15:49:30,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 437 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 15:49:30,569 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 237 flow [2022-12-13 15:49:30,570 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2022-12-13 15:49:30,570 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -38 predicate places. [2022-12-13 15:49:30,570 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 237 flow [2022-12-13 15:49:30,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 153.4) internal successors, (767), 5 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:30,571 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:49:30,571 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:30,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-12-13 15:49:30,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:49:30,773 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:49:30,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:30,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1691515285, now seen corresponding path program 1 times [2022-12-13 15:49:30,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:49:30,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462026620] [2022-12-13 15:49:30,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:30,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:49:30,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:49:30,778 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:49:30,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 15:49:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:30,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 15:49:30,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:49:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:49:31,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:49:31,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:49:31,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462026620] [2022-12-13 15:49:31,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462026620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:49:31,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:49:31,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:49:31,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612852971] [2022-12-13 15:49:31,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:49:31,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:49:31,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:49:31,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:49:31,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:49:31,013 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 378 [2022-12-13 15:49:31,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 153.33333333333334) internal successors, (920), 6 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:31,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:49:31,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 378 [2022-12-13 15:49:31,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:49:31,609 INFO L130 PetriNetUnfolder]: 520/821 cut-off events. [2022-12-13 15:49:31,610 INFO L131 PetriNetUnfolder]: For 819/819 co-relation queries the response was YES. [2022-12-13 15:49:31,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2509 conditions, 821 events. 520/821 cut-off events. For 819/819 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3359 event pairs, 120 based on Foata normal form. 10/822 useless extension candidates. Maximal degree in co-relation 2501. Up to 342 conditions per place. [2022-12-13 15:49:31,612 INFO L137 encePairwiseOnDemand]: 372/378 looper letters, 58 selfloop transitions, 17 changer transitions 1/80 dead transitions. [2022-12-13 15:49:31,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 80 transitions, 441 flow [2022-12-13 15:49:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:49:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 15:49:31,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 977 transitions. [2022-12-13 15:49:31,614 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43077601410934746 [2022-12-13 15:49:31,615 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 977 transitions. [2022-12-13 15:49:31,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 977 transitions. [2022-12-13 15:49:31,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:49:31,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 977 transitions. [2022-12-13 15:49:31,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:31,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 378.0) internal successors, (2646), 7 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:31,623 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 378.0) internal successors, (2646), 7 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:31,623 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 237 flow. Second operand 6 states and 977 transitions. [2022-12-13 15:49:31,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 80 transitions, 441 flow [2022-12-13 15:49:31,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 80 transitions, 405 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-13 15:49:31,631 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 215 flow [2022-12-13 15:49:31,631 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2022-12-13 15:49:31,631 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -43 predicate places. [2022-12-13 15:49:31,632 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 215 flow [2022-12-13 15:49:31,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 153.33333333333334) internal successors, (920), 6 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:49:31,632 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:49:31,633 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:49:31,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-12-13 15:49:31,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:49:31,834 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:49:31,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:49:31,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1215066682, now seen corresponding path program 1 times [2022-12-13 15:49:31,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:49:31,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062490945] [2022-12-13 15:49:31,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:49:31,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:49:31,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:49:31,841 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:49:31,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 15:49:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:49:32,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 15:49:32,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:51:07,861 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-12-13 15:51:07,872 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-12-13 15:51:07,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:51:07,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:51:07,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:51:07,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062490945] [2022-12-13 15:51:07,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062490945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:51:07,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:51:07,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:51:07,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753395747] [2022-12-13 15:51:07,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:51:07,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:51:07,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:51:07,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:51:07,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:51:08,020 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 378 [2022-12-13 15:51:08,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 215 flow. Second operand has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:08,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:51:08,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 378 [2022-12-13 15:51:08,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:51:08,382 INFO L130 PetriNetUnfolder]: 658/1021 cut-off events. [2022-12-13 15:51:08,382 INFO L131 PetriNetUnfolder]: For 1432/1432 co-relation queries the response was YES. [2022-12-13 15:51:08,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3127 conditions, 1021 events. 658/1021 cut-off events. For 1432/1432 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4014 event pairs, 340 based on Foata normal form. 0/1018 useless extension candidates. Maximal degree in co-relation 3119. Up to 747 conditions per place. [2022-12-13 15:51:08,385 INFO L137 encePairwiseOnDemand]: 374/378 looper letters, 62 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2022-12-13 15:51:08,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 446 flow [2022-12-13 15:51:08,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:51:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:51:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 778 transitions. [2022-12-13 15:51:08,387 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41164021164021164 [2022-12-13 15:51:08,387 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 778 transitions. [2022-12-13 15:51:08,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 778 transitions. [2022-12-13 15:51:08,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:51:08,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 778 transitions. [2022-12-13 15:51:08,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.6) internal successors, (778), 5 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:08,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 378.0) internal successors, (2268), 6 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:08,390 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 378.0) internal successors, (2268), 6 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:08,390 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 215 flow. Second operand 5 states and 778 transitions. [2022-12-13 15:51:08,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 446 flow [2022-12-13 15:51:08,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 381 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-13 15:51:08,394 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 169 flow [2022-12-13 15:51:08,394 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2022-12-13 15:51:08,394 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -45 predicate places. [2022-12-13 15:51:08,394 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 169 flow [2022-12-13 15:51:08,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:08,395 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:51:08,395 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:51:08,403 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 15:51:08,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:51:08,596 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:51:08,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:51:08,597 INFO L85 PathProgramCache]: Analyzing trace with hash -644110045, now seen corresponding path program 1 times [2022-12-13 15:51:08,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:51:08,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510683403] [2022-12-13 15:51:08,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:51:08,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:51:08,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:51:08,602 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:51:08,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 15:51:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:51:08,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 15:51:08,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:51:15,571 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-12-13 15:51:15,580 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-12-13 15:51:15,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:51:15,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:51:15,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:51:15,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510683403] [2022-12-13 15:51:15,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510683403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:51:15,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:51:15,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:51:15,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677538299] [2022-12-13 15:51:15,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:51:15,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:51:15,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:51:15,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:51:15,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:51:15,681 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 378 [2022-12-13 15:51:15,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:15,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:51:15,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 378 [2022-12-13 15:51:15,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:51:16,007 INFO L130 PetriNetUnfolder]: 520/828 cut-off events. [2022-12-13 15:51:16,007 INFO L131 PetriNetUnfolder]: For 722/722 co-relation queries the response was YES. [2022-12-13 15:51:16,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2402 conditions, 828 events. 520/828 cut-off events. For 722/722 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3350 event pairs, 255 based on Foata normal form. 0/817 useless extension candidates. Maximal degree in co-relation 2394. Up to 601 conditions per place. [2022-12-13 15:51:16,011 INFO L137 encePairwiseOnDemand]: 375/378 looper letters, 59 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2022-12-13 15:51:16,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 375 flow [2022-12-13 15:51:16,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:51:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:51:16,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 652 transitions. [2022-12-13 15:51:16,013 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4312169312169312 [2022-12-13 15:51:16,013 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 652 transitions. [2022-12-13 15:51:16,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 652 transitions. [2022-12-13 15:51:16,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:51:16,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 652 transitions. [2022-12-13 15:51:16,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:16,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 378.0) internal successors, (1890), 5 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:16,015 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 378.0) internal successors, (1890), 5 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:16,015 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 169 flow. Second operand 4 states and 652 transitions. [2022-12-13 15:51:16,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 375 flow [2022-12-13 15:51:16,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 370 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 15:51:16,019 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 166 flow [2022-12-13 15:51:16,019 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=162, 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=4, PETRI_FLOW=166, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-12-13 15:51:16,019 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -46 predicate places. [2022-12-13 15:51:16,019 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 166 flow [2022-12-13 15:51:16,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:16,020 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:51:16,020 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:51:16,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-13 15:51:16,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:51:16,221 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:51:16,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:51:16,222 INFO L85 PathProgramCache]: Analyzing trace with hash 2073851798, now seen corresponding path program 1 times [2022-12-13 15:51:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:51:16,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115078547] [2022-12-13 15:51:16,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:51:16,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:51:16,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:51:16,228 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:51:16,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 15:51:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:51:16,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:51:16,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:51:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:51:16,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:51:16,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:51:16,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115078547] [2022-12-13 15:51:16,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115078547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:51:16,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:51:16,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:51:16,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141540011] [2022-12-13 15:51:16,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:51:16,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:51:16,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:51:16,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:51:16,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:51:16,437 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 378 [2022-12-13 15:51:16,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:16,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:51:16,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 378 [2022-12-13 15:51:16,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:51:16,851 INFO L130 PetriNetUnfolder]: 912/1428 cut-off events. [2022-12-13 15:51:16,851 INFO L131 PetriNetUnfolder]: For 935/935 co-relation queries the response was YES. [2022-12-13 15:51:16,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4140 conditions, 1428 events. 912/1428 cut-off events. For 935/935 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6629 event pairs, 154 based on Foata normal form. 0/1423 useless extension candidates. Maximal degree in co-relation 4132. Up to 743 conditions per place. [2022-12-13 15:51:16,857 INFO L137 encePairwiseOnDemand]: 375/378 looper letters, 89 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2022-12-13 15:51:16,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 94 transitions, 561 flow [2022-12-13 15:51:16,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:51:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:51:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 666 transitions. [2022-12-13 15:51:16,859 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2022-12-13 15:51:16,859 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 666 transitions. [2022-12-13 15:51:16,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 666 transitions. [2022-12-13 15:51:16,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:51:16,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 666 transitions. [2022-12-13 15:51:16,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:16,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 378.0) internal successors, (1890), 5 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:16,861 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 378.0) internal successors, (1890), 5 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:16,861 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 166 flow. Second operand 4 states and 666 transitions. [2022-12-13 15:51:16,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 94 transitions, 561 flow [2022-12-13 15:51:16,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 557 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:51:16,869 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 176 flow [2022-12-13 15:51:16,869 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2022-12-13 15:51:16,869 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -43 predicate places. [2022-12-13 15:51:16,869 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 176 flow [2022-12-13 15:51:16,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:16,870 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:51:16,870 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:51:16,878 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-13 15:51:17,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:51:17,071 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:51:17,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:51:17,073 INFO L85 PathProgramCache]: Analyzing trace with hash 7372266, now seen corresponding path program 2 times [2022-12-13 15:51:17,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:51:17,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215556011] [2022-12-13 15:51:17,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 15:51:17,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:51:17,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:51:17,077 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:51:17,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-13 15:51:17,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 15:51:17,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:51:17,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:51:17,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:51:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:51:17,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:51:17,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:51:17,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215556011] [2022-12-13 15:51:17,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215556011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:51:17,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:51:17,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:51:17,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370699923] [2022-12-13 15:51:17,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:51:17,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:51:17,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:51:17,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:51:17,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:51:17,285 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 378 [2022-12-13 15:51:17,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:17,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:51:17,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 378 [2022-12-13 15:51:17,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:51:17,704 INFO L130 PetriNetUnfolder]: 1079/1805 cut-off events. [2022-12-13 15:51:17,704 INFO L131 PetriNetUnfolder]: For 1753/1769 co-relation queries the response was YES. [2022-12-13 15:51:17,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5479 conditions, 1805 events. 1079/1805 cut-off events. For 1753/1769 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9596 event pairs, 184 based on Foata normal form. 1/1772 useless extension candidates. Maximal degree in co-relation 5469. Up to 862 conditions per place. [2022-12-13 15:51:17,709 INFO L137 encePairwiseOnDemand]: 374/378 looper letters, 84 selfloop transitions, 3 changer transitions 0/92 dead transitions. [2022-12-13 15:51:17,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 92 transitions, 555 flow [2022-12-13 15:51:17,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:51:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:51:17,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 662 transitions. [2022-12-13 15:51:17,711 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43783068783068785 [2022-12-13 15:51:17,711 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 662 transitions. [2022-12-13 15:51:17,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 662 transitions. [2022-12-13 15:51:17,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:51:17,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 662 transitions. [2022-12-13 15:51:17,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:17,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 378.0) internal successors, (1890), 5 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:17,713 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 378.0) internal successors, (1890), 5 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:17,714 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 176 flow. Second operand 4 states and 662 transitions. [2022-12-13 15:51:17,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 92 transitions, 555 flow [2022-12-13 15:51:17,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 92 transitions, 554 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:51:17,727 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 189 flow [2022-12-13 15:51:17,728 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2022-12-13 15:51:17,728 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -40 predicate places. [2022-12-13 15:51:17,728 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 189 flow [2022-12-13 15:51:17,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:17,729 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:51:17,729 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:51:17,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-13 15:51:17,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:51:17,930 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:51:17,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:51:17,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1926054932, now seen corresponding path program 3 times [2022-12-13 15:51:17,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:51:17,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430604560] [2022-12-13 15:51:17,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 15:51:17,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:51:17,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:51:17,936 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:51:17,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-13 15:51:18,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 15:51:18,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:51:18,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 15:51:18,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:51:25,920 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-12-13 15:51:25,932 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-12-13 15:51:26,102 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-12-13 15:51:26,148 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-12-13 15:51:26,276 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-12-13 15:51:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:51:26,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:51:26,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:51:26,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430604560] [2022-12-13 15:51:26,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430604560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:51:26,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:51:26,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:51:26,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353126016] [2022-12-13 15:51:26,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:51:26,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:51:26,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:51:26,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:51:26,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:51:26,831 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 378 [2022-12-13 15:51:26,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 142.16666666666666) internal successors, (853), 6 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:26,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:51:26,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 378 [2022-12-13 15:51:26,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:51:27,650 INFO L130 PetriNetUnfolder]: 2011/3202 cut-off events. [2022-12-13 15:51:27,650 INFO L131 PetriNetUnfolder]: For 4192/4199 co-relation queries the response was YES. [2022-12-13 15:51:27,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10386 conditions, 3202 events. 2011/3202 cut-off events. For 4192/4199 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 17507 event pairs, 612 based on Foata normal form. 1/3148 useless extension candidates. Maximal degree in co-relation 10375. Up to 1891 conditions per place. [2022-12-13 15:51:27,660 INFO L137 encePairwiseOnDemand]: 371/378 looper letters, 68 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2022-12-13 15:51:27,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 472 flow [2022-12-13 15:51:27,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:51:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:51:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 740 transitions. [2022-12-13 15:51:27,662 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3915343915343915 [2022-12-13 15:51:27,662 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 740 transitions. [2022-12-13 15:51:27,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 740 transitions. [2022-12-13 15:51:27,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:51:27,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 740 transitions. [2022-12-13 15:51:27,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:27,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 378.0) internal successors, (2268), 6 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:27,665 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 378.0) internal successors, (2268), 6 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:27,665 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 189 flow. Second operand 5 states and 740 transitions. [2022-12-13 15:51:27,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 472 flow [2022-12-13 15:51:27,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:51:27,687 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 221 flow [2022-12-13 15:51:27,687 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2022-12-13 15:51:27,688 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -37 predicate places. [2022-12-13 15:51:27,688 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 221 flow [2022-12-13 15:51:27,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.16666666666666) internal successors, (853), 6 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:27,688 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:51:27,688 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:51:27,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-13 15:51:27,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:51:27,889 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:51:27,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:51:27,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1215849590, now seen corresponding path program 4 times [2022-12-13 15:51:27,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:51:27,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817258918] [2022-12-13 15:51:27,891 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 15:51:27,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:51:27,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:51:27,893 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:51:27,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-12-13 15:51:28,063 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 15:51:28,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:51:28,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 15:51:28,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:51:42,199 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-12-13 15:51:42,208 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-12-13 15:51:42,513 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-12-13 15:51:42,571 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-12-13 15:51:42,676 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-12-13 15:51:42,765 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-12-13 15:51:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:51:42,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:51:42,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:51:42,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817258918] [2022-12-13 15:51:42,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817258918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:51:42,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:51:42,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:51:42,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855957971] [2022-12-13 15:51:42,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:51:42,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:51:42,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:51:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:51:42,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:51:43,362 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 378 [2022-12-13 15:51:43,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 142.57142857142858) internal successors, (998), 7 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:43,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:51:43,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 378 [2022-12-13 15:51:43,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:51:44,199 INFO L130 PetriNetUnfolder]: 2202/3559 cut-off events. [2022-12-13 15:51:44,199 INFO L131 PetriNetUnfolder]: For 4594/4601 co-relation queries the response was YES. [2022-12-13 15:51:44,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12409 conditions, 3559 events. 2202/3559 cut-off events. For 4594/4601 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 20203 event pairs, 681 based on Foata normal form. 1/3499 useless extension candidates. Maximal degree in co-relation 12397. Up to 1822 conditions per place. [2022-12-13 15:51:44,211 INFO L137 encePairwiseOnDemand]: 372/378 looper letters, 69 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2022-12-13 15:51:44,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 77 transitions, 501 flow [2022-12-13 15:51:44,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:51:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:51:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 745 transitions. [2022-12-13 15:51:44,213 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3941798941798942 [2022-12-13 15:51:44,213 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 745 transitions. [2022-12-13 15:51:44,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 745 transitions. [2022-12-13 15:51:44,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:51:44,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 745 transitions. [2022-12-13 15:51:44,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:44,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 378.0) internal successors, (2268), 6 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:44,216 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 378.0) internal successors, (2268), 6 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:44,216 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 221 flow. Second operand 5 states and 745 transitions. [2022-12-13 15:51:44,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 77 transitions, 501 flow [2022-12-13 15:51:44,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 495 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:51:44,245 INFO L231 Difference]: Finished difference. Result has 66 places, 50 transitions, 241 flow [2022-12-13 15:51:44,245 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=378, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=66, PETRI_TRANSITIONS=50} [2022-12-13 15:51:44,246 INFO L288 CegarLoopForPetriNet]: 100 programPoint places, -34 predicate places. [2022-12-13 15:51:44,246 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 241 flow [2022-12-13 15:51:44,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 142.57142857142858) internal successors, (998), 7 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:51:44,246 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:51:44,246 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:51:44,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-12-13 15:51:44,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:51:44,447 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2022-12-13 15:51:44,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:51:44,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1477964206, now seen corresponding path program 5 times [2022-12-13 15:51:44,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:51:44,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991710684] [2022-12-13 15:51:44,448 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 15:51:44,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:51:44,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:51:44,449 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:51:44,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-12-13 15:51:44,683 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 15:51:44,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 15:51:44,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:51:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:51:44,910 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 15:51:44,910 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 15:51:44,911 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (87 of 88 remaining) [2022-12-13 15:51:44,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2022-12-13 15:51:44,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2022-12-13 15:51:44,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2022-12-13 15:51:44,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2022-12-13 15:51:44,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2022-12-13 15:51:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2022-12-13 15:51:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2022-12-13 15:51:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2022-12-13 15:51:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2022-12-13 15:51:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2022-12-13 15:51:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2022-12-13 15:51:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2022-12-13 15:51:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 88 remaining) [2022-12-13 15:51:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2022-12-13 15:51:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2022-12-13 15:51:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2022-12-13 15:51:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2022-12-13 15:51:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2022-12-13 15:51:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2022-12-13 15:51:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2022-12-13 15:51:44,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2022-12-13 15:51:44,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 88 remaining) [2022-12-13 15:51:44,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2022-12-13 15:51:44,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2022-12-13 15:51:44,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2022-12-13 15:51:44,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2022-12-13 15:51:44,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2022-12-13 15:51:44,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2022-12-13 15:51:44,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2022-12-13 15:51:44,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2022-12-13 15:51:44,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2022-12-13 15:51:44,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2022-12-13 15:51:44,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2022-12-13 15:51:44,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2022-12-13 15:51:44,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2022-12-13 15:51:44,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2022-12-13 15:51:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2022-12-13 15:51:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2022-12-13 15:51:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2022-12-13 15:51:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2022-12-13 15:51:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2022-12-13 15:51:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2022-12-13 15:51:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2022-12-13 15:51:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2022-12-13 15:51:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2022-12-13 15:51:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2022-12-13 15:51:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2022-12-13 15:51:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2022-12-13 15:51:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 88 remaining) [2022-12-13 15:51:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 88 remaining) [2022-12-13 15:51:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 88 remaining) [2022-12-13 15:51:44,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 88 remaining) [2022-12-13 15:51:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 88 remaining) [2022-12-13 15:51:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2022-12-13 15:51:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK (32 of 88 remaining) [2022-12-13 15:51:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 88 remaining) [2022-12-13 15:51:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 88 remaining) [2022-12-13 15:51:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 88 remaining) [2022-12-13 15:51:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 88 remaining) [2022-12-13 15:51:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2022-12-13 15:51:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2022-12-13 15:51:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2022-12-13 15:51:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 88 remaining) [2022-12-13 15:51:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 88 remaining) [2022-12-13 15:51:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2022-12-13 15:51:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2022-12-13 15:51:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2022-12-13 15:51:44,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2022-12-13 15:51:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2022-12-13 15:51:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2022-12-13 15:51:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2022-12-13 15:51:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2022-12-13 15:51:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2022-12-13 15:51:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2022-12-13 15:51:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2022-12-13 15:51:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2022-12-13 15:51:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2022-12-13 15:51:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2022-12-13 15:51:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2022-12-13 15:51:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2022-12-13 15:51:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2022-12-13 15:51:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2022-12-13 15:51:44,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2022-12-13 15:51:44,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2022-12-13 15:51:44,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2022-12-13 15:51:44,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2022-12-13 15:51:44,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2022-12-13 15:51:44,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-12-13 15:51:45,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:51:45,120 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:51:45,136 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 15:51:45,136 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 15:51:45,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:51:45 BasicIcfg [2022-12-13 15:51:45,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 15:51:45,216 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 15:51:45,216 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 15:51:45,216 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 15:51:45,217 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:48:18" (3/4) ... [2022-12-13 15:51:45,219 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 15:51:45,219 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 15:51:45,219 INFO L158 Benchmark]: Toolchain (without parser) took 208832.60ms. Allocated memory was 58.7MB in the beginning and 4.3GB in the end (delta: 4.3GB). Free memory was 26.1MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-12-13 15:51:45,220 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 58.7MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:51:45,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.51ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 25.8MB in the beginning and 54.8MB in the end (delta: -29.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 15:51:45,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.15ms. Allocated memory is still 81.8MB. Free memory was 54.8MB in the beginning and 52.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 15:51:45,220 INFO L158 Benchmark]: Boogie Preprocessor took 37.01ms. Allocated memory is still 81.8MB. Free memory was 52.0MB in the beginning and 49.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:51:45,220 INFO L158 Benchmark]: RCFGBuilder took 1381.53ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 49.2MB in the beginning and 40.6MB in the end (delta: 8.6MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2022-12-13 15:51:45,220 INFO L158 Benchmark]: TraceAbstraction took 206826.41ms. Allocated memory was 98.6MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 40.6MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-12-13 15:51:45,221 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 4.3GB. Free memory is still 2.9GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:51:45,222 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.13ms. Allocated memory is still 58.7MB. Free memory is still 37.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 529.51ms. Allocated memory was 58.7MB in the beginning and 81.8MB in the end (delta: 23.1MB). Free memory was 25.8MB in the beginning and 54.8MB in the end (delta: -29.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.15ms. Allocated memory is still 81.8MB. Free memory was 54.8MB in the beginning and 52.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.01ms. Allocated memory is still 81.8MB. Free memory was 52.0MB in the beginning and 49.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1381.53ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 49.2MB in the beginning and 40.6MB in the end (delta: 8.6MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * TraceAbstraction took 206826.41ms. Allocated memory was 98.6MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 40.6MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 4.3GB. Free memory is still 2.9GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.5s, 216 PlacesBefore, 100 PlacesAfterwards, 205 TransitionsBefore, 88 TransitionsAfterwards, 9308 CoEnabledTransitionPairs, 7 FixpointIterations, 78 TrivialSequentialCompositions, 86 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 169 TotalNumberOfCompositions, 42629 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11086, independent: 10379, independent conditional: 0, independent unconditional: 10379, dependent: 707, dependent conditional: 0, dependent unconditional: 707, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3726, independent: 3640, independent conditional: 0, independent unconditional: 3640, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11086, independent: 6739, independent conditional: 0, independent unconditional: 6739, dependent: 621, dependent conditional: 0, dependent unconditional: 621, unknown: 3726, unknown conditional: 0, unknown unconditional: 3726] , Statistics on independence cache: Total cache size (in pairs): 601, Positive cache size: 547, Positive conditional cache size: 0, Positive unconditional cache size: 547, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2225; [L855] FCALL, FORK 0 pthread_create(&t2225, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2225, ((void *)0), P0, ((void *)0))=0, t2225={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2226; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225={15:0}, t2226={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] EXPR 1 \read(y) [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L772] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L773] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L774] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L775] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L779] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L780] EXPR 1 \read(y) [L780] 1 __unbuffered_p0_EAX = y [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] EXPR 1 \read(y) [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] 1 y = y$flush_delayed ? y$mem_tmp : y [L782] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L857] FCALL, FORK 0 pthread_create(&t2226, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2226, ((void *)0), P1, ((void *)0))=1, t2225={15:0}, t2226={6:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2227; [L859] FCALL, FORK 0 pthread_create(&t2227, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2227, ((void *)0), P2, ((void *)0))=2, t2225={15:0}, t2226={6:0}, t2227={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L860] 0 pthread_t t2228; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2225={15:0}, t2226={6:0}, t2227={7:0}, t2228={23:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L809] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L861] FCALL, FORK 0 pthread_create(&t2228, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2228, ((void *)0), P3, ((void *)0))=3, t2225={15:0}, t2226={6:0}, t2227={7:0}, t2228={23:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 \read(y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L829] 4 y = 2 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 \read(y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225={15:0}, t2226={6:0}, t2227={7:0}, t2228={23:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L874] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 0 y$flush_delayed = weak$$choice2 [L877] EXPR 0 \read(y) [L877] 0 y$mem_tmp = y [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] EXPR 0 \read(y) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L879] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L880] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L881] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L882] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L884] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L887] EXPR 0 \read(y) [L887] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] EXPR 0 \read(y) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] 0 y = y$flush_delayed ? y$mem_tmp : y [L889] 0 y$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=128, weak$$choice2=0, x=1, y={3:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 859]: 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: 855]: 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: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 268 locations, 88 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: 206.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 32.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 42.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1170 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 797 mSDsluCounter, 711 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 394 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2413 IncrementalHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 317 mSDtfsCounter, 2413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=13, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 125.9s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 1951 SizeOfPredicates, 85 NumberOfNonLiveVariables, 2356 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 15:51:45,241 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6c600b1-edfe-41e4-8716-e5574f911de0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample