./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe001_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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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_7d6205ae-e240-4381-80cd-8af20ecf8508/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 67d3e2c6779f32015be5c9fe966e6a739e1c762dcde7f287ad383839eb490e84 --- 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:00:01,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:00:01,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:00:01,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:00:01,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:00:01,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:00:01,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:00:01,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:00:01,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:00:01,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:00:01,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:00:01,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:00:01,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:00:01,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:00:01,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:00:01,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:00:01,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:00:01,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:00:01,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:00:01,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:00:01,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:00:01,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:00:01,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:00:01,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:00:01,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:00:01,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:00:01,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:00:01,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:00:01,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:00:01,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:00:01,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:00:01,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:00:01,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:00:01,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:00:01,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:00:01,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:00:01,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:00:01,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:00:01,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:00:01,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:00:01,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:00:01,279 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 15:00:01,304 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:00:01,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:00:01,305 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:00:01,305 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:00:01,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:00:01,306 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:00:01,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:00:01,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:00:01,307 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:00:01,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:00:01,308 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:00:01,308 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:00:01,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:00:01,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:00:01,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:00:01,308 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 15:00:01,309 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 15:00:01,309 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 15:00:01,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:00:01,309 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 15:00:01,309 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:00:01,310 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:00:01,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:00:01,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:00:01,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:00:01,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:00:01,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:00:01,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:00:01,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:00:01,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 15:00:01,311 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:00:01,311 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:00:01,312 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:00:01,312 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:00:01,312 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_7d6205ae-e240-4381-80cd-8af20ecf8508/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_7d6205ae-e240-4381-80cd-8af20ecf8508/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 -> 67d3e2c6779f32015be5c9fe966e6a739e1c762dcde7f287ad383839eb490e84 [2022-12-13 15:00:01,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:00:01,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:00:01,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:00:01,521 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:00:01,522 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:00:01,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i [2022-12-13 15:00:04,081 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:00:04,300 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:00:04,300 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i [2022-12-13 15:00:04,311 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/data/9ab9a55b2/df1bcb5330cd4ae6bc42836269606e49/FLAG588d19077 [2022-12-13 15:00:04,653 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/data/9ab9a55b2/df1bcb5330cd4ae6bc42836269606e49 [2022-12-13 15:00:04,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:00:04,657 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:00:04,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:00:04,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:00:04,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:00:04,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:00:04" (1/1) ... [2022-12-13 15:00:04,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88e8226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:04, skipping insertion in model container [2022-12-13 15:00:04,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:00:04" (1/1) ... [2022-12-13 15:00:04,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:00:04,709 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:00:04,833 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_7d6205ae-e240-4381-80cd-8af20ecf8508/sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i[995,1008] [2022-12-13 15:00:04,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:04,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:04,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:04,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:04,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:04,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:04,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:04,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:04,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:04,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:04,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:04,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:04,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:04,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:04,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:04,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:04,972 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:04,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:04,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:04,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:04,982 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:04,984 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:04,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:04,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:04,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:04,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:04,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:04,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:04,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:05,005 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:05,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:00:05,017 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:00:05,025 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_7d6205ae-e240-4381-80cd-8af20ecf8508/sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i[995,1008] [2022-12-13 15:00:05,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:05,059 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:05,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:05,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:05,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:05,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:05,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:05,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:05,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:05,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:05,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:05,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:05,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:05,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:05,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:05,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:05,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:05,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:05,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:05,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:05,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:05,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:05,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:05,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:05,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:05,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:05,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:05,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:05,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:00:05,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:00:05,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:00:05,120 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:00:05,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:05 WrapperNode [2022-12-13 15:00:05,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:00:05,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:00:05,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:00:05,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:00:05,127 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:00:05" (1/1) ... [2022-12-13 15:00:05,143 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:00:05" (1/1) ... [2022-12-13 15:00:05,168 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2022-12-13 15:00:05,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:00:05,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:00:05,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:00:05,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:00:05,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:05" (1/1) ... [2022-12-13 15:00:05,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:05" (1/1) ... [2022-12-13 15:00:05,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:05" (1/1) ... [2022-12-13 15:00:05,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:05" (1/1) ... [2022-12-13 15:00:05,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:05" (1/1) ... [2022-12-13 15:00:05,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:05" (1/1) ... [2022-12-13 15:00:05,201 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:05" (1/1) ... [2022-12-13 15:00:05,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:05" (1/1) ... [2022-12-13 15:00:05,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:00:05,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:00:05,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:00:05,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:00:05,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:05" (1/1) ... [2022-12-13 15:00:05,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:00:05,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:00:05,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:00:05,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:00:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 15:00:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 15:00:05,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 15:00:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:00:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:00:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:00:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 15:00:05,276 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 15:00:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 15:00:05,276 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 15:00:05,276 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 15:00:05,277 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 15:00:05,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 15:00:05,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 15:00:05,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:00:05,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:00:05,279 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:00:05,412 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:00:05,414 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:00:05,908 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:00:06,601 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:00:06,601 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 15:00:06,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:00:06 BoogieIcfgContainer [2022-12-13 15:00:06,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:00:06,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:00:06,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:00:06,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:00:06,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:00:04" (1/3) ... [2022-12-13 15:00:06,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e58d643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:00:06, skipping insertion in model container [2022-12-13 15:00:06,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:00:05" (2/3) ... [2022-12-13 15:00:06,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e58d643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:00:06, skipping insertion in model container [2022-12-13 15:00:06,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:00:06" (3/3) ... [2022-12-13 15:00:06,612 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.oepc.i [2022-12-13 15:00:06,631 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:00:06,631 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2022-12-13 15:00:06,631 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 15:00:06,748 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 15:00:06,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 199 transitions, 413 flow [2022-12-13 15:00:06,849 INFO L130 PetriNetUnfolder]: 2/196 cut-off events. [2022-12-13 15:00:06,849 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:00:06,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 196 events. 2/196 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 382 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-12-13 15:00:06,854 INFO L82 GeneralOperation]: Start removeDead. Operand has 207 places, 199 transitions, 413 flow [2022-12-13 15:00:06,859 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 196 transitions, 401 flow [2022-12-13 15:00:06,862 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 15:00:06,870 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 196 transitions, 401 flow [2022-12-13 15:00:06,872 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 196 transitions, 401 flow [2022-12-13 15:00:06,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 196 transitions, 401 flow [2022-12-13 15:00:06,918 INFO L130 PetriNetUnfolder]: 2/196 cut-off events. [2022-12-13 15:00:06,918 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:00:06,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 196 events. 2/196 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 383 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-12-13 15:00:06,922 INFO L119 LiptonReduction]: Number of co-enabled transitions 9828 [2022-12-13 15:00:31,761 INFO L134 LiptonReduction]: Checked pairs total: 53521 [2022-12-13 15:00:31,761 INFO L136 LiptonReduction]: Total number of compositions: 163 [2022-12-13 15:00:31,772 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:00:31,776 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;@61521714, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:00:31,776 INFO L358 AbstractCegarLoop]: Starting to check reachability of 109 error locations. [2022-12-13 15:00:31,778 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 15:00:31,778 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:00:31,778 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:31,778 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 15:00:31,779 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:31,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:31,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1365, now seen corresponding path program 1 times [2022-12-13 15:00:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:31,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007770884] [2022-12-13 15:00:31,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:31,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:31,868 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:00:31,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:31,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007770884] [2022-12-13 15:00:31,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007770884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:31,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:31,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 15:00:31,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898598948] [2022-12-13 15:00:31,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:31,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 15:00:31,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:31,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 15:00:31,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 15:00:31,894 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 362 [2022-12-13 15:00:31,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 195 flow. Second operand has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:31,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:31,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 362 [2022-12-13 15:00:31,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:36,706 INFO L130 PetriNetUnfolder]: 18354/25862 cut-off events. [2022-12-13 15:00:36,707 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 15:00:36,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51649 conditions, 25862 events. 18354/25862 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2333. Compared 181583 event pairs, 18354 based on Foata normal form. 400/10667 useless extension candidates. Maximal degree in co-relation 51638. Up to 25691 conditions per place. [2022-12-13 15:00:36,817 INFO L137 encePairwiseOnDemand]: 320/362 looper letters, 45 selfloop transitions, 0 changer transitions 0/51 dead transitions. [2022-12-13 15:00:36,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 51 transitions, 201 flow [2022-12-13 15:00:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 15:00:36,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 15:00:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 353 transitions. [2022-12-13 15:00:36,826 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48756906077348067 [2022-12-13 15:00:36,827 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 353 transitions. [2022-12-13 15:00:36,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 353 transitions. [2022-12-13 15:00:36,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:36,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 353 transitions. [2022-12-13 15:00:36,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 176.5) internal successors, (353), 2 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have 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:00:36,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:36,836 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:36,837 INFO L175 Difference]: Start difference. First operand has 102 places, 93 transitions, 195 flow. Second operand 2 states and 353 transitions. [2022-12-13 15:00:36,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 51 transitions, 201 flow [2022-12-13 15:00:36,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 15:00:36,842 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 108 flow [2022-12-13 15:00:36,843 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=108, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2022-12-13 15:00:36,846 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -43 predicate places. [2022-12-13 15:00:36,846 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 108 flow [2022-12-13 15:00:36,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:36,847 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:36,847 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:00:36,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 15:00:36,847 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:36,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:36,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1348265, now seen corresponding path program 1 times [2022-12-13 15:00:36,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:36,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551150001] [2022-12-13 15:00:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:36,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:37,003 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:00:37,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:37,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551150001] [2022-12-13 15:00:37,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551150001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:37,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:37,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:00:37,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126901738] [2022-12-13 15:00:37,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:37,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:00:37,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:37,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:00:37,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:00:37,044 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 362 [2022-12-13 15:00:37,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:37,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:37,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 362 [2022-12-13 15:00:37,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:39,083 INFO L130 PetriNetUnfolder]: 9283/13254 cut-off events. [2022-12-13 15:00:39,083 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:00:39,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26511 conditions, 13254 events. 9283/13254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1069. Compared 85469 event pairs, 5915 based on Foata normal form. 584/7419 useless extension candidates. Maximal degree in co-relation 26508. Up to 6798 conditions per place. [2022-12-13 15:00:39,130 INFO L137 encePairwiseOnDemand]: 349/362 looper letters, 56 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2022-12-13 15:00:39,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 246 flow [2022-12-13 15:00:39,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:00:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:00:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2022-12-13 15:00:39,134 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4171270718232044 [2022-12-13 15:00:39,135 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2022-12-13 15:00:39,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2022-12-13 15:00:39,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:39,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2022-12-13 15:00:39,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have 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:00:39,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:39,144 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:39,144 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 108 flow. Second operand 3 states and 453 transitions. [2022-12-13 15:00:39,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 246 flow [2022-12-13 15:00:39,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 15:00:39,147 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 124 flow [2022-12-13 15:00:39,147 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2022-12-13 15:00:39,148 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -43 predicate places. [2022-12-13 15:00:39,148 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 124 flow [2022-12-13 15:00:39,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:39,149 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:39,149 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:00:39,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 15:00:39,149 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:39,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1348266, now seen corresponding path program 1 times [2022-12-13 15:00:39,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:39,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222198543] [2022-12-13 15:00:39,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:39,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:39,264 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:00:39,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:39,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222198543] [2022-12-13 15:00:39,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222198543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:39,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:39,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:00:39,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260572967] [2022-12-13 15:00:39,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:39,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:00:39,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:39,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:00:39,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:00:39,296 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 362 [2022-12-13 15:00:39,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have 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:00:39,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:39,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 362 [2022-12-13 15:00:39,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:40,244 INFO L130 PetriNetUnfolder]: 2528/3796 cut-off events. [2022-12-13 15:00:40,244 INFO L131 PetriNetUnfolder]: For 427/536 co-relation queries the response was YES. [2022-12-13 15:00:40,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8541 conditions, 3796 events. 2528/3796 cut-off events. For 427/536 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 21648 event pairs, 2528 based on Foata normal form. 220/3309 useless extension candidates. Maximal degree in co-relation 8536. Up to 3691 conditions per place. [2022-12-13 15:00:40,258 INFO L137 encePairwiseOnDemand]: 351/362 looper letters, 31 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2022-12-13 15:00:40,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 38 transitions, 170 flow [2022-12-13 15:00:40,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:00:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:00:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2022-12-13 15:00:40,260 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39871086556169427 [2022-12-13 15:00:40,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2022-12-13 15:00:40,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2022-12-13 15:00:40,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:40,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2022-12-13 15:00:40,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have 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:00:40,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:40,264 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:40,264 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 124 flow. Second operand 3 states and 433 transitions. [2022-12-13 15:00:40,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 38 transitions, 170 flow [2022-12-13 15:00:40,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:00:40,266 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 100 flow [2022-12-13 15:00:40,266 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-12-13 15:00:40,266 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -53 predicate places. [2022-12-13 15:00:40,266 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 100 flow [2022-12-13 15:00:40,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have 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:00:40,267 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:40,267 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:00:40,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 15:00:40,267 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:40,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:40,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2031193247, now seen corresponding path program 1 times [2022-12-13 15:00:40,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:40,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598214781] [2022-12-13 15:00:40,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:40,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:00:40,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:40,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598214781] [2022-12-13 15:00:40,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598214781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:40,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:40,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:00:40,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318099184] [2022-12-13 15:00:40,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:40,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:00:40,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:40,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:00:40,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:00:40,364 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 362 [2022-12-13 15:00:40,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have 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:00:40,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:40,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 362 [2022-12-13 15:00:40,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:41,335 INFO L130 PetriNetUnfolder]: 3145/4959 cut-off events. [2022-12-13 15:00:41,336 INFO L131 PetriNetUnfolder]: For 516/586 co-relation queries the response was YES. [2022-12-13 15:00:41,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10747 conditions, 4959 events. 3145/4959 cut-off events. For 516/586 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 31728 event pairs, 525 based on Foata normal form. 0/4202 useless extension candidates. Maximal degree in co-relation 10742. Up to 4153 conditions per place. [2022-12-13 15:00:41,351 INFO L137 encePairwiseOnDemand]: 358/362 looper letters, 55 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2022-12-13 15:00:41,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 62 transitions, 279 flow [2022-12-13 15:00:41,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:00:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:00:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2022-12-13 15:00:41,353 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4134438305709024 [2022-12-13 15:00:41,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2022-12-13 15:00:41,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2022-12-13 15:00:41,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:41,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2022-12-13 15:00:41,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have 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:00:41,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:41,356 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:41,356 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 100 flow. Second operand 3 states and 449 transitions. [2022-12-13 15:00:41,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 62 transitions, 279 flow [2022-12-13 15:00:41,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:00:41,357 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 118 flow [2022-12-13 15:00:41,357 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2022-12-13 15:00:41,357 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -52 predicate places. [2022-12-13 15:00:41,357 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 118 flow [2022-12-13 15:00:41,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have 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:00:41,358 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:41,358 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:00:41,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 15:00:41,358 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:41,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2031193483, now seen corresponding path program 1 times [2022-12-13 15:00:41,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:41,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442828450] [2022-12-13 15:00:41,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:41,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:41,444 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:00:41,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:41,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442828450] [2022-12-13 15:00:41,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442828450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:41,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:41,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:00:41,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721501574] [2022-12-13 15:00:41,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:41,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:00:41,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:41,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:00:41,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:00:41,448 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 362 [2022-12-13 15:00:41,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have 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:00:41,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:41,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 362 [2022-12-13 15:00:41,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:42,252 INFO L130 PetriNetUnfolder]: 2820/4344 cut-off events. [2022-12-13 15:00:42,252 INFO L131 PetriNetUnfolder]: For 801/956 co-relation queries the response was YES. [2022-12-13 15:00:42,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10174 conditions, 4344 events. 2820/4344 cut-off events. For 801/956 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 26543 event pairs, 1488 based on Foata normal form. 13/3665 useless extension candidates. Maximal degree in co-relation 10168. Up to 2680 conditions per place. [2022-12-13 15:00:42,266 INFO L137 encePairwiseOnDemand]: 358/362 looper letters, 56 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2022-12-13 15:00:42,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 304 flow [2022-12-13 15:00:42,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:00:42,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:00:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2022-12-13 15:00:42,268 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4189686924493554 [2022-12-13 15:00:42,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2022-12-13 15:00:42,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2022-12-13 15:00:42,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:42,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2022-12-13 15:00:42,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have 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:00:42,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:42,270 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:42,270 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 118 flow. Second operand 3 states and 455 transitions. [2022-12-13 15:00:42,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 304 flow [2022-12-13 15:00:42,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:00:42,272 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 125 flow [2022-12-13 15:00:42,272 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2022-12-13 15:00:42,272 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -50 predicate places. [2022-12-13 15:00:42,272 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 125 flow [2022-12-13 15:00:42,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have 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:00:42,273 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:42,273 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:00:42,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 15:00:42,273 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:42,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:42,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1457517609, now seen corresponding path program 1 times [2022-12-13 15:00:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:42,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377362477] [2022-12-13 15:00:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:42,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:00:42,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:42,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377362477] [2022-12-13 15:00:42,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377362477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:42,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:42,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:00:42,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668865893] [2022-12-13 15:00:42,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:42,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:00:42,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:42,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:00:42,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:00:42,460 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 362 [2022-12-13 15:00:42,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:42,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:42,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 362 [2022-12-13 15:00:42,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:43,515 INFO L130 PetriNetUnfolder]: 4346/6799 cut-off events. [2022-12-13 15:00:43,515 INFO L131 PetriNetUnfolder]: For 1446/1656 co-relation queries the response was YES. [2022-12-13 15:00:43,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16248 conditions, 6799 events. 4346/6799 cut-off events. For 1446/1656 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 45326 event pairs, 2292 based on Foata normal form. 13/5830 useless extension candidates. Maximal degree in co-relation 16241. Up to 4204 conditions per place. [2022-12-13 15:00:43,535 INFO L137 encePairwiseOnDemand]: 354/362 looper letters, 54 selfloop transitions, 7 changer transitions 0/67 dead transitions. [2022-12-13 15:00:43,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 67 transitions, 326 flow [2022-12-13 15:00:43,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:00:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:00:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2022-12-13 15:00:43,537 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4005524861878453 [2022-12-13 15:00:43,537 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2022-12-13 15:00:43,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2022-12-13 15:00:43,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:43,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2022-12-13 15:00:43,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:43,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:43,540 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:43,540 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 125 flow. Second operand 3 states and 435 transitions. [2022-12-13 15:00:43,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 67 transitions, 326 flow [2022-12-13 15:00:43,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:00:43,542 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 169 flow [2022-12-13 15:00:43,542 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2022-12-13 15:00:43,542 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -49 predicate places. [2022-12-13 15:00:43,542 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 169 flow [2022-12-13 15:00:43,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:43,543 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:43,543 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:00:43,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 15:00:43,543 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:43,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:43,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1457517610, now seen corresponding path program 1 times [2022-12-13 15:00:43,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:43,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848024780] [2022-12-13 15:00:43,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:43,790 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:00:43,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:43,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848024780] [2022-12-13 15:00:43,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848024780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:43,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:43,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:00:43,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83894849] [2022-12-13 15:00:43,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:43,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:00:43,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:43,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:00:43,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:00:43,822 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 362 [2022-12-13 15:00:43,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have 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:00:43,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:43,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 362 [2022-12-13 15:00:43,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:45,007 INFO L130 PetriNetUnfolder]: 5177/8099 cut-off events. [2022-12-13 15:00:45,008 INFO L131 PetriNetUnfolder]: For 2820/3157 co-relation queries the response was YES. [2022-12-13 15:00:45,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21349 conditions, 8099 events. 5177/8099 cut-off events. For 2820/3157 co-relation queries the response was YES. Maximal size of possible extension queue 795. Compared 56599 event pairs, 3219 based on Foata normal form. 57/6877 useless extension candidates. Maximal degree in co-relation 21341. Up to 3882 conditions per place. [2022-12-13 15:00:45,031 INFO L137 encePairwiseOnDemand]: 357/362 looper letters, 59 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2022-12-13 15:00:45,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 369 flow [2022-12-13 15:00:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:00:45,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:00:45,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 571 transitions. [2022-12-13 15:00:45,033 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39433701657458564 [2022-12-13 15:00:45,033 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 571 transitions. [2022-12-13 15:00:45,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 571 transitions. [2022-12-13 15:00:45,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:45,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 571 transitions. [2022-12-13 15:00:45,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have 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:00:45,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 362.0) internal successors, (1810), 5 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:45,036 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 362.0) internal successors, (1810), 5 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:45,036 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 169 flow. Second operand 4 states and 571 transitions. [2022-12-13 15:00:45,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 369 flow [2022-12-13 15:00:45,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:00:45,048 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 175 flow [2022-12-13 15:00:45,048 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2022-12-13 15:00:45,049 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -46 predicate places. [2022-12-13 15:00:45,049 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 175 flow [2022-12-13 15:00:45,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have 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:00:45,049 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:45,049 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:00:45,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 15:00:45,049 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:45,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:45,050 INFO L85 PathProgramCache]: Analyzing trace with hash -765284097, now seen corresponding path program 2 times [2022-12-13 15:00:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:45,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124675418] [2022-12-13 15:00:45,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:45,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:45,165 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:00:45,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:45,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124675418] [2022-12-13 15:00:45,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124675418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:45,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:45,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:00:45,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285718913] [2022-12-13 15:00:45,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:45,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:00:45,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:45,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:00:45,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:00:45,215 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 362 [2022-12-13 15:00:45,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 175 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have 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:00:45,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:45,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 362 [2022-12-13 15:00:45,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:46,355 INFO L130 PetriNetUnfolder]: 5239/8185 cut-off events. [2022-12-13 15:00:46,355 INFO L131 PetriNetUnfolder]: For 3445/3759 co-relation queries the response was YES. [2022-12-13 15:00:46,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21317 conditions, 8185 events. 5239/8185 cut-off events. For 3445/3759 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 57688 event pairs, 2971 based on Foata normal form. 60/6973 useless extension candidates. Maximal degree in co-relation 21308. Up to 6189 conditions per place. [2022-12-13 15:00:46,386 INFO L137 encePairwiseOnDemand]: 360/362 looper letters, 61 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2022-12-13 15:00:46,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 370 flow [2022-12-13 15:00:46,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:00:46,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:00:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2022-12-13 15:00:46,387 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39779005524861877 [2022-12-13 15:00:46,387 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2022-12-13 15:00:46,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2022-12-13 15:00:46,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:46,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2022-12-13 15:00:46,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have 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:00:46,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:46,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:46,389 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 175 flow. Second operand 3 states and 432 transitions. [2022-12-13 15:00:46,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 370 flow [2022-12-13 15:00:46,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 362 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 15:00:46,392 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 163 flow [2022-12-13 15:00:46,392 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2022-12-13 15:00:46,392 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -48 predicate places. [2022-12-13 15:00:46,392 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 163 flow [2022-12-13 15:00:46,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have 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:00:46,393 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:46,393 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:00:46,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 15:00:46,393 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:46,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:46,393 INFO L85 PathProgramCache]: Analyzing trace with hash -765284096, now seen corresponding path program 2 times [2022-12-13 15:00:46,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:46,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39542093] [2022-12-13 15:00:46,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:46,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:46,618 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:00:46,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:46,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39542093] [2022-12-13 15:00:46,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39542093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:46,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:46,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:00:46,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186843565] [2022-12-13 15:00:46,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:46,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:00:46,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:46,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:00:46,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:00:46,668 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 362 [2022-12-13 15:00:46,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 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:00:46,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:46,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 362 [2022-12-13 15:00:46,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:47,763 INFO L130 PetriNetUnfolder]: 5025/7858 cut-off events. [2022-12-13 15:00:47,763 INFO L131 PetriNetUnfolder]: For 3430/3764 co-relation queries the response was YES. [2022-12-13 15:00:47,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20583 conditions, 7858 events. 5025/7858 cut-off events. For 3430/3764 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 54658 event pairs, 3396 based on Foata normal form. 57/6640 useless extension candidates. Maximal degree in co-relation 20574. Up to 6060 conditions per place. [2022-12-13 15:00:47,792 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 59 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2022-12-13 15:00:47,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 356 flow [2022-12-13 15:00:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:00:47,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:00:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2022-12-13 15:00:47,793 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39226519337016574 [2022-12-13 15:00:47,793 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2022-12-13 15:00:47,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2022-12-13 15:00:47,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:47,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2022-12-13 15:00:47,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have 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:00:47,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 362.0) internal successors, (1810), 5 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:47,796 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 362.0) internal successors, (1810), 5 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:47,796 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 163 flow. Second operand 4 states and 568 transitions. [2022-12-13 15:00:47,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 356 flow [2022-12-13 15:00:47,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 350 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 15:00:47,797 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 155 flow [2022-12-13 15:00:47,798 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=155, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-13 15:00:47,798 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -49 predicate places. [2022-12-13 15:00:47,798 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 155 flow [2022-12-13 15:00:47,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 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:00:47,799 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:47,799 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:00:47,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 15:00:47,799 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:47,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:47,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1576954707, now seen corresponding path program 1 times [2022-12-13 15:00:47,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:47,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114044364] [2022-12-13 15:00:47,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:47,946 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:00:47,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:47,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114044364] [2022-12-13 15:00:47,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114044364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:47,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:47,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:00:47,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982051788] [2022-12-13 15:00:47,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:47,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:00:47,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:47,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:00:47,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:00:47,949 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 362 [2022-12-13 15:00:47,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have 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:00:47,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:47,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 362 [2022-12-13 15:00:47,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:48,880 INFO L130 PetriNetUnfolder]: 3974/6508 cut-off events. [2022-12-13 15:00:48,880 INFO L131 PetriNetUnfolder]: For 2534/2657 co-relation queries the response was YES. [2022-12-13 15:00:48,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16611 conditions, 6508 events. 3974/6508 cut-off events. For 2534/2657 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 46505 event pairs, 911 based on Foata normal form. 38/5646 useless extension candidates. Maximal degree in co-relation 16604. Up to 4327 conditions per place. [2022-12-13 15:00:48,902 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 55 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2022-12-13 15:00:48,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 342 flow [2022-12-13 15:00:48,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:00:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:00:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2022-12-13 15:00:48,904 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40699815837937386 [2022-12-13 15:00:48,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2022-12-13 15:00:48,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2022-12-13 15:00:48,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:48,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2022-12-13 15:00:48,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:48,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:48,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:48,907 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 155 flow. Second operand 3 states and 442 transitions. [2022-12-13 15:00:48,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 342 flow [2022-12-13 15:00:48,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:00:48,908 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 160 flow [2022-12-13 15:00:48,908 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-12-13 15:00:48,909 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -48 predicate places. [2022-12-13 15:00:48,909 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 160 flow [2022-12-13 15:00:48,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have 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:00:48,909 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:48,909 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:00:48,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 15:00:48,910 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:48,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1640955250, now seen corresponding path program 1 times [2022-12-13 15:00:48,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:48,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579153132] [2022-12-13 15:00:48,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:48,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:49,066 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:00:49,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:49,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579153132] [2022-12-13 15:00:49,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579153132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:49,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:49,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:00:49,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066349273] [2022-12-13 15:00:49,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:49,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:00:49,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:49,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:00:49,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:00:49,071 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 362 [2022-12-13 15:00:49,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have 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:00:49,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:49,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 362 [2022-12-13 15:00:49,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:50,039 INFO L130 PetriNetUnfolder]: 4010/6247 cut-off events. [2022-12-13 15:00:50,039 INFO L131 PetriNetUnfolder]: For 2194/2452 co-relation queries the response was YES. [2022-12-13 15:00:50,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17031 conditions, 6247 events. 4010/6247 cut-off events. For 2194/2452 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 41256 event pairs, 2388 based on Foata normal form. 22/5319 useless extension candidates. Maximal degree in co-relation 17023. Up to 4535 conditions per place. [2022-12-13 15:00:50,058 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 58 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2022-12-13 15:00:50,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 356 flow [2022-12-13 15:00:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:00:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:00:50,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2022-12-13 15:00:50,060 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4180478821362799 [2022-12-13 15:00:50,061 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2022-12-13 15:00:50,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2022-12-13 15:00:50,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:50,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2022-12-13 15:00:50,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:50,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:50,063 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:50,063 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 160 flow. Second operand 3 states and 454 transitions. [2022-12-13 15:00:50,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 356 flow [2022-12-13 15:00:50,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:00:50,065 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 164 flow [2022-12-13 15:00:50,065 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2022-12-13 15:00:50,065 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -47 predicate places. [2022-12-13 15:00:50,065 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 164 flow [2022-12-13 15:00:50,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have 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:00:50,066 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:50,066 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:00:50,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 15:00:50,066 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:50,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:50,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2061527962, now seen corresponding path program 1 times [2022-12-13 15:00:50,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:50,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919407810] [2022-12-13 15:00:50,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:50,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:50,173 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:00:50,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:50,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919407810] [2022-12-13 15:00:50,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919407810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:50,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:50,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:00:50,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715897741] [2022-12-13 15:00:50,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:50,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:00:50,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:50,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:00:50,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:00:50,180 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 362 [2022-12-13 15:00:50,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have 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:00:50,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:50,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 362 [2022-12-13 15:00:50,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:50,643 INFO L130 PetriNetUnfolder]: 1334/2340 cut-off events. [2022-12-13 15:00:50,643 INFO L131 PetriNetUnfolder]: For 878/928 co-relation queries the response was YES. [2022-12-13 15:00:50,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6483 conditions, 2340 events. 1334/2340 cut-off events. For 878/928 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 14613 event pairs, 497 based on Foata normal form. 39/2125 useless extension candidates. Maximal degree in co-relation 6474. Up to 2068 conditions per place. [2022-12-13 15:00:50,650 INFO L137 encePairwiseOnDemand]: 357/362 looper letters, 49 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2022-12-13 15:00:50,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 59 transitions, 324 flow [2022-12-13 15:00:50,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:00:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:00:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2022-12-13 15:00:50,653 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39779005524861877 [2022-12-13 15:00:50,653 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2022-12-13 15:00:50,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2022-12-13 15:00:50,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:50,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2022-12-13 15:00:50,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have 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:00:50,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:50,655 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:50,655 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 164 flow. Second operand 3 states and 432 transitions. [2022-12-13 15:00:50,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 59 transitions, 324 flow [2022-12-13 15:00:50,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:00:50,657 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 186 flow [2022-12-13 15:00:50,657 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2022-12-13 15:00:50,657 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -46 predicate places. [2022-12-13 15:00:50,657 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 186 flow [2022-12-13 15:00:50,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have 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:00:50,658 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:50,658 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:00:50,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 15:00:50,658 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:50,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash -747627660, now seen corresponding path program 1 times [2022-12-13 15:00:50,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:50,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315293197] [2022-12-13 15:00:50,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:50,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:50,720 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:00:50,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:50,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315293197] [2022-12-13 15:00:50,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315293197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:50,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:50,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:00:50,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259181325] [2022-12-13 15:00:50,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:50,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:00:50,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:50,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:00:50,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:00:50,725 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 362 [2022-12-13 15:00:50,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have 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:00:50,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:50,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 362 [2022-12-13 15:00:50,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:51,378 INFO L130 PetriNetUnfolder]: 2150/3740 cut-off events. [2022-12-13 15:00:51,379 INFO L131 PetriNetUnfolder]: For 1742/1814 co-relation queries the response was YES. [2022-12-13 15:00:51,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10888 conditions, 3740 events. 2150/3740 cut-off events. For 1742/1814 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 25049 event pairs, 839 based on Foata normal form. 36/3375 useless extension candidates. Maximal degree in co-relation 10878. Up to 1986 conditions per place. [2022-12-13 15:00:51,390 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 71 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2022-12-13 15:00:51,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 454 flow [2022-12-13 15:00:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:00:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:00:51,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2022-12-13 15:00:51,393 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4116022099447514 [2022-12-13 15:00:51,393 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2022-12-13 15:00:51,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2022-12-13 15:00:51,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:51,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2022-12-13 15:00:51,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have 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:00:51,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:51,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:51,397 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 186 flow. Second operand 3 states and 447 transitions. [2022-12-13 15:00:51,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 454 flow [2022-12-13 15:00:51,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:00:51,399 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 193 flow [2022-12-13 15:00:51,399 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2022-12-13 15:00:51,399 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -44 predicate places. [2022-12-13 15:00:51,399 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 193 flow [2022-12-13 15:00:51,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have 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:00:51,400 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:51,400 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:00:51,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 15:00:51,400 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:51,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:51,400 INFO L85 PathProgramCache]: Analyzing trace with hash -62857332, now seen corresponding path program 1 times [2022-12-13 15:00:51,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:51,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800616975] [2022-12-13 15:00:51,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:51,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:52,408 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:00:52,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:52,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800616975] [2022-12-13 15:00:52,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800616975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:52,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:52,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:00:52,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789688883] [2022-12-13 15:00:52,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:52,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:00:52,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:52,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:00:52,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:00:52,465 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 362 [2022-12-13 15:00:52,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have 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:00:52,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:52,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 362 [2022-12-13 15:00:52,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:53,256 INFO L130 PetriNetUnfolder]: 2746/4654 cut-off events. [2022-12-13 15:00:53,257 INFO L131 PetriNetUnfolder]: For 2474/2499 co-relation queries the response was YES. [2022-12-13 15:00:53,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13357 conditions, 4654 events. 2746/4654 cut-off events. For 2474/2499 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 29514 event pairs, 1675 based on Foata normal form. 20/4327 useless extension candidates. Maximal degree in co-relation 13346. Up to 3977 conditions per place. [2022-12-13 15:00:53,271 INFO L137 encePairwiseOnDemand]: 353/362 looper letters, 59 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2022-12-13 15:00:53,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 417 flow [2022-12-13 15:00:53,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:00:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:00:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 552 transitions. [2022-12-13 15:00:53,273 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3812154696132597 [2022-12-13 15:00:53,273 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 552 transitions. [2022-12-13 15:00:53,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 552 transitions. [2022-12-13 15:00:53,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:53,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 552 transitions. [2022-12-13 15:00:53,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:53,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 362.0) internal successors, (1810), 5 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:53,275 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 362.0) internal successors, (1810), 5 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:53,275 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 193 flow. Second operand 4 states and 552 transitions. [2022-12-13 15:00:53,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 417 flow [2022-12-13 15:00:53,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 409 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 15:00:53,278 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 232 flow [2022-12-13 15:00:53,278 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2022-12-13 15:00:53,278 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -42 predicate places. [2022-12-13 15:00:53,278 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 232 flow [2022-12-13 15:00:53,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have 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:00:53,278 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:53,279 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:00:53,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 15:00:53,279 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:53,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:53,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1685519930, now seen corresponding path program 2 times [2022-12-13 15:00:53,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:53,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721822517] [2022-12-13 15:00:53,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:53,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:54,590 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:00:54,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:54,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721822517] [2022-12-13 15:00:54,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721822517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:54,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:54,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:00:54,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253725113] [2022-12-13 15:00:54,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:54,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:00:54,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:54,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:00:54,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:00:54,647 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 362 [2022-12-13 15:00:54,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have 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:00:54,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:54,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 362 [2022-12-13 15:00:54,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:55,933 INFO L130 PetriNetUnfolder]: 3014/5125 cut-off events. [2022-12-13 15:00:55,934 INFO L131 PetriNetUnfolder]: For 3867/3891 co-relation queries the response was YES. [2022-12-13 15:00:55,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16217 conditions, 5125 events. 3014/5125 cut-off events. For 3867/3891 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 33337 event pairs, 1756 based on Foata normal form. 10/4742 useless extension candidates. Maximal degree in co-relation 16205. Up to 4357 conditions per place. [2022-12-13 15:00:55,959 INFO L137 encePairwiseOnDemand]: 352/362 looper letters, 76 selfloop transitions, 14 changer transitions 0/94 dead transitions. [2022-12-13 15:00:55,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 94 transitions, 598 flow [2022-12-13 15:00:55,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:00:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 15:00:55,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 803 transitions. [2022-12-13 15:00:55,964 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.36970534069981587 [2022-12-13 15:00:55,964 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 803 transitions. [2022-12-13 15:00:55,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 803 transitions. [2022-12-13 15:00:55,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:55,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 803 transitions. [2022-12-13 15:00:55,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have 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:00:55,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have 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:00:55,972 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have 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:00:55,972 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 232 flow. Second operand 6 states and 803 transitions. [2022-12-13 15:00:55,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 94 transitions, 598 flow [2022-12-13 15:00:55,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 94 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:00:55,977 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 328 flow [2022-12-13 15:00:55,978 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2022-12-13 15:00:55,978 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -37 predicate places. [2022-12-13 15:00:55,978 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 328 flow [2022-12-13 15:00:55,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have 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:00:55,979 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:55,979 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:00:55,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 15:00:55,979 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:55,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:55,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1371954375, now seen corresponding path program 1 times [2022-12-13 15:00:55,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:55,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115301956] [2022-12-13 15:00:55,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:55,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:56,155 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:00:56,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:56,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115301956] [2022-12-13 15:00:56,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115301956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:56,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:56,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:00:56,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186223691] [2022-12-13 15:00:56,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:56,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:00:56,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:56,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:00:56,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:00:56,162 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 362 [2022-12-13 15:00:56,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 328 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:56,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:56,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 362 [2022-12-13 15:00:56,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:56,579 INFO L130 PetriNetUnfolder]: 575/1217 cut-off events. [2022-12-13 15:00:56,580 INFO L131 PetriNetUnfolder]: For 1196/1268 co-relation queries the response was YES. [2022-12-13 15:00:56,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4172 conditions, 1217 events. 575/1217 cut-off events. For 1196/1268 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7304 event pairs, 135 based on Foata normal form. 93/1241 useless extension candidates. Maximal degree in co-relation 4158. Up to 634 conditions per place. [2022-12-13 15:00:56,583 INFO L137 encePairwiseOnDemand]: 357/362 looper letters, 65 selfloop transitions, 7 changer transitions 1/84 dead transitions. [2022-12-13 15:00:56,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 84 transitions, 584 flow [2022-12-13 15:00:56,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:00:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:00:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 571 transitions. [2022-12-13 15:00:56,585 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39433701657458564 [2022-12-13 15:00:56,585 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 571 transitions. [2022-12-13 15:00:56,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 571 transitions. [2022-12-13 15:00:56,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:56,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 571 transitions. [2022-12-13 15:00:56,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have 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:00:56,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 362.0) internal successors, (1810), 5 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:56,588 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 362.0) internal successors, (1810), 5 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:56,588 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 328 flow. Second operand 4 states and 571 transitions. [2022-12-13 15:00:56,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 84 transitions, 584 flow [2022-12-13 15:00:56,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 583 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:00:56,590 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 340 flow [2022-12-13 15:00:56,590 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2022-12-13 15:00:56,590 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -34 predicate places. [2022-12-13 15:00:56,591 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 340 flow [2022-12-13 15:00:56,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:56,591 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:56,591 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:00:56,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 15:00:56,591 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:56,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:56,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1462172796, now seen corresponding path program 1 times [2022-12-13 15:00:56,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:56,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732454683] [2022-12-13 15:00:56,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:56,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:58,003 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:00:58,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:58,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732454683] [2022-12-13 15:00:58,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732454683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:58,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:58,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 15:00:58,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576754351] [2022-12-13 15:00:58,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:58,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 15:00:58,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:58,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 15:00:58,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-13 15:00:58,261 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 362 [2022-12-13 15:00:58,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 340 flow. Second operand has 10 states, 10 states have (on average 117.8) internal successors, (1178), 10 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have 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:00:58,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:58,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 362 [2022-12-13 15:00:58,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:59,362 INFO L130 PetriNetUnfolder]: 1008/2047 cut-off events. [2022-12-13 15:00:59,362 INFO L131 PetriNetUnfolder]: For 3480/3484 co-relation queries the response was YES. [2022-12-13 15:00:59,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7755 conditions, 2047 events. 1008/2047 cut-off events. For 3480/3484 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 13079 event pairs, 127 based on Foata normal form. 40/2010 useless extension candidates. Maximal degree in co-relation 7740. Up to 743 conditions per place. [2022-12-13 15:00:59,368 INFO L137 encePairwiseOnDemand]: 344/362 looper letters, 104 selfloop transitions, 54 changer transitions 2/162 dead transitions. [2022-12-13 15:00:59,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 162 transitions, 1225 flow [2022-12-13 15:00:59,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 15:00:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 15:00:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1404 transitions. [2022-12-13 15:00:59,371 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.35258663987945754 [2022-12-13 15:00:59,371 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1404 transitions. [2022-12-13 15:00:59,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1404 transitions. [2022-12-13 15:00:59,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:59,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1404 transitions. [2022-12-13 15:00:59,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 127.63636363636364) internal successors, (1404), 11 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have 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:00:59,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states have 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:00:59,376 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states have 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:00:59,376 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 340 flow. Second operand 11 states and 1404 transitions. [2022-12-13 15:00:59,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 162 transitions, 1225 flow [2022-12-13 15:00:59,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 162 transitions, 1189 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 15:00:59,381 INFO L231 Difference]: Finished difference. Result has 83 places, 100 transitions, 795 flow [2022-12-13 15:00:59,381 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=795, PETRI_PLACES=83, PETRI_TRANSITIONS=100} [2022-12-13 15:00:59,381 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -19 predicate places. [2022-12-13 15:00:59,381 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 100 transitions, 795 flow [2022-12-13 15:00:59,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 117.8) internal successors, (1178), 10 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have 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:00:59,382 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:59,382 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:00:59,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 15:00:59,382 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:59,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:59,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1414412, now seen corresponding path program 1 times [2022-12-13 15:00:59,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:59,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572494840] [2022-12-13 15:00:59,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:59,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:00:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:00:59,576 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:00:59,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:00:59,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572494840] [2022-12-13 15:00:59,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572494840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:00:59,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:00:59,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:00:59,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177935048] [2022-12-13 15:00:59,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:00:59,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:00:59,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:00:59,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:00:59,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:00:59,583 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 362 [2022-12-13 15:00:59,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 100 transitions, 795 flow. Second operand has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 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:00:59,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:00:59,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 362 [2022-12-13 15:00:59,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:00:59,920 INFO L130 PetriNetUnfolder]: 452/927 cut-off events. [2022-12-13 15:00:59,921 INFO L131 PetriNetUnfolder]: For 2852/2958 co-relation queries the response was YES. [2022-12-13 15:00:59,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4045 conditions, 927 events. 452/927 cut-off events. For 2852/2958 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5343 event pairs, 62 based on Foata normal form. 103/1004 useless extension candidates. Maximal degree in co-relation 4022. Up to 377 conditions per place. [2022-12-13 15:00:59,924 INFO L137 encePairwiseOnDemand]: 357/362 looper letters, 66 selfloop transitions, 10 changer transitions 2/89 dead transitions. [2022-12-13 15:00:59,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 89 transitions, 811 flow [2022-12-13 15:00:59,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:00:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:00:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 695 transitions. [2022-12-13 15:00:59,926 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3839779005524862 [2022-12-13 15:00:59,926 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 695 transitions. [2022-12-13 15:00:59,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 695 transitions. [2022-12-13 15:00:59,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:00:59,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 695 transitions. [2022-12-13 15:00:59,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:59,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 362.0) internal successors, (2172), 6 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:59,929 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 362.0) internal successors, (2172), 6 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:00:59,929 INFO L175 Difference]: Start difference. First operand has 83 places, 100 transitions, 795 flow. Second operand 5 states and 695 transitions. [2022-12-13 15:00:59,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 89 transitions, 811 flow [2022-12-13 15:00:59,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 89 transitions, 678 flow, removed 21 selfloop flow, removed 13 redundant places. [2022-12-13 15:00:59,934 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 361 flow [2022-12-13 15:00:59,934 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=361, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2022-12-13 15:00:59,934 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -33 predicate places. [2022-12-13 15:00:59,934 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 361 flow [2022-12-13 15:00:59,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 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:00:59,935 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:00:59,935 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:00:59,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 15:00:59,935 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:00:59,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:00:59,935 INFO L85 PathProgramCache]: Analyzing trace with hash 235715034, now seen corresponding path program 1 times [2022-12-13 15:00:59,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:00:59,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76656166] [2022-12-13 15:00:59,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:00:59,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:01:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:01:00,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:01:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:01:00,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:01:00,099 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 15:01:00,100 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (108 of 109 remaining) [2022-12-13 15:01:00,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 109 remaining) [2022-12-13 15:01:00,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 109 remaining) [2022-12-13 15:01:00,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 109 remaining) [2022-12-13 15:01:00,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 109 remaining) [2022-12-13 15:01:00,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 109 remaining) [2022-12-13 15:01:00,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 109 remaining) [2022-12-13 15:01:00,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 109 remaining) [2022-12-13 15:01:00,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 109 remaining) [2022-12-13 15:01:00,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 109 remaining) [2022-12-13 15:01:00,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 109 remaining) [2022-12-13 15:01:00,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 109 remaining) [2022-12-13 15:01:00,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 109 remaining) [2022-12-13 15:01:00,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 109 remaining) [2022-12-13 15:01:00,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 109 remaining) [2022-12-13 15:01:00,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 109 remaining) [2022-12-13 15:01:00,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 109 remaining) [2022-12-13 15:01:00,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 109 remaining) [2022-12-13 15:01:00,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 109 remaining) [2022-12-13 15:01:00,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 109 remaining) [2022-12-13 15:01:00,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 109 remaining) [2022-12-13 15:01:00,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 109 remaining) [2022-12-13 15:01:00,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 109 remaining) [2022-12-13 15:01:00,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 109 remaining) [2022-12-13 15:01:00,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 109 remaining) [2022-12-13 15:01:00,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 109 remaining) [2022-12-13 15:01:00,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 109 remaining) [2022-12-13 15:01:00,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 109 remaining) [2022-12-13 15:01:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 109 remaining) [2022-12-13 15:01:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 109 remaining) [2022-12-13 15:01:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 109 remaining) [2022-12-13 15:01:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 109 remaining) [2022-12-13 15:01:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 109 remaining) [2022-12-13 15:01:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 109 remaining) [2022-12-13 15:01:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 109 remaining) [2022-12-13 15:01:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 109 remaining) [2022-12-13 15:01:00,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 109 remaining) [2022-12-13 15:01:00,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 109 remaining) [2022-12-13 15:01:00,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 109 remaining) [2022-12-13 15:01:00,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 109 remaining) [2022-12-13 15:01:00,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 109 remaining) [2022-12-13 15:01:00,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 109 remaining) [2022-12-13 15:01:00,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 109 remaining) [2022-12-13 15:01:00,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 109 remaining) [2022-12-13 15:01:00,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 109 remaining) [2022-12-13 15:01:00,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 109 remaining) [2022-12-13 15:01:00,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 109 remaining) [2022-12-13 15:01:00,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 109 remaining) [2022-12-13 15:01:00,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 109 remaining) [2022-12-13 15:01:00,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 109 remaining) [2022-12-13 15:01:00,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 109 remaining) [2022-12-13 15:01:00,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 109 remaining) [2022-12-13 15:01:00,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 109 remaining) [2022-12-13 15:01:00,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 109 remaining) [2022-12-13 15:01:00,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 109 remaining) [2022-12-13 15:01:00,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 109 remaining) [2022-12-13 15:01:00,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 109 remaining) [2022-12-13 15:01:00,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 109 remaining) [2022-12-13 15:01:00,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 109 remaining) [2022-12-13 15:01:00,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 109 remaining) [2022-12-13 15:01:00,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 109 remaining) [2022-12-13 15:01:00,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 109 remaining) [2022-12-13 15:01:00,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 109 remaining) [2022-12-13 15:01:00,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 109 remaining) [2022-12-13 15:01:00,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 109 remaining) [2022-12-13 15:01:00,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (43 of 109 remaining) [2022-12-13 15:01:00,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 109 remaining) [2022-12-13 15:01:00,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 109 remaining) [2022-12-13 15:01:00,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 109 remaining) [2022-12-13 15:01:00,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 109 remaining) [2022-12-13 15:01:00,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 109 remaining) [2022-12-13 15:01:00,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 109 remaining) [2022-12-13 15:01:00,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 109 remaining) [2022-12-13 15:01:00,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 109 remaining) [2022-12-13 15:01:00,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 109 remaining) [2022-12-13 15:01:00,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 109 remaining) [2022-12-13 15:01:00,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 109 remaining) [2022-12-13 15:01:00,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 109 remaining) [2022-12-13 15:01:00,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 109 remaining) [2022-12-13 15:01:00,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 109 remaining) [2022-12-13 15:01:00,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 109 remaining) [2022-12-13 15:01:00,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 109 remaining) [2022-12-13 15:01:00,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 109 remaining) [2022-12-13 15:01:00,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 109 remaining) [2022-12-13 15:01:00,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 109 remaining) [2022-12-13 15:01:00,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 109 remaining) [2022-12-13 15:01:00,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 109 remaining) [2022-12-13 15:01:00,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 109 remaining) [2022-12-13 15:01:00,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 109 remaining) [2022-12-13 15:01:00,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 109 remaining) [2022-12-13 15:01:00,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 109 remaining) [2022-12-13 15:01:00,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 109 remaining) [2022-12-13 15:01:00,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 109 remaining) [2022-12-13 15:01:00,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 109 remaining) [2022-12-13 15:01:00,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 109 remaining) [2022-12-13 15:01:00,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 109 remaining) [2022-12-13 15:01:00,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 109 remaining) [2022-12-13 15:01:00,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 109 remaining) [2022-12-13 15:01:00,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 109 remaining) [2022-12-13 15:01:00,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 109 remaining) [2022-12-13 15:01:00,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 109 remaining) [2022-12-13 15:01:00,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 109 remaining) [2022-12-13 15:01:00,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 109 remaining) [2022-12-13 15:01:00,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 109 remaining) [2022-12-13 15:01:00,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 109 remaining) [2022-12-13 15:01:00,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 109 remaining) [2022-12-13 15:01:00,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 109 remaining) [2022-12-13 15:01:00,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 109 remaining) [2022-12-13 15:01:00,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 109 remaining) [2022-12-13 15:01:00,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 15:01:00,114 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:01:00,121 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 15:01:00,121 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 15:01:00,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:01:00 BasicIcfg [2022-12-13 15:01:00,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 15:01:00,167 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 15:01:00,167 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 15:01:00,167 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 15:01:00,167 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:00:06" (3/4) ... [2022-12-13 15:01:00,169 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 15:01:00,169 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 15:01:00,170 INFO L158 Benchmark]: Toolchain (without parser) took 55513.00ms. Allocated memory was 111.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 75.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 454.4MB. Max. memory is 16.1GB. [2022-12-13 15:01:00,170 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 111.1MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:01:00,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.00ms. Allocated memory was 111.1MB in the beginning and 142.6MB in the end (delta: 31.5MB). Free memory was 75.3MB in the beginning and 109.8MB in the end (delta: -34.5MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2022-12-13 15:01:00,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.43ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 106.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:01:00,171 INFO L158 Benchmark]: Boogie Preprocessor took 38.28ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 104.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:01:00,171 INFO L158 Benchmark]: RCFGBuilder took 1395.56ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 86.4MB in the end (delta: 17.9MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2022-12-13 15:01:00,171 INFO L158 Benchmark]: TraceAbstraction took 53560.30ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 86.4MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 430.3MB. Max. memory is 16.1GB. [2022-12-13 15:01:00,171 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 2.3GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:01:00,173 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.11ms. Allocated memory is still 111.1MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.00ms. Allocated memory was 111.1MB in the beginning and 142.6MB in the end (delta: 31.5MB). Free memory was 75.3MB in the beginning and 109.8MB in the end (delta: -34.5MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.43ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 106.4MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.28ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 104.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1395.56ms. Allocated memory is still 142.6MB. Free memory was 104.3MB in the beginning and 86.4MB in the end (delta: 17.9MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * TraceAbstraction took 53560.30ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 86.4MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 430.3MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 2.3GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.9s, 204 PlacesBefore, 102 PlacesAfterwards, 196 TransitionsBefore, 93 TransitionsAfterwards, 9828 CoEnabledTransitionPairs, 8 FixpointIterations, 70 TrivialSequentialCompositions, 88 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 163 TotalNumberOfCompositions, 53521 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10334, independent: 9541, independent conditional: 0, independent unconditional: 9541, dependent: 793, dependent conditional: 0, dependent unconditional: 793, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3369, independent: 3257, independent conditional: 0, independent unconditional: 3257, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10334, independent: 6284, independent conditional: 0, independent unconditional: 6284, dependent: 681, dependent conditional: 0, dependent unconditional: 681, unknown: 3369, unknown conditional: 0, unknown unconditional: 3369] , Statistics on independence cache: Total cache size (in pairs): 373, Positive cache size: 320, Positive conditional cache size: 0, Positive unconditional cache size: 320, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1801; [L852] FCALL, FORK 0 pthread_create(&t1801, ((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_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$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_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1801, ((void *)0), P0, ((void *)0))=-2, t1801={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L853] 0 pthread_t t1802; [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L764] 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)))) [L764] EXPR 1 \read(y) [L764] 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)))) [L764] 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)))) [L765] 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)))) [L766] 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)))) [L767] 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)))) [L768] 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)))) [L769] 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)))) [L770] 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)))) [L771] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L772] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L773] EXPR 1 \read(y) [L773] 1 __unbuffered_p0_EAX = y [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] 1 y = y$flush_delayed ? y$mem_tmp : y [L775] 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_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$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_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] FCALL, FORK 0 pthread_create(&t1802, ((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_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$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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1802, ((void *)0), P1, ((void *)0))=-1, t1801={6:0}, t1802={7:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] 0 pthread_t t1803; [L778] 1 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_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$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_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=255, weak$$choice2=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 x = 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_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$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_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=255, weak$$choice2=1, x=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 2 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_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$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_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=255, weak$$choice2=1, x=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 \read(y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L798] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L799] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L800] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_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_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$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_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=255, weak$$choice2=1, x=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] FCALL, FORK 0 pthread_create(&t1803, ((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_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$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_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(&t1803, ((void *)0), P2, ((void *)0))=0, t1801={6:0}, t1802={7:0}, t1803={5:0}, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 y$flush_delayed = weak$$choice2 [L813] EXPR 3 \read(y) [L813] 3 y$mem_tmp = y [L814] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L814] EXPR 3 \read(y) [L814] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L814] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L816] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L817] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L818] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L820] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 \read(y) [L821] 3 __unbuffered_p2_EAX = y [L822] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L822] 3 y = y$flush_delayed ? y$mem_tmp : y [L823] 3 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_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$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_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=4, weak$$choice1=255, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 3 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_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$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_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=4, weak$$choice1=255, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] 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) [L829] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L829] EXPR 3 \read(y) [L829] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L829] 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) [L829] 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) [L830] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L831] 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 [L832] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L833] 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_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$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_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=4, weak$$choice1=255, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 3 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] 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) [L862] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L862] EXPR 0 \read(y) [L862] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L862] 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) [L862] 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) [L863] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 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 [L865] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L866] 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}, __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_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$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_p2_EAX=1, 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, t1801={6:0}, t1802={7:0}, t1803={5:0}, weak$$choice0=4, weak$$choice1=255, weak$$choice2=1, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L869] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L870] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L871] 0 y$flush_delayed = weak$$choice2 [L872] EXPR 0 \read(y) [L872] 0 y$mem_tmp = y [L873] 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) [L873] EXPR 0 \read(y) [L873] 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) [L873] 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) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 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)) [L878] 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)) [L879] 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)) [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 x == 2 && y == 2 [L882] EXPR 0 \read(y) [L882] EXPR 0 x == 2 && y == 2 [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L883] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 [L886] 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}, __unbuffered_cnt=3, __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_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$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_p2_EAX=1, 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=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 852]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 264 locations, 109 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: 53.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 22.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 25.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1410 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1029 mSDsluCounter, 471 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 370 mSDsCounter, 293 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2239 IncrementalHoareTripleChecker+Invalid, 2532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 293 mSolverCounterUnsat, 101 mSDtfsCounter, 2239 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=795occurred in iteration=17, InterpolantAutomatonStates: 70, 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, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 1901 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 15:01:00,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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_7d6205ae-e240-4381-80cd-8af20ecf8508/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 67d3e2c6779f32015be5c9fe966e6a739e1c762dcde7f287ad383839eb490e84 --- 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:01:01,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:01:01,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:01:01,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:01:01,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:01:01,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:01:01,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:01:01,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:01:01,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:01:01,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:01:01,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:01:01,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:01:01,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:01:01,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:01:01,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:01:01,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:01:01,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:01:01,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:01:01,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:01:01,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:01:01,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:01:01,944 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:01:01,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:01:01,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:01:01,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:01:01,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:01:01,956 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:01:01,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:01:01,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:01:01,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:01:01,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:01:01,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:01:01,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:01:01,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:01:01,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:01:01,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:01:01,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:01:01,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:01:01,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:01:01,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:01:01,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:01:01,970 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 15:01:01,997 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:01:01,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:01:01,998 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:01:01,998 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:01:01,999 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:01:01,999 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:01:01,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:01:02,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:01:02,000 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:01:02,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:01:02,000 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:01:02,001 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:01:02,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:01:02,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:01:02,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:01:02,001 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 15:01:02,001 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 15:01:02,002 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 15:01:02,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:01:02,002 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 15:01:02,002 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 15:01:02,002 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 15:01:02,002 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:01:02,003 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:01:02,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:01:02,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:01:02,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:01:02,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:01:02,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:01:02,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:01:02,004 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 15:01:02,004 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 15:01:02,004 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:01:02,005 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:01:02,005 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:01:02,005 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 15:01:02,005 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:01:02,006 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_7d6205ae-e240-4381-80cd-8af20ecf8508/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_7d6205ae-e240-4381-80cd-8af20ecf8508/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 -> 67d3e2c6779f32015be5c9fe966e6a739e1c762dcde7f287ad383839eb490e84 [2022-12-13 15:01:02,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:01:02,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:01:02,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:01:02,266 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:01:02,266 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:01:02,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i [2022-12-13 15:01:04,813 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:01:05,021 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:01:05,022 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i [2022-12-13 15:01:05,034 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/data/18717108a/4b7385febb8b41c7b25953a528b43bbb/FLAG30d131777 [2022-12-13 15:01:05,388 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/data/18717108a/4b7385febb8b41c7b25953a528b43bbb [2022-12-13 15:01:05,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:01:05,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:01:05,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:01:05,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:01:05,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:01:05,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:01:05" (1/1) ... [2022-12-13 15:01:05,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3341dc30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:01:05, skipping insertion in model container [2022-12-13 15:01:05,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:01:05" (1/1) ... [2022-12-13 15:01:05,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:01:05,439 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:01:05,571 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_7d6205ae-e240-4381-80cd-8af20ecf8508/sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i[995,1008] [2022-12-13 15:01:05,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,688 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,689 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,691 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:01:05,730 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:01:05,742 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_7d6205ae-e240-4381-80cd-8af20ecf8508/sv-benchmarks/c/pthread-wmm/safe001_power.oepc.i[995,1008] [2022-12-13 15:01:05,763 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,771 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,789 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:01:05,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:01:05,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:01:05,833 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:01:05,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:01:05 WrapperNode [2022-12-13 15:01:05,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:01:05,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:01:05,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:01:05,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:01:05,841 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:01:05" (1/1) ... [2022-12-13 15:01:05,864 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:01:05" (1/1) ... [2022-12-13 15:01:05,889 INFO L138 Inliner]: procedures = 180, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 171 [2022-12-13 15:01:05,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:01:05,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:01:05,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:01:05,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:01:05,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:01:05" (1/1) ... [2022-12-13 15:01:05,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:01:05" (1/1) ... [2022-12-13 15:01:05,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:01:05" (1/1) ... [2022-12-13 15:01:05,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:01:05" (1/1) ... [2022-12-13 15:01:05,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:01:05" (1/1) ... [2022-12-13 15:01:05,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:01:05" (1/1) ... [2022-12-13 15:01:05,926 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:01:05" (1/1) ... [2022-12-13 15:01:05,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:01:05" (1/1) ... [2022-12-13 15:01:05,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:01:05,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:01:05,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:01:05,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:01:05,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:01:05" (1/1) ... [2022-12-13 15:01:05,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:01:05,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:01:05,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:01:05,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:01:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 15:01:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 15:01:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:01:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:01:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:01:06,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 15:01:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 15:01:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-13 15:01:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 15:01:06,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 15:01:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 15:01:06,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 15:01:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 15:01:06,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 15:01:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 15:01:06,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:01:06,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:01:06,007 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:01:06,152 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:01:06,153 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:01:06,773 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:01:07,551 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:01:07,551 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 15:01:07,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:01:07 BoogieIcfgContainer [2022-12-13 15:01:07,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:01:07,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:01:07,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:01:07,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:01:07,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:01:05" (1/3) ... [2022-12-13 15:01:07,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141bb962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:01:07, skipping insertion in model container [2022-12-13 15:01:07,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:01:05" (2/3) ... [2022-12-13 15:01:07,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141bb962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:01:07, skipping insertion in model container [2022-12-13 15:01:07,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:01:07" (3/3) ... [2022-12-13 15:01:07,558 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.oepc.i [2022-12-13 15:01:07,572 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:01:07,572 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2022-12-13 15:01:07,572 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 15:01:07,700 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 15:01:07,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 208 places, 200 transitions, 415 flow [2022-12-13 15:01:07,786 INFO L130 PetriNetUnfolder]: 2/197 cut-off events. [2022-12-13 15:01:07,787 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:01:07,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 197 events. 2/197 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 378 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-12-13 15:01:07,793 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 200 transitions, 415 flow [2022-12-13 15:01:07,800 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 197 transitions, 403 flow [2022-12-13 15:01:07,804 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 15:01:07,814 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 197 transitions, 403 flow [2022-12-13 15:01:07,817 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 197 transitions, 403 flow [2022-12-13 15:01:07,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 197 transitions, 403 flow [2022-12-13 15:01:07,901 INFO L130 PetriNetUnfolder]: 2/197 cut-off events. [2022-12-13 15:01:07,901 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:01:07,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 197 events. 2/197 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 382 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-12-13 15:01:07,908 INFO L119 LiptonReduction]: Number of co-enabled transitions 9828 [2022-12-13 15:01:26,530 WARN L233 SmtUtils]: Spent 7.16s on a formula simplification. DAG size of input: 237 DAG size of output: 233 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 15:01:55,682 INFO L134 LiptonReduction]: Checked pairs total: 53479 [2022-12-13 15:01:55,683 INFO L136 LiptonReduction]: Total number of compositions: 161 [2022-12-13 15:01:55,695 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:01:55,698 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;@5cb2086d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:01:55,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 109 error locations. [2022-12-13 15:01:55,700 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 15:01:55,700 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:01:55,700 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:01:55,700 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 15:01:55,700 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:01:55,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:01:55,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1365, now seen corresponding path program 1 times [2022-12-13 15:01:55,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:01:55,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428526028] [2022-12-13 15:01:55,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:01:55,713 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:01:55,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:01:55,714 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:01:55,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:01:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:01:55,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 15:01:55,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:01:55,805 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:01:55,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:01:55,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:01:55,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428526028] [2022-12-13 15:01:55,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1428526028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:01:55,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:01:55,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 15:01:55,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514837821] [2022-12-13 15:01:55,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:01:55,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 15:01:55,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:01:55,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 15:01:55,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 15:01:55,830 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 361 [2022-12-13 15:01:55,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 195 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have 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:01:55,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:01:55,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 361 [2022-12-13 15:01:55,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:02:00,934 INFO L130 PetriNetUnfolder]: 18354/25861 cut-off events. [2022-12-13 15:02:00,934 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 15:02:00,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51648 conditions, 25861 events. 18354/25861 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2326. Compared 181054 event pairs, 18354 based on Foata normal form. 400/10666 useless extension candidates. Maximal degree in co-relation 51637. Up to 25691 conditions per place. [2022-12-13 15:02:01,109 INFO L137 encePairwiseOnDemand]: 319/361 looper letters, 45 selfloop transitions, 0 changer transitions 0/51 dead transitions. [2022-12-13 15:02:01,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 51 transitions, 201 flow [2022-12-13 15:02:01,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 15:02:01,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 15:02:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2022-12-13 15:02:01,158 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4916897506925208 [2022-12-13 15:02:01,159 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 355 transitions. [2022-12-13 15:02:01,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 355 transitions. [2022-12-13 15:02:01,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:02:01,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 355 transitions. [2022-12-13 15:02:01,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 177.5) internal successors, (355), 2 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have 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:02:01,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 361.0) internal successors, (1083), 3 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:01,172 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 361.0) internal successors, (1083), 3 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:01,174 INFO L175 Difference]: Start difference. First operand has 102 places, 93 transitions, 195 flow. Second operand 2 states and 355 transitions. [2022-12-13 15:02:01,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 51 transitions, 201 flow [2022-12-13 15:02:01,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 15:02:01,181 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 108 flow [2022-12-13 15:02:01,183 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=108, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2022-12-13 15:02:01,187 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -43 predicate places. [2022-12-13 15:02:01,187 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 108 flow [2022-12-13 15:02:01,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have 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:02:01,188 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:02:01,188 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:02:01,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:01,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:01,389 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:02:01,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:02:01,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1348329, now seen corresponding path program 1 times [2022-12-13 15:02:01,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:02:01,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647216173] [2022-12-13 15:02:01,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:02:01,391 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:02:01,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:02:01,391 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:01,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:02:01,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 15:02:01,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:02:01,557 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 15:02:01,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 15:02:01,586 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:02:01,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:02:01,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:02:01,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647216173] [2022-12-13 15:02:01,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647216173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:02:01,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:02:01,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:02:01,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188323577] [2022-12-13 15:02:01,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:02:01,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:02:01,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:02:01,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:02:01,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:02:01,668 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 361 [2022-12-13 15:02:01,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 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:02:01,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:02:01,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 361 [2022-12-13 15:02:01,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:02:04,333 INFO L130 PetriNetUnfolder]: 9283/13253 cut-off events. [2022-12-13 15:02:04,334 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:02:04,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26510 conditions, 13253 events. 9283/13253 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1064. Compared 85294 event pairs, 5915 based on Foata normal form. 584/7418 useless extension candidates. Maximal degree in co-relation 26507. Up to 6798 conditions per place. [2022-12-13 15:02:04,416 INFO L137 encePairwiseOnDemand]: 348/361 looper letters, 56 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2022-12-13 15:02:04,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 246 flow [2022-12-13 15:02:04,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:02:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:02:04,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2022-12-13 15:02:04,419 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2022-12-13 15:02:04,419 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 456 transitions. [2022-12-13 15:02:04,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 456 transitions. [2022-12-13 15:02:04,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:02:04,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 456 transitions. [2022-12-13 15:02:04,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:02:04,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:04,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:04,423 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 108 flow. Second operand 3 states and 456 transitions. [2022-12-13 15:02:04,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 246 flow [2022-12-13 15:02:04,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 15:02:04,425 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 124 flow [2022-12-13 15:02:04,425 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2022-12-13 15:02:04,426 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -43 predicate places. [2022-12-13 15:02:04,426 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 124 flow [2022-12-13 15:02:04,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 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:02:04,426 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:02:04,426 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:02:04,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:04,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:04,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:02:04,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:02:04,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1348330, now seen corresponding path program 1 times [2022-12-13 15:02:04,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:02:04,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335469715] [2022-12-13 15:02:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:02:04,628 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:02:04,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:02:04,629 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:04,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:02:04,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:02:04,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:02:04,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:02:04,731 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:02:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:02:04,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:02:04,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:02:04,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335469715] [2022-12-13 15:02:04,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335469715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:02:04,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:02:04,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:02:04,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892639011] [2022-12-13 15:02:04,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:02:04,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:02:04,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:02:04,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:02:04,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:02:04,817 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 361 [2022-12-13 15:02:04,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:04,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:02:04,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 361 [2022-12-13 15:02:04,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:02:05,947 INFO L130 PetriNetUnfolder]: 2535/3802 cut-off events. [2022-12-13 15:02:05,947 INFO L131 PetriNetUnfolder]: For 437/546 co-relation queries the response was YES. [2022-12-13 15:02:05,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8555 conditions, 3802 events. 2535/3802 cut-off events. For 437/546 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 21632 event pairs, 2535 based on Foata normal form. 220/3310 useless extension candidates. Maximal degree in co-relation 8550. Up to 3702 conditions per place. [2022-12-13 15:02:05,960 INFO L137 encePairwiseOnDemand]: 350/361 looper letters, 31 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2022-12-13 15:02:05,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 38 transitions, 170 flow [2022-12-13 15:02:05,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:02:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:02:05,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2022-12-13 15:02:05,962 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4053554939981533 [2022-12-13 15:02:05,962 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2022-12-13 15:02:05,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2022-12-13 15:02:05,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:02:05,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2022-12-13 15:02:05,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have 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:02:05,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:05,965 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:05,965 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 124 flow. Second operand 3 states and 439 transitions. [2022-12-13 15:02:05,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 38 transitions, 170 flow [2022-12-13 15:02:05,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:02:05,968 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 100 flow [2022-12-13 15:02:05,968 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-12-13 15:02:05,969 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -53 predicate places. [2022-12-13 15:02:05,969 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 100 flow [2022-12-13 15:02:05,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:05,969 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:02:05,969 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:02:05,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:06,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:06,171 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:02:06,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:02:06,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1562238127, now seen corresponding path program 1 times [2022-12-13 15:02:06,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:02:06,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099143670] [2022-12-13 15:02:06,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:02:06,177 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:02:06,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:02:06,180 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:06,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:02:06,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 15:02:06,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:02:06,378 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:02:06,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:02:06,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:02:06,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099143670] [2022-12-13 15:02:06,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099143670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:02:06,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:02:06,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:02:06,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332136676] [2022-12-13 15:02:06,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:02:06,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:02:06,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:02:06,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:02:06,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:02:06,390 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 361 [2022-12-13 15:02:06,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have 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:02:06,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:02:06,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 361 [2022-12-13 15:02:06,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:02:06,817 INFO L130 PetriNetUnfolder]: 950/1588 cut-off events. [2022-12-13 15:02:06,817 INFO L131 PetriNetUnfolder]: For 121/155 co-relation queries the response was YES. [2022-12-13 15:02:06,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3497 conditions, 1588 events. 950/1588 cut-off events. For 121/155 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 8848 event pairs, 377 based on Foata normal form. 18/1335 useless extension candidates. Maximal degree in co-relation 3492. Up to 1464 conditions per place. [2022-12-13 15:02:06,822 INFO L137 encePairwiseOnDemand]: 356/361 looper letters, 42 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2022-12-13 15:02:06,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 224 flow [2022-12-13 15:02:06,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:02:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:02:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2022-12-13 15:02:06,823 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40350877192982454 [2022-12-13 15:02:06,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2022-12-13 15:02:06,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2022-12-13 15:02:06,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:02:06,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2022-12-13 15:02:06,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have 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:02:06,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:06,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:06,826 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 100 flow. Second operand 3 states and 437 transitions. [2022-12-13 15:02:06,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 224 flow [2022-12-13 15:02:06,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 223 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:02:06,827 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 125 flow [2022-12-13 15:02:06,827 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-12-13 15:02:06,828 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -52 predicate places. [2022-12-13 15:02:06,828 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 125 flow [2022-12-13 15:02:06,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have 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:02:06,828 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:02:06,828 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:02:06,836 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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)] Ended with exit code 0 [2022-12-13 15:02:07,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:07,030 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:02:07,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:02:07,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2052964345, now seen corresponding path program 1 times [2022-12-13 15:02:07,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:02:07,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079865162] [2022-12-13 15:02:07,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:02:07,035 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:02:07,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:02:07,038 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:07,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:02:07,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:02:07,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:02:07,210 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:02:07,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:02:07,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:02:07,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079865162] [2022-12-13 15:02:07,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079865162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:02:07,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:02:07,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:02:07,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450480425] [2022-12-13 15:02:07,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:02:07,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:02:07,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:02:07,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:02:07,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:02:07,221 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 361 [2022-12-13 15:02:07,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:07,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:02:07,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 361 [2022-12-13 15:02:07,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:02:07,519 INFO L130 PetriNetUnfolder]: 212/433 cut-off events. [2022-12-13 15:02:07,519 INFO L131 PetriNetUnfolder]: For 68/72 co-relation queries the response was YES. [2022-12-13 15:02:07,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1070 conditions, 433 events. 212/433 cut-off events. For 68/72 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1845 event pairs, 68 based on Foata normal form. 21/401 useless extension candidates. Maximal degree in co-relation 1064. Up to 246 conditions per place. [2022-12-13 15:02:07,520 INFO L137 encePairwiseOnDemand]: 356/361 looper letters, 50 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-13 15:02:07,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 62 transitions, 295 flow [2022-12-13 15:02:07,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:02:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:02:07,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 578 transitions. [2022-12-13 15:02:07,522 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4002770083102493 [2022-12-13 15:02:07,522 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 578 transitions. [2022-12-13 15:02:07,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 578 transitions. [2022-12-13 15:02:07,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:02:07,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 578 transitions. [2022-12-13 15:02:07,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have 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:02:07,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 361.0) internal successors, (1805), 5 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:07,525 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 361.0) internal successors, (1805), 5 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:07,525 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 125 flow. Second operand 4 states and 578 transitions. [2022-12-13 15:02:07,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 62 transitions, 295 flow [2022-12-13 15:02:07,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:02:07,526 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 161 flow [2022-12-13 15:02:07,526 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-13 15:02:07,527 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -49 predicate places. [2022-12-13 15:02:07,527 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 161 flow [2022-12-13 15:02:07,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:07,527 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:02:07,527 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:02:07,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:07,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:07,729 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:02:07,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:02:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash 749683347, now seen corresponding path program 1 times [2022-12-13 15:02:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:02:07,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201205632] [2022-12-13 15:02:07,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:02:07,733 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:02:07,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:02:07,736 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:07,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:02:07,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:02:07,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:02:07,930 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:02:07,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:02:07,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:02:07,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201205632] [2022-12-13 15:02:07,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201205632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:02:07,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:02:07,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:02:07,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353100772] [2022-12-13 15:02:07,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:02:07,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:02:07,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:02:07,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:02:07,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:02:07,944 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 361 [2022-12-13 15:02:07,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 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:02:07,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:02:07,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 361 [2022-12-13 15:02:07,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:02:08,297 INFO L130 PetriNetUnfolder]: 114/229 cut-off events. [2022-12-13 15:02:08,297 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2022-12-13 15:02:08,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 229 events. 114/229 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 784 event pairs, 40 based on Foata normal form. 8/230 useless extension candidates. Maximal degree in co-relation 635. Up to 92 conditions per place. [2022-12-13 15:02:08,299 INFO L137 encePairwiseOnDemand]: 356/361 looper letters, 40 selfloop transitions, 10 changer transitions 1/54 dead transitions. [2022-12-13 15:02:08,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 275 flow [2022-12-13 15:02:08,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:02:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:02:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2022-12-13 15:02:08,301 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3889196675900277 [2022-12-13 15:02:08,301 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2022-12-13 15:02:08,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2022-12-13 15:02:08,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:02:08,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2022-12-13 15:02:08,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:08,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:08,307 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:08,307 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 161 flow. Second operand 5 states and 702 transitions. [2022-12-13 15:02:08,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 275 flow [2022-12-13 15:02:08,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 259 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 15:02:08,309 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 139 flow [2022-12-13 15:02:08,309 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2022-12-13 15:02:08,310 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -55 predicate places. [2022-12-13 15:02:08,310 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 139 flow [2022-12-13 15:02:08,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 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:02:08,311 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:02:08,311 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:02:08,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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)] Ended with exit code 0 [2022-12-13 15:02:08,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:08,512 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:02:08,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:02:08,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2120967363, now seen corresponding path program 1 times [2022-12-13 15:02:08,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:02:08,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616842361] [2022-12-13 15:02:08,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:02:08,516 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:02:08,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:02:08,518 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:08,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:02:08,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:02:08,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:02:08,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:02:08,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:02:08,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:02:08,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616842361] [2022-12-13 15:02:08,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616842361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:02:08,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:02:08,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:02:08,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031731771] [2022-12-13 15:02:08,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:02:08,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:02:08,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:02:08,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:02:08,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:02:08,722 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 361 [2022-12-13 15:02:08,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have 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:02:08,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:02:08,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 361 [2022-12-13 15:02:08,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:02:08,963 INFO L130 PetriNetUnfolder]: 205/406 cut-off events. [2022-12-13 15:02:08,963 INFO L131 PetriNetUnfolder]: For 415/415 co-relation queries the response was YES. [2022-12-13 15:02:08,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 406 events. 205/406 cut-off events. For 415/415 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1751 event pairs, 96 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 1170. Up to 238 conditions per place. [2022-12-13 15:02:08,965 INFO L137 encePairwiseOnDemand]: 358/361 looper letters, 57 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2022-12-13 15:02:08,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 375 flow [2022-12-13 15:02:08,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:02:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:02:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2022-12-13 15:02:08,966 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.407202216066482 [2022-12-13 15:02:08,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2022-12-13 15:02:08,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2022-12-13 15:02:08,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:02:08,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2022-12-13 15:02:08,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:08,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:08,968 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:08,968 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 139 flow. Second operand 3 states and 441 transitions. [2022-12-13 15:02:08,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 375 flow [2022-12-13 15:02:08,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 325 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 15:02:08,970 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 125 flow [2022-12-13 15:02:08,970 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2022-12-13 15:02:08,970 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -56 predicate places. [2022-12-13 15:02:08,970 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 125 flow [2022-12-13 15:02:08,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have 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:02:08,971 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:02:08,971 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:02:08,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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)] Ended with exit code 0 [2022-12-13 15:02:09,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:09,173 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:02:09,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:02:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1493932450, now seen corresponding path program 1 times [2022-12-13 15:02:09,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:02:09,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686502343] [2022-12-13 15:02:09,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:02:09,176 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:02:09,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:02:09,177 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:09,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:02:09,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 15:02:09,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:02:23,395 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:02:23,400 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:02:23,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2022-12-13 15:02:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:02:23,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:02:23,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:02:23,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686502343] [2022-12-13 15:02:23,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686502343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:02:23,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:02:23,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:02:23,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922573878] [2022-12-13 15:02:23,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:02:23,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:02:23,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:02:23,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:02:23,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:02:23,581 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 361 [2022-12-13 15:02:23,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have 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:02:23,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:02:23,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 361 [2022-12-13 15:02:23,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:02:23,864 INFO L130 PetriNetUnfolder]: 248/499 cut-off events. [2022-12-13 15:02:23,864 INFO L131 PetriNetUnfolder]: For 387/387 co-relation queries the response was YES. [2022-12-13 15:02:23,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 499 events. 248/499 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2203 event pairs, 51 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 1379. Up to 379 conditions per place. [2022-12-13 15:02:23,867 INFO L137 encePairwiseOnDemand]: 357/361 looper letters, 46 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2022-12-13 15:02:23,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 50 transitions, 275 flow [2022-12-13 15:02:23,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:02:23,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:02:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2022-12-13 15:02:23,869 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3717451523545706 [2022-12-13 15:02:23,870 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2022-12-13 15:02:23,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2022-12-13 15:02:23,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:02:23,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2022-12-13 15:02:23,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have 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:02:23,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:23,872 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:23,872 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 125 flow. Second operand 5 states and 671 transitions. [2022-12-13 15:02:23,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 50 transitions, 275 flow [2022-12-13 15:02:23,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:02:23,875 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 127 flow [2022-12-13 15:02:23,875 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2022-12-13 15:02:23,875 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -54 predicate places. [2022-12-13 15:02:23,875 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 127 flow [2022-12-13 15:02:23,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have 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:02:23,875 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:02:23,876 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:02:23,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:24,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:24,077 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:02:24,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:02:24,079 INFO L85 PathProgramCache]: Analyzing trace with hash -782359369, now seen corresponding path program 1 times [2022-12-13 15:02:24,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:02:24,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900964795] [2022-12-13 15:02:24,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:02:24,082 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:02:24,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:02:24,085 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:24,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:02:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:02:24,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:02:24,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:02:59,272 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 2556 treesize of output 2550 [2022-12-13 15:02:59,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 2550 treesize of output 2557 [2022-12-13 15:02:59,334 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 2538 treesize of output 2532 [2022-12-13 15:02:59,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 2532 treesize of output 2539 [2022-12-13 15:02:59,396 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 2520 treesize of output 2514 [2022-12-13 15:02:59,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 2514 treesize of output 2525 [2022-12-13 15:02:59,467 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 2506 treesize of output 2504 [2022-12-13 15:02:59,497 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 2504 treesize of output 2502 [2022-12-13 15:02:59,715 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:02:59,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:02:59,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:02:59,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900964795] [2022-12-13 15:02:59,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900964795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:02:59,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:02:59,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:02:59,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017218892] [2022-12-13 15:02:59,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:02:59,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:02:59,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:02:59,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:02:59,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:02:59,838 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 361 [2022-12-13 15:02:59,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:02:59,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:02:59,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 361 [2022-12-13 15:02:59,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:03:00,073 INFO L130 PetriNetUnfolder]: 248/497 cut-off events. [2022-12-13 15:03:00,073 INFO L131 PetriNetUnfolder]: For 387/387 co-relation queries the response was YES. [2022-12-13 15:03:00,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 497 events. 248/497 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2194 event pairs, 51 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 1405. Up to 383 conditions per place. [2022-12-13 15:03:00,074 INFO L137 encePairwiseOnDemand]: 358/361 looper letters, 46 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2022-12-13 15:03:00,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 275 flow [2022-12-13 15:03:00,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:03:00,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:03:00,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 552 transitions. [2022-12-13 15:03:00,076 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38227146814404434 [2022-12-13 15:03:00,076 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 552 transitions. [2022-12-13 15:03:00,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 552 transitions. [2022-12-13 15:03:00,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:03:00,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 552 transitions. [2022-12-13 15:03:00,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:03:00,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 361.0) internal successors, (1805), 5 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:03:00,078 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 361.0) internal successors, (1805), 5 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:03:00,078 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 127 flow. Second operand 4 states and 552 transitions. [2022-12-13 15:03:00,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 275 flow [2022-12-13 15:03:00,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 270 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 15:03:00,080 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 124 flow [2022-12-13 15:03:00,080 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2022-12-13 15:03:00,080 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -55 predicate places. [2022-12-13 15:03:00,080 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 124 flow [2022-12-13 15:03:00,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:03:00,081 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:03:00,081 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:03:00,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:00,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:00,282 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:03:00,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:03:00,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1964868311, now seen corresponding path program 2 times [2022-12-13 15:03:00,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:03:00,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808995933] [2022-12-13 15:03:00,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 15:03:00,286 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:03:00,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:03:00,288 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:00,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:00,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 15:03:00,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:03:00,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 15:03:00,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:03:00,588 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:03:00,615 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:03:00,730 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:03:00,734 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:03:00,741 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:03:00,764 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:03:00,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:03:00,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:03:00,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808995933] [2022-12-13 15:03:00,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808995933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:03:00,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:03:00,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:03:00,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593473865] [2022-12-13 15:03:00,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:03:00,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:03:00,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:03:00,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:03:00,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:03:01,151 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 361 [2022-12-13 15:03:01,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 124 flow. Second operand has 6 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have 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:03:01,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:03:01,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 361 [2022-12-13 15:03:01,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:03:01,741 INFO L130 PetriNetUnfolder]: 361/692 cut-off events. [2022-12-13 15:03:01,741 INFO L131 PetriNetUnfolder]: For 575/575 co-relation queries the response was YES. [2022-12-13 15:03:01,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2035 conditions, 692 events. 361/692 cut-off events. For 575/575 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3265 event pairs, 112 based on Foata normal form. 1/692 useless extension candidates. Maximal degree in co-relation 2027. Up to 457 conditions per place. [2022-12-13 15:03:01,745 INFO L137 encePairwiseOnDemand]: 352/361 looper letters, 47 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2022-12-13 15:03:01,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 321 flow [2022-12-13 15:03:01,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:03:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:03:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 643 transitions. [2022-12-13 15:03:01,748 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3562326869806094 [2022-12-13 15:03:01,748 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 643 transitions. [2022-12-13 15:03:01,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 643 transitions. [2022-12-13 15:03:01,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:03:01,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 643 transitions. [2022-12-13 15:03:01,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:03:01,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:03:01,755 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:03:01,755 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 124 flow. Second operand 5 states and 643 transitions. [2022-12-13 15:03:01,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 321 flow [2022-12-13 15:03:01,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:03:01,758 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 172 flow [2022-12-13 15:03:01,759 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2022-12-13 15:03:01,759 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -52 predicate places. [2022-12-13 15:03:01,759 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 172 flow [2022-12-13 15:03:01,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have 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:03:01,760 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:03:01,760 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:03:01,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:01,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:01,961 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:03:01,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:03:01,963 INFO L85 PathProgramCache]: Analyzing trace with hash 458013225, now seen corresponding path program 3 times [2022-12-13 15:03:01,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:03:01,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677165411] [2022-12-13 15:03:01,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 15:03:01,966 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:03:01,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:03:01,969 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:01,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:02,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 15:03:02,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:03:02,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 15:03:02,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:03:04,709 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:03:04,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2022-12-13 15:03:04,850 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:03:05,189 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:03:05,286 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:03:05,412 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:03:05,526 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:03:05,530 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:03:05,540 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:03:05,574 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:03:05,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:03:05,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:03:05,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677165411] [2022-12-13 15:03:05,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677165411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:03:05,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:03:05,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:03:05,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266928741] [2022-12-13 15:03:05,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:03:05,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 15:03:05,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:03:05,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 15:03:05,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:03:06,071 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 361 [2022-12-13 15:03:06,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 172 flow. Second operand has 8 states, 8 states have (on average 122.625) internal successors, (981), 8 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have 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:03:06,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:03:06,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 361 [2022-12-13 15:03:06,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:03:06,524 INFO L130 PetriNetUnfolder]: 424/828 cut-off events. [2022-12-13 15:03:06,525 INFO L131 PetriNetUnfolder]: For 789/789 co-relation queries the response was YES. [2022-12-13 15:03:06,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2830 conditions, 828 events. 424/828 cut-off events. For 789/789 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4222 event pairs, 146 based on Foata normal form. 1/828 useless extension candidates. Maximal degree in co-relation 2821. Up to 410 conditions per place. [2022-12-13 15:03:06,527 INFO L137 encePairwiseOnDemand]: 355/361 looper letters, 53 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2022-12-13 15:03:06,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 392 flow [2022-12-13 15:03:06,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:03:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:03:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 643 transitions. [2022-12-13 15:03:06,529 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3562326869806094 [2022-12-13 15:03:06,529 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 643 transitions. [2022-12-13 15:03:06,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 643 transitions. [2022-12-13 15:03:06,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:03:06,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 643 transitions. [2022-12-13 15:03:06,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:03:06,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:03:06,532 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 361.0) internal successors, (2166), 6 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:03:06,532 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 172 flow. Second operand 5 states and 643 transitions. [2022-12-13 15:03:06,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 392 flow [2022-12-13 15:03:06,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 62 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:03:06,535 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 208 flow [2022-12-13 15:03:06,535 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2022-12-13 15:03:06,535 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -49 predicate places. [2022-12-13 15:03:06,535 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 208 flow [2022-12-13 15:03:06,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 122.625) internal successors, (981), 8 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have 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:03:06,535 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:03:06,535 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:03:06,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:06,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:06,737 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:03:06,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:03:06,738 INFO L85 PathProgramCache]: Analyzing trace with hash -931422905, now seen corresponding path program 4 times [2022-12-13 15:03:06,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:03:06,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942674093] [2022-12-13 15:03:06,740 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 15:03:06,740 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:03:06,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:03:06,743 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:06,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:07,015 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 15:03:07,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:03:07,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 15:03:07,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:03:07,051 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 15:03:07,051 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:03:07,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-12-13 15:03:51,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2022-12-13 15:03:51,382 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:03:51,468 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 15:03:51,468 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:03:51,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-12-13 15:03:51,563 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 15:03:51,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-12-13 15:03:51,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 16 [2022-12-13 15:03:51,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 15:03:51,690 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:03:51,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:03:51,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:03:51,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942674093] [2022-12-13 15:03:51,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942674093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:03:51,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:03:51,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:03:51,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246904412] [2022-12-13 15:03:51,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:03:51,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 15:03:51,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:03:51,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 15:03:51,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:03:52,010 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 361 [2022-12-13 15:03:52,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 208 flow. Second operand has 8 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have 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:03:52,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:03:52,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 361 [2022-12-13 15:03:52,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:03:52,654 INFO L130 PetriNetUnfolder]: 473/940 cut-off events. [2022-12-13 15:03:52,654 INFO L131 PetriNetUnfolder]: For 1049/1049 co-relation queries the response was YES. [2022-12-13 15:03:52,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3318 conditions, 940 events. 473/940 cut-off events. For 1049/1049 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5010 event pairs, 88 based on Foata normal form. 1/941 useless extension candidates. Maximal degree in co-relation 3308. Up to 634 conditions per place. [2022-12-13 15:03:52,658 INFO L137 encePairwiseOnDemand]: 354/361 looper letters, 68 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2022-12-13 15:03:52,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 528 flow [2022-12-13 15:03:52,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:03:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 15:03:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2022-12-13 15:03:52,660 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3407202216066482 [2022-12-13 15:03:52,660 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 738 transitions. [2022-12-13 15:03:52,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 738 transitions. [2022-12-13 15:03:52,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:03:52,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 738 transitions. [2022-12-13 15:03:52,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.0) internal successors, (738), 6 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have 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:03:52,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 361.0) internal successors, (2527), 7 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have 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:03:52,663 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 361.0) internal successors, (2527), 7 states have internal predecessors, (2527), 0 states have call successors, (0), 0 states have 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:03:52,663 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 208 flow. Second operand 6 states and 738 transitions. [2022-12-13 15:03:52,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 528 flow [2022-12-13 15:03:52,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 518 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:03:52,667 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 262 flow [2022-12-13 15:03:52,667 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=361, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2022-12-13 15:03:52,668 INFO L288 CegarLoopForPetriNet]: 102 programPoint places, -43 predicate places. [2022-12-13 15:03:52,668 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 262 flow [2022-12-13 15:03:52,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.625) internal successors, (933), 8 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have 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:03:52,668 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:03:52,668 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:03:52,680 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:52,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:52,870 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 106 more)] === [2022-12-13 15:03:52,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:03:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash 581291197, now seen corresponding path program 5 times [2022-12-13 15:03:52,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:03:52,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042718611] [2022-12-13 15:03:52,873 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 15:03:52,873 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:03:52,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:03:52,875 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:52,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:53,099 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 15:03:53,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 15:03:53,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:03:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:03:53,305 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 15:03:53,306 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 15:03:53,306 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (108 of 109 remaining) [2022-12-13 15:03:53,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 109 remaining) [2022-12-13 15:03:53,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 109 remaining) [2022-12-13 15:03:53,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 109 remaining) [2022-12-13 15:03:53,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 109 remaining) [2022-12-13 15:03:53,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 109 remaining) [2022-12-13 15:03:53,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 109 remaining) [2022-12-13 15:03:53,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 109 remaining) [2022-12-13 15:03:53,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 109 remaining) [2022-12-13 15:03:53,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 109 remaining) [2022-12-13 15:03:53,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 109 remaining) [2022-12-13 15:03:53,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 109 remaining) [2022-12-13 15:03:53,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 109 remaining) [2022-12-13 15:03:53,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 109 remaining) [2022-12-13 15:03:53,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 109 remaining) [2022-12-13 15:03:53,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 109 remaining) [2022-12-13 15:03:53,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 109 remaining) [2022-12-13 15:03:53,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 109 remaining) [2022-12-13 15:03:53,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 109 remaining) [2022-12-13 15:03:53,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 109 remaining) [2022-12-13 15:03:53,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 109 remaining) [2022-12-13 15:03:53,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 109 remaining) [2022-12-13 15:03:53,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 109 remaining) [2022-12-13 15:03:53,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 109 remaining) [2022-12-13 15:03:53,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 109 remaining) [2022-12-13 15:03:53,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 109 remaining) [2022-12-13 15:03:53,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 109 remaining) [2022-12-13 15:03:53,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 109 remaining) [2022-12-13 15:03:53,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 109 remaining) [2022-12-13 15:03:53,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 109 remaining) [2022-12-13 15:03:53,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 109 remaining) [2022-12-13 15:03:53,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 109 remaining) [2022-12-13 15:03:53,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 109 remaining) [2022-12-13 15:03:53,309 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 109 remaining) [2022-12-13 15:03:53,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 109 remaining) [2022-12-13 15:03:53,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 109 remaining) [2022-12-13 15:03:53,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 109 remaining) [2022-12-13 15:03:53,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 109 remaining) [2022-12-13 15:03:53,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 109 remaining) [2022-12-13 15:03:53,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 109 remaining) [2022-12-13 15:03:53,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 109 remaining) [2022-12-13 15:03:53,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 109 remaining) [2022-12-13 15:03:53,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 109 remaining) [2022-12-13 15:03:53,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 109 remaining) [2022-12-13 15:03:53,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 109 remaining) [2022-12-13 15:03:53,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 109 remaining) [2022-12-13 15:03:53,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 109 remaining) [2022-12-13 15:03:53,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 109 remaining) [2022-12-13 15:03:53,310 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 109 remaining) [2022-12-13 15:03:53,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 109 remaining) [2022-12-13 15:03:53,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 109 remaining) [2022-12-13 15:03:53,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 109 remaining) [2022-12-13 15:03:53,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 109 remaining) [2022-12-13 15:03:53,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 109 remaining) [2022-12-13 15:03:53,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 109 remaining) [2022-12-13 15:03:53,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 109 remaining) [2022-12-13 15:03:53,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 109 remaining) [2022-12-13 15:03:53,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 109 remaining) [2022-12-13 15:03:53,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 109 remaining) [2022-12-13 15:03:53,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 109 remaining) [2022-12-13 15:03:53,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 109 remaining) [2022-12-13 15:03:53,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 109 remaining) [2022-12-13 15:03:53,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 109 remaining) [2022-12-13 15:03:53,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 109 remaining) [2022-12-13 15:03:53,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 109 remaining) [2022-12-13 15:03:53,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (43 of 109 remaining) [2022-12-13 15:03:53,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 109 remaining) [2022-12-13 15:03:53,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 109 remaining) [2022-12-13 15:03:53,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 109 remaining) [2022-12-13 15:03:53,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 109 remaining) [2022-12-13 15:03:53,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 109 remaining) [2022-12-13 15:03:53,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 109 remaining) [2022-12-13 15:03:53,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 109 remaining) [2022-12-13 15:03:53,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 109 remaining) [2022-12-13 15:03:53,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 109 remaining) [2022-12-13 15:03:53,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 109 remaining) [2022-12-13 15:03:53,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 109 remaining) [2022-12-13 15:03:53,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 109 remaining) [2022-12-13 15:03:53,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 109 remaining) [2022-12-13 15:03:53,312 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 109 remaining) [2022-12-13 15:03:53,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 109 remaining) [2022-12-13 15:03:53,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 109 remaining) [2022-12-13 15:03:53,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 109 remaining) [2022-12-13 15:03:53,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 109 remaining) [2022-12-13 15:03:53,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 109 remaining) [2022-12-13 15:03:53,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 109 remaining) [2022-12-13 15:03:53,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 109 remaining) [2022-12-13 15:03:53,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 109 remaining) [2022-12-13 15:03:53,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 109 remaining) [2022-12-13 15:03:53,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 109 remaining) [2022-12-13 15:03:53,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 109 remaining) [2022-12-13 15:03:53,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 109 remaining) [2022-12-13 15:03:53,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 109 remaining) [2022-12-13 15:03:53,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 109 remaining) [2022-12-13 15:03:53,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 109 remaining) [2022-12-13 15:03:53,313 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 109 remaining) [2022-12-13 15:03:53,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 109 remaining) [2022-12-13 15:03:53,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 109 remaining) [2022-12-13 15:03:53,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 109 remaining) [2022-12-13 15:03:53,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 109 remaining) [2022-12-13 15:03:53,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 109 remaining) [2022-12-13 15:03:53,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 109 remaining) [2022-12-13 15:03:53,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 109 remaining) [2022-12-13 15:03:53,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 109 remaining) [2022-12-13 15:03:53,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 109 remaining) [2022-12-13 15:03:53,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 109 remaining) [2022-12-13 15:03:53,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 109 remaining) [2022-12-13 15:03:53,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 109 remaining) [2022-12-13 15:03:53,314 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 109 remaining) [2022-12-13 15:03:53,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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)] Forceful destruction successful, exit code 0 [2022-12-13 15:03:53,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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:03:53,516 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:03:53,533 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 15:03:53,533 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 15:03:53,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:03:53 BasicIcfg [2022-12-13 15:03:53,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 15:03:53,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 15:03:53,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 15:03:53,604 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 15:03:53,605 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:01:07" (3/4) ... [2022-12-13 15:03:53,607 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 15:03:53,607 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 15:03:53,607 INFO L158 Benchmark]: Toolchain (without parser) took 168211.83ms. Allocated memory was 62.9MB in the beginning and 2.0GB in the end (delta: 2.0GB). Free memory was 31.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 832.4MB. Max. memory is 16.1GB. [2022-12-13 15:03:53,607 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 62.9MB. Free memory was 41.5MB in the beginning and 41.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:03:53,608 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.83ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 31.6MB in the beginning and 52.0MB in the end (delta: -20.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2022-12-13 15:03:53,608 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.11ms. Allocated memory is still 75.5MB. Free memory was 51.7MB in the beginning and 48.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:03:53,608 INFO L158 Benchmark]: Boogie Preprocessor took 44.79ms. Allocated memory is still 75.5MB. Free memory was 48.9MB in the beginning and 46.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:03:53,608 INFO L158 Benchmark]: RCFGBuilder took 1617.08ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 46.1MB in the beginning and 40.6MB in the end (delta: 5.5MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2022-12-13 15:03:53,608 INFO L158 Benchmark]: TraceAbstraction took 166049.75ms. Allocated memory was 100.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 39.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 801.9MB. Max. memory is 16.1GB. [2022-12-13 15:03:53,609 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 2.0GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:03:53,610 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.12ms. Allocated memory is still 62.9MB. Free memory was 41.5MB in the beginning and 41.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.83ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 31.6MB in the beginning and 52.0MB in the end (delta: -20.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.11ms. Allocated memory is still 75.5MB. Free memory was 51.7MB in the beginning and 48.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.79ms. Allocated memory is still 75.5MB. Free memory was 48.9MB in the beginning and 46.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1617.08ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 46.1MB in the beginning and 40.6MB in the end (delta: 5.5MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * TraceAbstraction took 166049.75ms. Allocated memory was 100.7MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 39.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 801.9MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 2.0GB. Free memory is still 1.2GB. 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: 47.9s, 205 PlacesBefore, 102 PlacesAfterwards, 197 TransitionsBefore, 93 TransitionsAfterwards, 9828 CoEnabledTransitionPairs, 8 FixpointIterations, 67 TrivialSequentialCompositions, 89 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 161 TotalNumberOfCompositions, 53479 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10456, independent: 9667, independent conditional: 0, independent unconditional: 9667, dependent: 789, dependent conditional: 0, dependent unconditional: 789, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3374, independent: 3253, independent conditional: 0, independent unconditional: 3253, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10456, independent: 6414, independent conditional: 0, independent unconditional: 6414, dependent: 668, dependent conditional: 0, dependent unconditional: 668, unknown: 3374, unknown conditional: 0, unknown unconditional: 3374] , Statistics on independence cache: Total cache size (in pairs): 379, Positive cache size: 326, Positive conditional cache size: 0, Positive unconditional cache size: 326, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1801; [L852] FCALL, FORK 0 pthread_create(&t1801, ((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_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$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_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1801, ((void *)0), P0, ((void *)0))=0, t1801={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L764] 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)))) [L764] EXPR 1 \read(y) [L764] 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)))) [L764] 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)))) [L765] 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)))) [L766] 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)))) [L767] 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)))) [L768] 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)))) [L769] 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)))) [L770] 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)))) [L771] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L772] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L773] EXPR 1 \read(y) [L773] 1 __unbuffered_p0_EAX = y [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] 1 y = y$flush_delayed ? y$mem_tmp : y [L775] 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_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$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_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=128, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 1 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_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$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_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=128, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L853] 0 pthread_t t1802; [L854] FCALL, FORK 0 pthread_create(&t1802, ((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_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$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_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1802, ((void *)0), P1, ((void *)0))=1, t1801={15:0}, t1802={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=128, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 x = 2 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_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$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_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=128, x=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] 0 pthread_t t1803; [L856] FCALL, FORK 0 pthread_create(&t1803, ((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_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$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_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(&t1803, ((void *)0), P2, ((void *)0))=2, t1801={15:0}, t1802={7:0}, t1803={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=128, x=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 2 y = 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_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$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_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, weak$$choice0=2, weak$$choice1=0, weak$$choice2=128, x=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 \read(y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L798] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L799] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L800] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\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_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$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_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, weak$$choice0=2, weak$$choice1=0, weak$$choice2=128, x=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 y$flush_delayed = weak$$choice2 [L813] EXPR 3 \read(y) [L813] 3 y$mem_tmp = y [L814] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L814] EXPR 3 \read(y) [L814] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L814] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L816] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L817] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L818] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L820] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 3 \read(y) [L821] 3 __unbuffered_p2_EAX = y [L822] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L822] EXPR 3 \read(y) [L822] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L822] 3 y = y$flush_delayed ? y$mem_tmp : y [L823] 3 y$flush_delayed = (_Bool)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_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$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_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=4, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 3 y = 2 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_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$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_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=4, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L829] 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) [L829] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L829] EXPR 3 \read(y) [L829] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L829] 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) [L829] 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) [L830] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L831] 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 [L832] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L833] 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_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$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_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=4, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 3 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] 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) [L862] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L862] EXPR 0 \read(y) [L862] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L862] 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) [L862] 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) [L863] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 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 [L865] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L866] 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}, __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_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$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_p2_EAX=1, 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, t1801={15:0}, t1802={7:0}, t1803={5:0}, weak$$choice0=4, weak$$choice1=0, weak$$choice2=0, x=2, y={3:0}, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L869] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L870] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L871] 0 y$flush_delayed = weak$$choice2 [L872] EXPR 0 \read(y) [L872] 0 y$mem_tmp = y [L873] 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) [L873] EXPR 0 \read(y) [L873] 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) [L873] 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) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 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)) [L878] 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)) [L879] 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)) [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 x == 2 && y == 2 [L882] EXPR 0 \read(y) [L882] EXPR 0 x == 2 && y == 2 [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L883] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L883] EXPR 0 \read(y) [L883] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 [L886] 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}, __unbuffered_cnt=3, __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_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$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_p2_EAX=1, 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=2, weak$$choice2=0, x=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 852]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 265 locations, 109 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: 165.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 48.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1182 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 793 mSDsluCounter, 562 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 370 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2104 IncrementalHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 192 mSDtfsCounter, 2104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=12, InterpolantAutomatonStates: 48, 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, 98.0s InterpolantComputationTime, 204 NumberOfCodeBlocks, 204 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 1934 SizeOfPredicates, 87 NumberOfNonLiveVariables, 2082 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:03:53,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d6205ae-e240-4381-80cd-8af20ecf8508/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